Sciweavers

6 search results - page 1 / 2
» Collisions of SHA-0 and Reduced SHA-1
Sort
View
61
Voted
EUROCRYPT
2005
Springer
15 years 3 months ago
Collisions of SHA-0 and Reduced SHA-1
In this paper we describe improvements to the techniques used to cryptanalyze SHA-0 and introduce the first results on SHA
Eli Biham, Rafi Chen, Antoine Joux, Patrick Carrib...
CRYPTO
2008
Springer
95views Cryptology» more  CRYPTO 2008»
14 years 12 months ago
Preimages for Reduced SHA-0 and SHA-1
In this paper, we examine the resistance of the popular hash function SHA-1 and its predecessor SHA-0 against dedicated preimage attacks. In order to assess the security margin of ...
Christophe De Cannière, Christian Rechberge...
60
Voted
CRYPTO
2009
Springer
101views Cryptology» more  CRYPTO 2009»
15 years 4 months ago
Meet-in-the-Middle Preimage Attacks Against Reduced SHA-0 and SHA-1
Kazumaro Aoki, Yu Sasaki
FSE
2008
Springer
162views Cryptology» more  FSE 2008»
14 years 11 months ago
Collisions on SHA-0 in One Hour
At Crypto 2007, Joux and Peyrin showed that the boomerang attack, a classical tool in block cipher cryptanalysis, can also be very useful when analyzing hash functions. They applie...
Stéphane Manuel, Thomas Peyrin
ACISP
2010
Springer
14 years 8 months ago
Second-Preimage Analysis of Reduced SHA-1
Many applications using cryptographic hash functions do not require collision resistance, but some kind of preimage resistance. That's also the reason why the widely used SHA-...
Christian Rechberger