The Grindahl Hash Functions

DOI10.1007/978-3-540-74619-5_3zbMath1186.94456OpenAlexW1513957952MaRDI QIDQ3524880

Christian Rechberger, Søren S. Thomsen, Lars R. Knudsen

Publication date: 16 September 2008

Published in: Fast Software Encryption (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74619-5_3

zbMATH Keywords

hash functionsAESRijndaeldesign strategyproposal

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Theory of software (68N99)

Related Items (14)

Duplexing the Sponge: Single-Pass Authenticated Encryption and Other Applications ⋮ Open problems in hash function security ⋮ Cryptanalysis of Grindahl ⋮ Triangulating rebound attack on AES-like hashing ⋮ Tight preimage resistance of the sponge construction ⋮ How (Not) to Efficiently Dither Blockcipher-Based Hash Functions? ⋮ Security of truncated permutation without initial value ⋮ Collision attack on \({\mathtt Grindahl}\) ⋮ The Hash Function Family LAKE ⋮ Improved Impossible Differential Attacks on Large-Block Rijndael ⋮ Slide Attacks on a Class of Hash Functions ⋮ Speeding up Collision Search for Byte-Oriented Hash Functions ⋮ Automatic search of meet-in-the-middle preimage attacks on AES-like hashing ⋮ Two Attacks on RadioGatún

This page was built for publication: The Grindahl Hash Functions