Hash functions based on three permutations: a generic security analysis

DOI10.1007/978-3-642-32009-5_20MaRDI QIDQ2914268zbMATH OpenOpenAlexFDO

Authors Bart Mennink, Bart Preneel

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

collision resistancehash functionpermutation-basedpreimage resistance

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Two-permutation-based hashing with binary mixing
• Security/Efficiency Tradeoffs for Permutation-Based Hashing
• Security of permutation-based compression function {\textsf{lp}}231
• Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers

Cited in

(12)

• Compactness of hashing modes and efficiency beyond Merkle tree
• Beyond-birthday secure domain-preserving PRFs from a single permutation
• Security of permutation-based compression function {\textsf{lp}}231
• On the XOR of multiple random permutations
• Towards Understanding the Known-Key Security of Block Ciphers
• Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
• Cryptanalysis of Tweaked Versions of SMASH and Reparation
• Optimal collision security in double block length hashing with single length key
• Security/Efficiency Tradeoffs for Permutation-Based Hashing
• Two-permutation-based hashing with binary mixing
• Preimage resistance of \(\mathsf{LP}mkr\) with \(r=m-1\)
• Open problems in hash function security

This page was built for publication: Hash functions based on three permutations: a generic security analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2914268)