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 ? Maarten _______________________________________________ freenet-tech mailing list [EMAIL PROTECTED] http://lists.freenetproject.org/mailman/listinfo/tech
