Update on SHA-1

You are looking at a specific version 20050120:191311 of this paper. See the latest version.

Paper 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.

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

Metadata

Available format(s): PDF PS
Category: Secret-key cryptography
Publication info: Published elsewhere. previous version published in CT-RSA 2005, LNCS 3376, pp.~58--71
Keywords: hash functions
Contact author(s): vincent rijmen @ iaik tugraz at
History: 2005-01-20: received
Short URL: https://ia.cr/2005/010
License: CC BY