Annual International Cryptology Conference

CRYPTO 2005: Advances in Cryptology – CRYPTO 2005 pp 17-36

Finding Collisions in the Full SHA-1

  • Xiaoyun Wang
  • Yiqun Lisa Yin
  • Hongbo Yu
Conference paper

DOI: 10.1007/11535218_2

Volume 3621 of the book series Lecture Notes in Computer Science (LNCS)


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 functionscollision search attacksSHA-1SHA-0
Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Xiaoyun Wang
    • 1
  • Yiqun Lisa Yin
    • 2
  • Hongbo Yu
    • 3
  1. 1.Shandong UniversityJinanChina
  2. 2.Independent Security ConsultantGreenwichUS
  3. 3.Shandong UniversityJinanChina