3 ms·
In really simple terms, if either attack is possible, it potentially becomes easier to find the password. If either attack's implementation becomes slightly fa
by peterwwillis 12y ago
In really simple terms, if either attack is possible, it potentially becomes easier to find the password. If either attack's implementation becomes slightly faster at finding the password than a full search of the key space, this makes cracking easier.
Collisions are the most practical method of attack on password hashes. If you develop a way to find collisions faster than an exhaustive search of the key space, you shorten the time it takes to find a password that matches the hash. Collisions have now been found on MD5 very quickly (on the order of hours).
Preimage attacks are not all that useful when password cracking because you don't need to generate a new message that hashes to the same hash you have now, you're looking for any message that hashes to the hash you have now.
Second preimage attacks aren't relevant because they assume you know the password already and are looking for a new message/hash that match.
- tedunangst 12y agoCollisions for arbitrary hashes? If I give you an MD5 hash, you can find a collision within hours?