Structural Attacks on Two SHA-3 Candidates: Blender-n and DCH-n
From MaRDI portal
Publication:3399201
Recommendations
- The State of Hash Functions and the NIST SHA-3 Competition
- Cryptanalysis of the 10-Round Hash and Full Compression Function of SHAvite-3-512
- Cryptanalysis of dynamic SHA(2)
- Near-collisions on the reduced-round compression functions of Skein and BLAKE
- The first 30 years of cryptographic hash functions and the NIST SHA-3 competition
Cites work
- scientific article; zbMATH DE number 4195165 (Why is no real title available?)
- scientific article; zbMATH DE number 1024070 (Why is no real title available?)
- A Failure-Friendly Design Principle for Hash Functions
- Advances in Cryptology – CRYPTO 2004
- Analysis of the Hash Function Design Strategy Called SMASH
- Cryptanalysis of the GOST Hash Function
- Finding Collisions in the Full SHA-1
- How to Break MD5 and Other Hash Functions
- Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks
- On the Indifferentiability of the Sponge Construction
- Second Preimage Attacks on Dithered Hash Functions
Cited in
(5)- Near-collisions on the reduced-round compression functions of Skein and BLAKE
- Extracts from the SHA-3 competition
- An efficient structural attack on NIST submission DAGS
- Security Analysis and Comparison of the SHA-3 Finalists BLAKE, Grøstl, JH, Keccak, and Skein
- Collisions for variants of the BLAKE hash function
This page was built for publication: Structural Attacks on Two SHA-3 Candidates: Blender-n and DCH-n
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3399201)
