Sarad AV wrote:
--- Sandy Harris [EMAIL PROTECTED] wrote:
[EMAIL PROTECTED] wrote:
there's a well known simple scheme ...
I read that Intel chipsets use something similar,
its given in rfc 1750
5.2.2 Using Transition Mappings to De-Skew
I know the von Neumann technique for pairs
at Thursday, October 17, 2002 4:38 PM, Sarad AV
[EMAIL PROTECTED] was seen to say:
He wanted to know how I was able to do XOR on P(0) and
P(1) when xor is defined only on binary digits.
you don't.
P(x) is a probability of digit x in the output. ideally, P(0)=P(1)=0.5
(obviously in binary, only
hi,
In the book on Applied Cryptography by Bruce
Schenier,it goes like this...
let p(0) be the probability of occurance of 0
and p(1) be the probability od occurance of one.
let
p(0)=0.5+e
p(1)=0.5-e
where e is the bias of the bit towards 0 or 1
ideally e=0 P(0)=P(1)=0.5(no bias
