Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks
From MaRDI portal
Publication:5458931
DOI10.1007/978-3-540-79263-5_3zbMATH Open1153.94379OpenAlexW1551374506WikidataQ57006288 ScholiaQ57006288MaRDI QIDQ5458931FDOQ5458931
Authors: Praveen Gauravaram, John Kelsey
Publication date: 24 April 2008
Published in: Topics in Cryptology – CT-RSA 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79263-5_3
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multicollision Attacks on Some Generalized Sequential Hash Functions
- Herding Hash Functions and the Nostradamus Attack
- Breaking the ICE – Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions
- Advances in Cryptology – CRYPTO 2004
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- One Way Hash Functions and DES
- Finding Collisions in the Full SHA-1
- How to Break MD5 and Other Hash Functions
- Efficient Collision Search Attacks on SHA-0
- Constructing Secure Hash Functions by Enhancing Merkle-Damgård Construction
- The MD2 Hash Function Is Not One-Way
- An Update on the Side Channel Cryptanalysis of MACs Based on Cryptographic Hash Functions
- Fast Software Encryption
- Multi-block Collisions in Hash Functions Based on 3C and 3C+ Enhancements of the Merkle-Damgård Construction
Cited In (12)
- Cryptanalysis of GOST R hash function
- How to Fill Up Merkle-Damgård Hash Functions
- Cryptanalysis of the GOST Hash Function
- A One-Pass Mode of Operation for Deterministic Message Authentication— Security beyond the Birthday Barrier
- Improved indifferentiability security bound for the JH mode
- Building indifferentiable compression functions from the PGV compression functions
- Security analysis of randomize-hash-then-sign digital signatures
- Increasing the flexibility of the herding attack
- Structural Attacks on Two SHA-3 Candidates: Blender-n and DCH-n
- Некоторые методы анализа функций хэширования и их применение к алгоритму ГОСТ Р 34.11-94
- Provable chosen-target-forced-midfix preimage resistance
- MD2 is not secure without the checksum byte
This page was built for publication: Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458931)