Sciweavers

12 search results - page 1 / 3
» The Impact of Carries on the Complexity of Collision Attacks...
Sort
View
FSE
2006
Springer
89views Cryptology» more  FSE 2006»
13 years 8 months ago
The Impact of Carries on the Complexity of Collision Attacks on SHA-1
In this article we present a detailed analysis of the impact
Florian Mendel, Norbert Pramstaller, Christian Rec...
ASIACRYPT
2006
Springer
13 years 9 months ago
Finding SHA-1 Characteristics: General Results and Applications
The most efficient collision attacks on members of the SHA family presented so far all use complex characteristics which were manually constructed by Wang et al. In this report, we...
Christophe De Cannière, Christian Rechberge...
SACRYPT
2007
Springer
151views Cryptology» more  SACRYPT 2007»
13 years 11 months ago
Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
The diversity of methods for fast collision search in SHA-1 and similar hash functions makes a comparison of them difficult. The literature is at times very vague on this issue, wh...
Christophe De Cannière, Florian Mendel, Chr...
FSE
2007
Springer
192views Cryptology» more  FSE 2007»
13 years 11 months ago
Algebraic Cryptanalysis of 58-Round SHA-1
In 2004, a new attack against SHA-1 has been proposed by a team leaded by Wang [15]. The aim of this article5 is to sophisticate and improve Wang’s attack by using algebraic tech...
Makoto Sugita, Mitsuru Kawazoe, Ludovic Perret, Hi...
ACISP
2007
Springer
13 years 9 months ago
A New Strategy for Finding a Differential Path of SHA-1
In this paper, we propose a new construction algorithm for finding differential paths of Round 1 of SHA-1 for use in the collision search attack. Generally, the differential path o...
Jun Yajima, Yu Sasaki, Yusuke Naito, Terutoshi Iwa...