Hash Functions Based on Three Permutations: A Generic Security Analysis

DOI10.1007/978-3-642-32009-5_20zbMath1296.94132OpenAlexW2526900165MaRDI QIDQ2914268

Bart Preneel, Bart Mennink

Publication date: 25 September 2012

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-32009-5_20

zbMATH Keywords

hash functioncollision resistancepreimage resistancepermutation-based

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (6)

Towards Understanding the Known-Key Security of Block Ciphers ⋮ Open problems in hash function security ⋮ Beyond-birthday secure domain-preserving PRFs from a single permutation ⋮ Optimal collision security in double block length hashing with single length key ⋮ On the XOR of Multiple Random Permutations ⋮ Compactness of hashing modes and efficiency beyond Merkle tree

This page was built for publication: Hash Functions Based on Three Permutations: A Generic Security Analysis