Cryptanalysis of the Round Hash and Full Compression Function of SHAvite
Florian Mendel3
Cryptanalysis of the 10-Round Hash and Full Compression Function of SHAvite-3-512? Praveen Gauravaram1, Gaeten Leurent2, Florian Mendel3, Marıa Naya-Plasencia4, Thomas Peyrin5, Christian Rechberger6, and Martin Schlaffer3 1 Department of Mathematics, DTU, Denmark 2 ENS, France 3 IAIK, TU Graz, Austria 4 FHNW Windisch, Switzerland 5 Ingenico, France 6 ESAT/COSIC, K.U.Leuven and IBBT, Belgium Abstract. In this paper, we analyze the SHAvite-3-512 hash function, as proposed and tweaked for round 2 of the SHA-3 competition. We present cryptanalytic results on 10 out of 14 rounds of the hash func- tion SHAvite-3-512, and on the full 14 round compression function of SHAvite-3-512. We show a second preimage attack on the hash function reduced to 10 rounds with a complexity of 2497 compression function evaluations and 216 memory. For the full 14-round compression function, we give a chosen counter, chosen salt preimage attack with 2384 compres- sion function evaluations and 2128 memory (or complexity 2448 without memory), and a collision attack with 2192 compression function evalua- tions and 2128 memory. Keywords: hash function, cryptanalysis, collision, (second) preimage 1 Introduction With the advent of new cryptanalysis [6, 20] of the FIPS 180-2 standard hash function SHA-1 [14], NIST has initiated an open hash function competition [15].
- compression function
- bit
- message expansion
- functions based
- round
- collision attack
- nist has initiated
- hash function
- belgian state
- processed using