3 ms·
Note, generally for basic integrity operations it might be OK since there’s no preimage attack, but I’d still be a bit wary myself AFAIK there's still no pract
by userbinator 7y ago
Note, generally for basic integrity operations it might be OK since there’s no preimage attack, but I’d still be a bit wary myself
AFAIK there's still no practical preimage attack for MD5, for which you can generate collisions in seconds on hardware that's a decade old, so it seems making a hash function collision resistant is in general quite a bit harder than making it resistant to preimage attacks.
- nneonneo 7y agoTo some extent that’s just a function of the brute-force search space: due to the birthday paradox a 128-bit hash like MD5 only requires testing around 2^64 hashes to find a collision. However, to find a preimage you would need to search through 2^128 possible messages. Attacks generally improve on brute force by factors; for example, MD5 collision finding is some 2^40 times more efficient than 2^64 brute force, but being 2^40 times more efficient than 2^128 brute force for preimage finding is still well outside of anyone’s capabilities. MD5 also appears to be unusually preimage-resistant; the best attack requires something like 2^123 operations which is really infeasible.