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

DOI10.1007/s00145-008-9030-1zbMath1210.94099OpenAlexW2075996842MaRDI 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 securityideal cipher modelblockcipher-based hash functionscollision-resistant hash fuctionstweakable blockciphers

Mathematics Subject Classification ID

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

Related Items (2)

An analysis of the blockcipher-based hash functions from PGV ⋮ Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls

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

This page was built for publication: On the impossibility of highly-efficient blockcipher-based hash functions