The Grindahl Hash Functions

In this paper we propose the Grindahl hash functions, which are based on components of the Rijndael algorithm. To make collision search sufficiently difficult, this design has the important feature that no low-weight characteristics form collisions, and at the same time it limits access to the state. We propose two concrete hash functions, Grindahl-256 and Grindahl512 with claimed security levels with respect to collision, preimage and second preimage attacks of 2128 and 2256 , respectively. Both proposals have lower memory requirements than other hash functions at comparable speeds and security levels.

• Type: Conference
• Year: 2007
• Where: FSE
• Authors: Lars R. Knudsen, Christian Rechberger, Søren S. Thomsen
• Keywords: Concrete Hash Functions, Cryptography, FSE 2007, Grindahl Hash Functions, Hash Functions