Timeline for Will there always be 256 collisions for the output of the MD5 hashsum function for 17-byte inputs?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 2, 2015 at 15:23 | vote | accept | coder543 | ||
| Apr 2, 2015 at 14:51 | comment | added | CodesInChaos | Concerning rainbow tables 1) they're much smaller than all 17 byte inputs. 2) Probably below to 8 bytes or 13 lowercase letters. 3) Even for the target range, they typically only contain most but not all values. | |
| Apr 2, 2015 at 14:25 | answer | added | Gilles 'SO- stop being evil' | timeline score: 5 | |
| Apr 2, 2015 at 14:21 | comment | added | yyyyyyy | Your assumptions seem to be wrong. There are $256$ preimages of length $17$ (bytes) for each hash value on average. Of course, this implies that there are lots of collisions of length $17$, it is just that none have been found so far due to lack of computing power: The cryptanalytic, efficient attacks on MD5 can only be used to obtain full-block collisions. | |
| Apr 2, 2015 at 14:02 | review | First posts | |||
| Apr 2, 2015 at 22:16 | |||||
| Apr 2, 2015 at 14:00 | history | asked | coder543 | CC BY-SA 3.0 |