On the Indifferentiability of the Grøstl Hash Function

DOI10.1007/978-3-642-15317-4_7zbMath1285.94039OpenAlexW1580541130MaRDI QIDQ3588332

Elena Andreeva, Bart Mennink, Bart Preneel

Publication date: 10 September 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15317-4_7

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (10)

Improved indifferentiability security bound for the JH mode ⋮ Indifferentiability security of the fast wide pipe hash: breaking the birthday barrier ⋮ From Indifferentiability to Constructive Cryptography (and Back) ⋮ Full indifferentiable security of the XOR of two or more random permutations using the \(\chi^2\) method ⋮ Towards Understanding the Known-Key Security of Block Ciphers ⋮ Crooked indifferentiability of enveloped XOR revisited ⋮ On the Indifferentiability of Fugue and Luffa ⋮ On the Security of Hash Functions Employing Blockcipher Postprocessing ⋮ Building indifferentiable compression functions from the PGV compression functions ⋮ Compactness of hashing modes and efficiency beyond Merkle tree

This page was built for publication: On the Indifferentiability of the Grøstl Hash Function