Cryptanalysis of Grindahl Export

@incollection{citeulike:2894513, 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.}, author = {Peyrin, Thomas}, citeulike-article-id = {2894513}, citeulike-linkout-0 = {http://dx.doi.org/10.1007/978-3-540-76900-2_34}, citeulike-linkout-1 = {http://www.springerlink.com/content/k1w2365221567xg6}, doi = {10.1007/978-3-540-76900-2_34}, journal = {Advances in Cryptology – ASIACRYPT 2007}, pages = {551--567}, posted-at = {2008-11-07 23:34:22}, priority = {2}, title = {Cryptanalysis of Grindahl}, url = {http://dx.doi.org/10.1007/978-3-540-76900-2_34}, year = {2007} }

TY - CHAP ID - citeulike:2894513 L3 - citeulike-article-id:2894513 N2 - 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. JF - Advances in Cryptology – ASIACRYPT 2007 EP - 567 TI - Cryptanalysis of Grindahl SP - 551 AU - Peyrin, Thomas PY - 2007/// UR - http://dx.doi.org/10.1007/978-3-540-76900-2_34 ER -