4 ms·
Since hash functions are fixed-length, aren't there always infinitely many collisions and therefore passwords which would work?
by V__ 4y ago
Since hash functions are fixed-length, aren't there always infinitely many collisions and therefore passwords which would work?
- riotman 4y agoUnless it's invertible.
- PeterisP 4y agoHash functions can't be invertible due to pigeonhole principle, as there are more possible inputs than possible outputs for a fixed-size hash.
- omoikane 4y agoIn theory yes, but finding SHA1 collisions is nontrivial. shattered.io has one, but they used up quite a bit of compute to get it.