Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers

DOI10.1007/978-3-540-85174-5_24zbMath1183.94047OpenAlexW1581083284MaRDI QIDQ3600233

John P. Steinberger, Phillip Rogaway

Publication date: 10 February 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-85174-5_24

zbMATH Keywords

cryptographic hash functionscompression functionsideal-cipher modelcollision-resistant hashingblockcipher-based hashing

Mathematics Subject Classification ID

Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (20)

How to build an ideal cipher: the indifferentiability of the Feistel construction ⋮ Parallel Hashing via List Recoverability ⋮ The security of tandem-DM in the ideal cipher model ⋮ An analysis of the blockcipher-based hash functions from PGV ⋮ Towards Understanding the Known-Key Security of Block Ciphers ⋮ Open problems in hash function security ⋮ Sequential indifferentiability of confusion-diffusion networks ⋮ Half-tree: halving the cost of tree expansion in COT and DPF ⋮ Security of permutation-based compression function {\textsf{lp}}231 ⋮ Strengthening the Known-Key Security Notion for Block Ciphers ⋮ MJH: a faster alternative to MDC-2 ⋮ Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions ⋮ Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers ⋮ On the XOR of Multiple Random Permutations ⋮ MJH: A Faster Alternative to MDC-2 ⋮ Salvaging Merkle-Damgård for Practical Applications ⋮ Compactness of hashing modes and efficiency beyond Merkle tree ⋮ On the impossibility of highly-efficient blockcipher-based hash functions ⋮ Preimage resistance of \(\mathsf{LP}mkr\) with \(r=m-1\) ⋮ Hashing Garbled Circuits for Free

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Attacks on fast double block length hash functions
• Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
• Some Plausible Constructions of Double-Block-Length Hash Functions
• Advances in Cryptology – CRYPTO 2004
• On the Impossibility of Highly-Efficient Blockcipher-Based Hash Functions
• Seven-Property-Preserving Iterated Hashing: ROX
• How to Build a Hash Function from Any Collision-Resistant Function
• Cryptography and Coding
• Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms
• The Collision Intractability of MDC-2 in the Ideal-Cipher Model
• Merkle-Damgård Revisited: How to Construct a Hash Function
• A Failure-Friendly Design Principle for Hash Functions
• On the Indifferentiability of the Sponge Construction
• A New Mode of Operation for Block Ciphers and Length-Preserving MACs
• Security/Efficiency Tradeoffs for Permutation-Based Hashing
• Multi-Property-Preserving Hash Domain Extension and the EMD Transform
• Combining Compression Functions and Block Cipher-Based Hash Functions
• One Way Hash Functions and DES

This page was built for publication: Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers