Re: MD5 is 1=>1?

[Roger Bryner <bryner@atlas.chem.utah.edu>]

On Mon, 4 Jul 1994, Derek Atkins wrote:
> is based upon the fact that *finding* two messages that hash to the
> same value is as difficult as a brute-force attack, which requires
> 2^128 trials (maybe it's 2^127, but I don't think that really
This is incorrect, with a large memory, this is the birthday paradox in 
action, and it takes about 2^64 tries, which puts SHS right up there at 
2^80 same as skipjack.

Even with less memory, you can still improve on this though not as much.

Roger, Mad Dog Libertarian, Bryner.