Finding collisions in the full SHA-1

  • Authors:
  • Xiaoyun Wang;Yiqun Lisa Yin;Hongbo Yu

  • Affiliations:
  • Shandong University, Jinan, China;Independent Security Consultant, Greenwich, CT;Shandong University, Jinan, China

  • Venue:
  • CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
  • Year:
  • 2005

Quantified Score

Hi-index 0.06

Visualization

Abstract

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.