Paper 2005/010 Original: eprint.iacr.org/2005/010 ↗

Update on SHA-1

Vincent Rijmen
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.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Preprint.
History
2005-01-20: last updated
2005-01-20: published
Short URL
https://ia.cr/2005/010
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2005/010,
      author = {Vincent Rijmen and Elisabeth Oswald},
      title = {Update on SHA-1},
      howpublished = {Cryptology {ePrint} Archive, Paper 2005/010},
      year = {2005},
      url = {https://eprint.iacr.org/2005/010}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.