CryptoDB
Update on SHA-1
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2005-12349, title={Update on SHA-1}, booktitle={IACR Eprint archive}, keywords={secret-key cryptography / hash functions}, url={http://eprint.iacr.org/2005/010}, note={previous version published in CT-RSA 2005, LNCS 3376, pp.~58--71 vincent.rijmen@iaik.tugraz.at 12797 received 14 Jan 2005}, author={Vincent Rijmen and Elisabeth Oswald}, year=2005 }