would be
2^(160/2)=2^80
Book further says-"If you want to drop the odds of
some one breaking your system to less than
1 in 2^80,use a 160 bit one-way hash function".
The birthday attack only works when we find 2 random
messages that hashes to the same value.
Here we know one message a
Check this one out for a very simple description:
http://www.howstuffworks.com/question261.htm
On Mon, 17 Feb 2003, Sarad AV wrote:
> hi,
>
> http://www.x5.net/faqs/crypto/q95.html
>
> If some function, when supplied with a random input,
> returns one of k equally-likely values, then by
> repeat
hi,
http://www.x5.net/faqs/crypto/q95.html
If some function, when supplied with a random input,
returns one of k equally-likely values, then by
repeatedly evaluating the function for different
inputs, we expect to obtain the same output after
about 1.2k1/2. For the above birthday paradox, replace
