Abstract
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. © International Association for Cryptology Research 2007.
Author supplied keywords
Cite
CITATION STYLE
Peyrin, T. (2007). Cryptanalysis of GRINDAHL. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4833 LNCS, pp. 551–567). Springer Verlag. https://doi.org/10.1007/978-3-540-76900-2_34
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
