4 ms·
>have MANY (but not too many) collisions so that it can not be brute-forced in any direction I don't understand this part? Basically if I'm able to find a coll
by thiht 11y ago
>have MANY (but not too many) collisions so that it can not be brute-forced in any direction
I don't understand this part? Basically if I'm able to find a collision it's like I found the real password, so why is a function with many collisions better for password hashing? Is there a way to differentiate the collisions?
EDIT: typo
- iancarroll 11y agoYou don't want collisions, as the entire point of a hashing algorithm is to _not_ have collisions. I'm not sure what the OP is talking about. What you really want for password hashing is a key derivation function, which will generate a random, unique hash slowly.
- z3t4 11y agoLets say someone gains access to the password hashes, he/she can compute hashes until a match is found. And then login to that particular system, but does not know the secret (if there are many collisions, and the pw is random). I'm no expert though, and I assume that if someone gains access to all the password hashes, he/she already has access to the system.