Finding Collisions in the Full SHA-1 [chapter]

Xiaoyun Wang, Yiqun Lisa Yin, Hongbo Yu
2005 Lecture Notes in Computer Science  
In this paper, we present new collision search attacks on the hash function SHA-1. We show that collisions of SHA-1 can be found with complexity less than 2 69 hash operations. This is the first attack on the full 80-step SHA-1 with complexity less than the 2 80 theoretical bound.
doi:10.1007/11535218_2 fatcat:fuaxazue35cvbdoumgpsccvili