On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions

DOI10.1007/11426639_31zbMath1137.94339OpenAlexW1525090271MaRDI QIDQ5385749

M. Cochran, Thomas Shrimpton, John Black

Publication date: 6 May 2008

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

Full work available at URL: https://doi.org/10.1007/11426639_31

zbMATH Keywords

provable securitytweakable blockciphersCollision-resistant hash functions

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (18)

An analysis of the blockcipher-based hash functions from PGV ⋮ Open problems in hash function security ⋮ How (Not) to Efficiently Dither Blockcipher-Based Hash Functions? ⋮ Tweakable block ciphers ⋮ Security of permutation-based compression function {\textsf{lp}}231 ⋮ Vortex: A New Family of One-Way Hash Functions Based on AES Rounds and Carry-Less Multiplication ⋮ MJH: a faster alternative to MDC-2 ⋮ Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions ⋮ Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers ⋮ A New Mode of Operation for Block Ciphers and Length-Preserving MACs ⋮ Security/Efficiency Tradeoffs for Permutation-Based Hashing ⋮ MJH: A Faster Alternative to MDC-2 ⋮ Compactness of hashing modes and efficiency beyond Merkle tree ⋮ PolyE+CTR: A Swiss-Army-Knife Mode for Block Ciphers ⋮ Cryptanalysis of Tweaked Versions of SMASH and Reparation ⋮ On the impossibility of highly-efficient blockcipher-based hash functions ⋮ Preimage resistance of \(\mathsf{LP}mkr\) with \(r=m-1\) ⋮ On Related-Secret Pseudorandomness

This page was built for publication: On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions