17 search results - page 1 / 4 » Improved Collision Search for SHA-0 |
ASIACRYPT
2006
Springer
13 years 8 months ago
2006
Springer
At CRYPTO2005, Xiaoyun Wang, Hongbo Yu and Yiqun Lisa Yin proposed a collision attack on SHA-0 that could generate a collision with complexity 239 SHA-0 hash operations. Although t...
EUROCRYPT
2005
Springer
13 years 10 months ago
2005
Springer
In this paper we describe improvements to the techniques used to cryptanalyze SHA-0 and introduce the first results on SHA
FSE
2008
Springer
13 years 6 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...
MOC
2000
13 years 4 months ago
2000
The best algorithm known for finding logarithms on an elliptic curve (E) is the (parallelized) Pollard lambda collision search. We show how to apply a Pollard lambda search on a se...
SACRYPT
2007
Springer
13 years 10 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...