Building a Collision-Resistant Compression Function from Non-compressing Primitives
From MaRDI portal
Publication:3519539
DOI10.1007/978-3-540-70583-3_52zbMath1155.94387OpenAlexW1553413085MaRDI QIDQ3519539
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
Related Items (15)
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 ⋮ How (Not) to Efficiently Dither Blockcipher-Based Hash Functions? ⋮ Revisiting the indifferentiability of the sum of permutations ⋮ Security of permutation-based compression function {\textsf{lp}}231 ⋮ MJH: a faster alternative to MDC-2 ⋮ Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions ⋮ A New Mode of Operation for Block Ciphers and Length-Preserving MACs ⋮ 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
Uses Software
This page was built for publication: Building a Collision-Resistant Compression Function from Non-compressing Primitives
