This writeup from Eric Rescorla (which he also posted to the NANOG mailing list) is a great summary
of the implications of the recent discoveries of
collisions or weaknesses in the SHA-0 and MD5 cryptographic hash algorithms.
This writeup from Eric Rescorla (which he also posted to the NANOG mailing list) is a great summary
of the implications of the recent discoveries of
collisions or weaknesses in the SHA-0 and MD5 cryptographic hash algorithms.
One response to “SHA-0 and MD5 collision implications”
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?