Timeline for SHA1 collision for first 32 bits for two different messages
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 25, 2017 at 16:11 | comment | added | e-sushi | Re last line: I still catch myself correcting some of my old comments due to that owl… ;) | |
| Feb 25, 2017 at 10:59 | comment | added | Maarten Bodewes♦ | Not for a secure, collision resistant hash, but in this case SHA-1 is not a secure hash. I'm not sure if you would call that "efficient" though. | |
| Feb 25, 2017 at 10:58 | history | edited | Maarten Bodewes♦ | CC BY-SA 3.0 |
added 23 characters in body
|
| Feb 25, 2017 at 3:41 | comment | added | Cole | Is there an efficient way to find a match for the entire hash and not just the first 4 bytes? | |
| Apr 18, 2016 at 23:23 | history | answered | Maarten Bodewes♦ | CC BY-SA 3.0 |