http://www.justintroutman.org/blog/ wrote: |
I was skimming through the newer papers on IACR's ePrint archive, and noticed a recent contribution which proposes an improved collision attack on MD5, by Sasaki, Naito, Kunihiro, and Ohta, from the University of Electro-Communications, in Japan. Their technique is probabilistic, and works with a probability of 1/2; the complexity is around $2^{30}$. You can find the paper, and abstract, here. |
mjuarez wrote: |
I was just wondering, with all the press getting excited recently over additional MD5 vulnerabilities... why are people still even thinking about it? IMHO, it's like talking about new vulnerabilities being discovered in the original DES algorithm. It hardly matters any more, at least theoretically, as the crypto community has been saying, for quite some time now, that MD5 should not be used anymore (not that they listen, in any case).
Could it be possible that most of the people out there (press included), still have no idea about better hashing algorithms than MD5? |
MattA wrote: |
I'm not sure if this or is not the code you're talking about for finding the collisions, but you might just find it interesting.
http://www.stachliu.com.nyud.net:8090/md5coll.c |
output generated using printer-friendly topic mod, All times are GMT + 2 Hours