Sciweavers

Share
CTRSA
2005
Springer

Update on SHA-1

12 years 7 months ago
Update on SHA-1
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.
Vincent Rijmen, Elisabeth Oswald
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where CTRSA
Authors Vincent Rijmen, Elisabeth Oswald
Comments (0)
books