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 13, 2017 at 12:48 | history | edited | CommunityBot |
replaced http://crypto.stackexchange.com/ with https://crypto.stackexchange.com/
|
|
| Apr 2, 2015 at 16:27 | comment | added | CodesInChaos | @coder543 The whole bitcoin miner network computes around $2^{80}$ SHA256d hashes per year (burning several hundred million USD on hardware and electricity). While MD5 is a slightly cheaper than that, it'd still take it several trillion years to compute $2^{128}$ MD5 hashes. | |
| Apr 2, 2015 at 15:25 | comment | added | coder543 | I think this answered my question. I guess I had just thought that someone would have found two 17-byte strings that collided by now, even though the input space is very large. | |
| Apr 2, 2015 at 15:23 | vote | accept | coder543 | ||
| Apr 2, 2015 at 14:46 | history | edited | CodesInChaos | CC BY-SA 3.0 |
edited body
|
| Apr 2, 2015 at 14:25 | history | answered | Gilles 'SO- stop being evil' | CC BY-SA 3.0 |