3 ms·
>Md5(password) can yield the same result for many different values of password // Not "many different" using the normal constraints of text/numbers/typographic
by pbhjpbhj 10y ago
>Md5(password) can yield the same result for many different values of password //
Not "many different" using the normal constraints of text/numbers/typographical-marks and with maximum password lengths of 32 or so (I'll bet Yahoo's was shorter than that in 2013).
Are there any MD5 collisions in [:graph:]{,32} ?
- danielweber 10y agoI really doubt it. When people demonstrate MD5 collisions, they use a hex strings like 0e306561559aa787d00bc6f70bbdfe3404cf03659e70 4f8534c00ffb659c4c8740cc942feb2da115a3f4155c bb8607497386656d7d1f34a42059d78f5a8dd1ef
- hawkice 10y agoYes, because MD5 digests are much shorter than 32 characters, even if it's just ascii, so by the pidgeonhole principle there must be. If you're asking if there are _known_ collisions between two messages with less than 32 printable ascii characters -- the answer is likely yes, but there are not known to me and likely not publicly known at all yet.
- pbhjpbhj 10y agoI thought md5 were 32 characters. But you're right every md5 hash would be in that space, so there must be collisions.