Building a Collision-Resistant Compression Function from Non-compressing Primitives

DOI10.1007/978-3-540-70583-3_52MaRDI QIDQ3519539zbMATH OpenOpenAlexFDO

Authors Martijn Stam, Thomas Shrimpton

Publication date 19 August 2008

Published in Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70583-3_52

zbMATH Keywords

collision resistancecompression functionshash functionsrandom oracle model

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
• Collisions Are Not Incidental: A Compression Function Exploiting Discrete Geometry
• On high-rate cryptographic compression functions
• Stam's collision resistance conjecture

Cited in

(23)

• On the impossibility of highly-efficient blockcipher-based hash functions
• Compactness of hashing modes and efficiency beyond Merkle tree
• The security of tandem-DM in the ideal cipher model
• Security of permutation-based compression function {\textsf{lp}}231
• Collisions Are Not Incidental: A Compression Function Exploiting Discrete Geometry
• Stam's conjecture and threshold phenomena in collision resistance
• Towards Understanding the Known-Key Security of Block Ciphers
• Collision spectrum, entropy loss, T-sponges, and cryptanalysis of GLUON-64
• Practical Near-Collisions and Collisions on Round-Reduced ECHO-256 Compression Function
• MJH: a faster alternative to MDC-2
• Parallel Hashing via List Recoverability
• How (Not) to Efficiently Dither Blockcipher-Based Hash Functions?
• Stam's collision resistance conjecture
• Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
• Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
• Salvaging Merkle-Damgård for Practical Applications
• Collisions for the WIDEA-8 compression function
• MJH: a faster alternative to MDC-2
• A New Mode of Operation for Block Ciphers and Length-Preserving MACs
• An analysis of the blockcipher-based hash functions from PGV
• Revisiting the indifferentiability of the sum of permutations
• Lower bound on number of compression calls of a collision-resistance preserving hash
• Open problems in hash function security

Describes a project that uses

Uses Software

• Rumba20

This page was built for publication: Building a Collision-Resistant Compression Function from Non-compressing Primitives

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