Advances in Cryptology – CRYPTO 2005

Volume 3621 of the series Lecture Notes in Computer Science pp 17-36

Finding Collisions in the Full SHA-1

  • Xiaoyun WangAffiliated withShandong University
  • , Yiqun Lisa YinAffiliated withIndependent Security Consultant
  • , Hongbo YuAffiliated withShandong University


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 269 hash operations. This is the first attack on the full 80-step SHA-1 with complexity less than the 280 theoretical bound.


Hash functions collision search attacks SHA-1 SHA-0