10 search results - page 2 / 2 » Finding Collisions in the Full SHA-1 |
ASIACRYPT
2007
Springer
14 years 13 days ago
2007
Springer
Recent collision-finding attacks against hash functions such as MD5 and SHA-1 motivate the use of provably collision-resistant (CR) functions in their place. Finding a collision ...
FSE
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. HAVAL is a cryptographic hash function with variable digest size proposed by Zheng, Pieprzyk and Seberry in 1992. It has three variants, 3-, 4-, and 5-pass HAVAL. Previou...
FSE
2008
Springer
13 years 7 months ago
2008
Springer
MD4 is a hash function introduced by Rivest in 1990. It is still used in some contexts, and the most commonly used hash function (MD5, SHA-1, SHA-2) are based on the design princip...
FSE
2008
Springer
13 years 7 months ago
2008
Springer
In this article we find collisions for step-reduced SHA-256. We develop a differential that holds with high probability if the message satisfies certain conditions. We solve the eq...
FSE
2008
Springer
13 years 7 months ago
2008
Springer
In this paper, we point out some weaknesses in the Salsa20 core function that could be exploited to obtain up to 231 collisions for its full (20 rounds) version. We first find an i...