3 ms·
"To search though all possible MD5 values is 2^128 operations which is massive. To be in with a good chance of finding a collision would take ~ 2^64 operations
by callesgg 12y ago
"To search though all possible MD5 values is 2^128 operations which is massive. To be in with a good chance of finding a collision would take ~ 2^64 operations which is again far too big for normal computing."
Seams weird, why so low to find collision compared to full search? or does the author not understand Exponentiation?
- mandalar12 12y agoHe doesn't reference it but he understands exponentiation and the birthday problem [1] that is used to find collisions when you control both files [2]. [1] http://en.wikipedia.org/wiki/Birthday_problem http://en.wikipedia.org/wiki/Birthday_problem [2] http://en.wikipedia.org/wiki/Collision_attack#Classical_collision_attack http://en.wikipedia.org/wiki/Collision_attack#Classical_coll...