-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
In message <[EMAIL PROTECTED]>, Maarten
<[EMAIL PROTECTED]> writes
>Ik al request in the network consists of 20 bytes(160 bits) + keytype
>how many different keys can exists in the network before conflicts (can)
>happen between 2 hashes. this should be easy to calculate, but my math
>is a lot rusty.
>
>I know it is nearly impossible to forge a bad hash on some data (sha1 is
>~80 bits safe), but a coincidental collision between 2 hashes can occur.
>What is the formula to calculate that ?
Theorem BIRTHDAY PARADOX: Applying a random mapping f : S -> S to
\sqrt{2|S|} values is expected to produce about 1 collision.
Look up the Birthday paradox on the Internet,
(Here one I prepared earlier),
http://burtleburtle.net/bob/hash/birthday.html
- --
B D O Adams
-----BEGIN PGP SIGNATURE-----
Version: PGPsdk version 1.7.1
iQA/AwUBPOA+66CFoYyu/wIOEQJ/QQCgilME2UsNKLeX8VVOHUsA9A3wgyUAn3dG
eEI+HSS9jeifi1nPnVSEfKV/
=Nm58
-----END PGP SIGNATURE-----
_______________________________________________
freenet-tech mailing list
[EMAIL PROTECTED]
http://lists.freenetproject.org/mailman/listinfo/tech
