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

Recommendations

On the impossibility of highly-efficient blockcipher-based hash functions
Blockcipher-Based Hashing Revisited
On the Security of Hash Functions Employing Blockcipher Postprocessing
The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function
Analysis of Fast Blockcipher-Based Hash Functions
Efficient Tweakable Enciphering Schemes From (Block-Wise) Universal Hash Functions
scientific article; zbMATH DE number 1024070
On the Impossibility of Efficiently Combining Collision Resistant Hash Functions
scientific article; zbMATH DE number 1024071
scientific article; zbMATH DE number 1440070

Cited in

(25)

On related-secret pseudorandomness
Security of permutation-based compression function {\textsf{lp}}231
Cryptanalysis of Tweaked Versions of SMASH and Reparation
Security/Efficiency Tradeoffs for Permutation-Based Hashing
scientific article; zbMATH DE number 1951621 (Why is no real title available?)
Tweakable block ciphers
A New Mode of Operation for Block Ciphers and Length-Preserving MACs
How (Not) to Efficiently Dither Blockcipher-Based Hash Functions?
An analysis of the blockcipher-based hash functions from PGV
Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don’t Exist
Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
On the impossibility of highly-efficient blockcipher-based hash functions
Vortex: A New Family of One-Way Hash Functions Based on AES Rounds and Carry-Less Multiplication
Preimage resistance of \(\mathsf{LP}mkr\) with \(r=m-1\)
Compactness of hashing modes and efficiency beyond Merkle tree
A synthetic indifferentiability analysis of some block-cipher-based hash functions
Open problems in hash function security
Overcoming cryptographic impossibility results using blockchains
MJH: a faster alternative to MDC-2
MJH: a faster alternative to MDC-2
Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
Polye+CTR: a swiss-army-knife mode for block ciphers
On the Security of Hash Functions Employing Blockcipher Postprocessing
On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups
On the effective block size in Harper's theorem

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

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