Building a Collision-Resistant Compression Function from Non-compressing Primitives
From MaRDI portal
Publication:3519539
DOI10.1007/978-3-540-70583-3_52zbMath1155.94387MaRDI 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
94A60: Cryptography
Related Items
A New Mode of Operation for Block Ciphers and Length-Preserving MACs, MJH: a faster alternative to MDC-2, An analysis of the blockcipher-based hash functions from PGV, Open problems in hash function security, On the impossibility of highly-efficient blockcipher-based hash functions, The security of tandem-DM in the ideal cipher model, Security of permutation-based compression function {\textsf{lp}}231, Towards Understanding the Known-Key Security of Block Ciphers, MJH: A Faster Alternative to MDC-2, Parallel Hashing via List Recoverability, How (Not) to Efficiently Dither Blockcipher-Based Hash Functions?, Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions, Salvaging Merkle-Damgård for Practical Applications
Uses Software