10 search results - page 1 / 2 » Finding Collisions in the Full SHA-1 |
CRYPTO
2005
Springer
13 years 11 months ago
2005
Springer
In this paper, we present new collision search attacks on the
SACRYPT
2007
Springer
13 years 11 months ago
2007
Springer
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...
ASIACRYPT
2006
Springer
13 years 9 months ago
2006
Springer
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...
ACISP
2007
Springer
13 years 9 months ago
2007
Springer
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...
FSE
2008
Springer
13 years 7 months ago
2008
Springer
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...