Sciweavers

23 search results - page 2 / 5
» Meet-in-the-Middle Attacks on SHA-3 Candidates
Sort
View
ASIACRYPT
2009
Springer
14 years 22 days ago
Linearization Framework for Collision Attacks: Application to CubeHash and MD6
In this paper, an improved differential cryptanalysis framework for finding collisions in hash functions is provided. Its principle is based on linearization of compression functi...
Eric Brier, Shahram Khazaei, Willi Meier, Thomas P...
FSE
2010
Springer
144views Cryptology» more  FSE 2010»
13 years 11 months ago
Pseudo-cryptanalysis of the Original Blue Midnight Wish
The hash function Blue Midnight Wish (BMW) is a candidate in the SHA-3 competition organised by the U.S. National Institute of Standards and Technology (NIST). BMW was selected fo...
Søren S. Thomsen
INDOCRYPT
2009
Springer
14 years 21 days ago
Second Preimage Attack on SHAMATA-512
We present a second preimage attack on SHAMATA-512, which is a hash function of 512bit output and one of the first round candidates of the SHA-3 competition. The attack uses di...
Kota Ideguchi, Dai Watanabe
SACRYPT
2009
Springer
162views Cryptology» more  SACRYPT 2009»
14 years 21 days ago
Practical Pseudo-collisions for Hash Functions ARIRANG-224/384
Abstract. In this paper we analyse the security of the SHA-3 candidate ARIRANG. We show that bitwise complementation of whole registers turns out to be very useful for constructing...
Jian Guo, Krystian Matusiewicz, Lars R. Knudsen, S...
IPL
2010
107views more  IPL 2010»
13 years 4 months ago
Collisions for variants of the BLAKE hash function
In this paper we present an attack to the BLOKE and BRAKE hash functions, which are weakened versions of the SHA-3 candidate BLAKE. In difference to BLAKE, the BLOKE hash functio...
Janos Vidali, Peter Nose, Enes Pasalic