Re:This has a solution (Score 1)

This is another example of the implementation of the birthday "paradox" to hashes as the so-called "birthday attack".

No it isn't.

This attack is much more efficient than a birthday attack. The MD5 attack used in this paper required around 2^37 computations of MD5, whereas a birthday attack would require around 2^64 computations in addition to some severe space requirements.