Skip to content

SHA-0 and MD5 collision implications

This writeup from Eric Rescorla (which he also posted to the NANOG mailing list) is a great summary
of the implications of the href="http://slashdot.org/articles/04/08/17/0030243.shtml?tid=93&tid=162&tid=1&tid=218">recent discoveries of
collisions or weaknesses in the href="http://en.wikipedia.org/wiki/SHA_family">SHA-0 and href="http://en.wikipedia.org/wiki/MD5">MD5 cryptographic hash algorithms.

Comments 1

  1. deviant_ wrote:

    Yeah, but everybody already knew SHA-0 was weak. That’s why there’s SHA-1.

    For that matter, everybody knew you can find collisions in MD5. That’s why we use SHA-1 for important stuff.

    So now, the question is this: Can you find the same collisions in both sets?

    Posted 20 Aug 2004 at 5:13 am