🚀 go-pugleaf

-----BEGIN PGP SIGNED MESSAGE-----

In <4akou6$otb@news.voicenet.com>, markm@omni.voicenet.com (Mark M.) writes:
>vawjr08@ibm.net wrote:
>
>: MD5 - damifino... I haven't worked with it, nor read anything about it
>
>The MD in MD5 stands for Message Digest.  There are also MD2 and MD4.  Details
>of these algorithms are in RFC's 1319, 1320, and 1321.  MD5 is more complex
>than CRC or checksuming and its properties are that it should produce fairly
>random output, take 2^64 operations to find a plaintext that hashes to a given
>MD5 hash, and it should take 2^128 operations to find two plaintexts that
>produce the same hash.  

Unless I read "Applied Cryptography" wrong, I think you've got those two numbers
backwards...should be 2^128 to match a specific and 2^64 to find two the same. 
I think I saw the equation 2^(n/2) for the 'birthday problem'

Victor A. Wagner, Jr.                Key fingerprint =  4D 20 EB F6 01 01 B0 69
CFO Metadigm, Inc.                                      38 17 8D BF C8 46 E4 7A
Vice-Chair Orange County (CA) Libertarian Party           http://www.lp.org/lp/
The five most dangerous words in the English language: "There oughtta be a law"

-----BEGIN PGP SIGNATURE-----
Version: 2.6.2

iQB1AwUBMM4rFJO57AuaJdhFAQGSCwMAh5OkpvuWRWm/WjI+B6qNHmDvU1ARZ2Lb
BAY96H1Itwj0w7xpJqpELVKKGdMUagmui1N5MmsM9XBXxDMciBUDMJiYuJMFMgTP
tNmKkgL0p1xF2SUU+DaLHS3cKLsuJRjL
=KFrg
-----END PGP SIGNATURE-----