Cryptology ePrint Archive: Report 2005/010

Update on SHA-1

Vincent Rijmen and Elisabeth Oswald

Abstract: We report on the experiments we performed in order to assess the security of SHA-1 against the attack by Chabaud and Joux. 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 $2^{80}$ operations.

Category / Keywords: secret-key cryptography / hash functions

Publication Info: previous version published in CT-RSA 2005, LNCS 3376, pp.~58--71

Date: received 14 Jan 2005

Contact author: vincent rijmen at iaik tugraz at

Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Note: This version corrects some errors of the CT-RSA version.

Version: 20050120:191311 (All versions of this report)

Discussion forum: Show discussion | Start new discussion