Cryptanalysis of Grindahl

13 years 9 months ago
Cryptanalysis of Grindahl
Due to recent breakthroughs in hash functions cryptanalysis, some new hash schemes have been proposed. GRINDAHL is a novel hash function, designed by Knudsen, Rechberger and Thomsen and published at FSE 2007. It has the particularity that it follows the RIJNDAEL design strategy, with an efficiency comparable to SHA-256. This paper provides the first cryptanalytic work on this new scheme. We show that the 256-bit version of GRINDAHL is not collision resistant. With a work effort of approximatively 2112 hash computations, one can generate a collision. Key words: GRINDAHL, hash functions, RIJNDAEL.
Thomas Peyrin
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Authors Thomas Peyrin
Comments (0)