On high-rate cryptographic compression functions

MaRDI QIDQ3435097zbMATH OpenFDO

Authors Richard Ostertág, Martin Stanek

Publication date 4 May 2007

zbMATH Keywords

block cipherscompression functionshash functionsprovable security

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Analysis of Fast Blockcipher-Based Hash Functions
• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
• scientific article; zbMATH DE number 1759316
• Blockcipher-Based Hashing Revisited
• Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions

Cited in

(10)

• Collision spectrum, entropy loss, T-sponges, and cryptanalysis of GLUON-64
• Compression Functions Using a Dedicated Blockcipher for Lightweight Hashing
• Blockcipher-Based Hashing Revisited
• Building a Collision-Resistant Compression Function from Non-compressing Primitives
• Analysis of Fast Blockcipher-Based Hash Functions
• Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
• scientific article; zbMATH DE number 67079 (Why is no real title available?)
• Provable security of the Knudsen-Preneel compression functions
• Combining Compression Functions and Block Cipher-Based Hash Functions

This page was built for publication: On high-rate cryptographic compression functions

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