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

DOI10.1007/s00145-008-9030-1zbMath1210.94099MaRDI QIDQ1027986

M. Cochran, Thomas Shrimpton, John Black

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

provable security; ideal cipher model; blockcipher-based hash functions; collision-resistant hash fuctions; tweakable blockciphers

Mathematics Subject Classification ID

94A60: Cryptography

94A62: Authentication, digital signatures and secret sharing

Related Items

An analysis of the blockcipher-based hash functions from PGV

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Universal classes of hash functions
• Building a Collision-Resistant Compression Function from Non-compressing Primitives
• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
• Communication Theory of Secrecy Systems*
• Cryptanalysis of the Hash Functions MD4 and RIPEMD
• How to Break MD5 and Other Hash Functions
• On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
• On Tweaking Luby-Rackoff Blockciphers
• Efficient Collision Search Attacks on SHA-0
• Finding Collisions in the Full SHA-1
• Bounds on the Efficiency of Generic Cryptographic Constructions
• One Way Hash Functions and DES