3 ms·
Oh, of course md5 has collisions. It's relatively easy (not computationally easy, but there are known methods) to find two random strings that hash to the same
by jsjohnst 10y ago
Oh, of course md5 has collisions. It's relatively easy (not computationally easy, but there are known methods) to find two random strings that hash to the same value, it's just very difficult to find a string that hashes to the value of a specific other string.
- schoen 10y agoNot "relatively easy" by chance: it should require 2⁶⁴ entries in your database to see a single collision happen at random! It's only "relatively easy" following cryptographic research in the early 2000s that exploits structure in MD5 to produce collisions deliberately. Yes, collisions are easier than preimages, but they still shouldn't occur by chance in real applications!
- jsjohnst 10y agoRealized my wording was way to ambiguous, clarified. Thanks!