Finding Collisions in the Full SHA-1

  • Xiaoyun Wang
  • Yiqun Lisa Yin
  • Hongbo Yu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3621)


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 

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

Personalised recommendations