Combining Compression Functions and Block Cipher-Based Hash Functions

DOI10.1007/11935230_21MaRDI QIDQ5459087zbMATH OpenOpenAlexFDO

Authors Thomas Peyrin, Henri Gilbert, Frédéric Muller, Matthew J. B. Robshaw

Publication date 24 April 2008

Published in Advances in Cryptology – ASIACRYPT 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11935230_21

zbMATH Keywords

block cipherscompression functionshash functions

Mathematics Subject Classification ID

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

Recommendations

• Open problems in hash function security
• On high-rate cryptographic compression functions
• Design principles for dedicated hash functions
• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
• Security Analysis of Constructions Combining FIL Random Oracles

Cited in

(12)

• A Block-Cipher-Based Hash Function Using an MMO-Type Double-Block Compression Function
• Compression Functions Using a Dedicated Blockcipher for Lightweight Hashing
• Cryptanalysis of Grindahl
• Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
• Design principles for dedicated hash functions
• Hash function combiners in TLS and SSL
• Optimal collision security in double block length hashing with single length key
• Hash Functions and RFID Tags: Mind the Gap
• Open problems in hash function security
• Attacks on a double length blockcipher-based hash proposal
• Collision attack on \({\mathtt Grindahl}\)

This page was built for publication: Combining Compression Functions and Block Cipher-Based Hash Functions

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