Differential Path for SHA-1 with complexity O(2^52)

Differential Path for SHA-1 with complexity O(2^52)

Abstract: Although SHA-1 has been theoretically broken for some time
now, the task of finding a practical collision is yet to be completed. Using
some new approaches to differential analysis, we were able to find a new
differential path which can be used in a collision attack with complexity
of O(2^52). This is currently the lowest complexity attack on SHA-1.

Attack Strategies: Differential Path, Boomerang Attack

http://eprint.iacr.org/2009/259.pdf

A truly intersting paper on new attack strategies against SHA-1 Hash Algorithm

Regards,
Giuseppe 'Evilcry' Bonfa'