On the impossibility of highly-efficient blockcipher-based hash functions

DOI10.1007/S00145-008-9030-1MaRDI QIDQ1027986zbMATH OpenOpenAlexFDO

Authors M. Cochran, John Black, Thomas Shrimpton

Publication date 30 June 2009

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00145-008-9030-1

zbMATH Keywords

ideal cipher modelprovable securityblockcipher-based hash functionscollision-resistant hash fuctionstweakable blockciphers

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
• scientific article; zbMATH DE number 1024070
• The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function
• Merkle-Damgård Revisited: How to Construct a Hash Function
• HCH: A New Tweakable Enciphering Scheme Using the Hash-Counter-Hash Approach
• Getting the Best Out of Existing Hash Functions; or What if We Are Stuck with SHA?
• Faster Luby-Rackoff ciphers
• Looking Back at a New Hash Function
• A Scheme to Base a Hash Function on a Block Cipher
• scientific article; zbMATH DE number 1024002

Cites work

• scientific article; zbMATH DE number 1617919 (Why is no real title available?)
• scientific article; zbMATH DE number 4195165 (Why is no real title available?)
• scientific article; zbMATH DE number 1303133 (Why is no real title available?)
• scientific article; zbMATH DE number 1024070 (Why is no real title available?)
• scientific article; zbMATH DE number 1942411 (Why is no real title available?)
• scientific article; zbMATH DE number 1942429 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• Bounds on the Efficiency of Generic Cryptographic Constructions
• Building a Collision-Resistant Compression Function from Non-compressing Primitives
• Communication Theory of Secrecy Systems*
• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
• Cryptanalysis of the Hash Functions MD4 and RIPEMD
• Efficient Collision Search Attacks on SHA-0
• Finding Collisions in the Full SHA-1
• How to Break MD5 and Other Hash Functions
• On Tweaking Luby-Rackoff Blockciphers
• On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
• One Way Hash Functions and DES
• Universal classes of hash functions

Cited in

(11)

• scientific article; zbMATH DE number 1951621 (Why is no real title available?)
• On the Impossibility of Highly-Efficient 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
• Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls
• A synthetic indifferentiability analysis of some block-cipher-based hash functions
• Overcoming cryptographic impossibility results using blockchains
• The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function
• 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 Q1027986)