Update on SHA-1

  • Authors:
  • Vincent Rijmen;Elisabeth Oswald

  • Affiliations:
  • ,IAIK, Graz University of Technology, Graz, Austria;IAIK, Graz University of Technology, Graz, Austria

  • Venue:
  • CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
  • Year:
  • 2005

Quantified Score

Hi-index 0.06

Visualization

Abstract

We report on the experiments we performed in order to assess the security of SHA-1 against the attack by Chabaud and Joux [5]. We present some ideas for optimizations of the attack and some properties of the message expansion routine. Finally, we show that for a reduced version of SHA-1, with 53 rounds instead of 80, it is possible to find collisions in less than 280 operations.