3 ms·
It seems like it's easy to find collisions from the hash. https://www.schneier.com/blog/archives/2005/02/sha1_broken.html https://www.schneier.com/blog/archive
by gravypod 10y ago
It seems like it's easy to find collisions from the hash.
https://www.schneier.com/blog/archives/2005/02/sha1_broken.html https://www.schneier.com/blog/archives/2005/02/sha1_broken.h...
- Sami_Lehtinen 10y agoBut in case of passwords, the input masking (limited character set, length etc) makes most of found collisions nonviable? Because can't just freely enter colliding bits for the algorithm.
- heimatau 10y agoYes, here is more info on SHA1 being broken. https://crypto.stackexchange.com/questions/3690/no-sha-1-collision-yet-sha-1-is-broken https://crypto.stackexchange.com/questions/3690/no-sha-1-col...