23 search results - page 4 / 5 » Meet-in-the-Middle Attacks on SHA-3 Candidates |
AFRICACRYPT
2011
Springer
13 years 5 days ago
2011
Springer
Abstract. The FSB (fast syndrome-based) hash function was submitted to the SHA-3 competition by Augot, Finiasz, Gaborit, Manuel, and Sendrier in 2008, after preliminary designs pro...
FSE
2011
Springer
13 years 1 days ago
2011
Springer
Hamsi is one of the 14 second-stage candidates in NIST’s SHA-3 competition. The only previous attack on this hash function was a very marginal attack on its 256-bit version publi...
ASIACRYPT
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. In this paper we combine a recent rotational cryptanalysis with the rebound attack, which results in the best cryptanalysis of Skein, a candidate for the SHA-3 competitio...
ASIACRYPT
2009
Springer
14 years 3 months ago
2009
Springer
In this work, we apply the rebound attack to the AES based SHA-3 candidate Lane. The hash function Lane uses a permutation based compression function, consisting of a linear messag...
FSE
2011
Springer
13 years 1 days ago
2011
Springer
In this paper, we present new results on the second-round SHA-3 candidate ECHO. We describe a method to construct a collision in the compression function of ECHO-256 reduced to fou...