Structural Attacks on Two SHA-3 Candidates: Blender-n and DCH-n
From MaRDI portal
Publication:3399201
DOI10.1007/978-3-642-04474-8_6zbMath1307.94068OpenAlexW2168552221MaRDI QIDQ3399201
Mario Lamberger, Florian Mendel
Publication date: 29 September 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-04474-8_6
Cites Work
- Unnamed Item
- Unnamed Item
- Cryptanalysis of the GOST Hash Function
- Analysis of the Hash Function Design Strategy Called SMASH
- Advances in Cryptology – CRYPTO 2004
- How to Break MD5 and Other Hash Functions
- Finding Collisions in the Full SHA-1
- A Failure-Friendly Design Principle for Hash Functions
- On the Indifferentiability of the Sponge Construction
- Second Preimage Attacks on Dithered Hash Functions
- Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks
This page was built for publication: Structural Attacks on Two SHA-3 Candidates: Blender-n and DCH-n
