Structural Attacks on Two SHA-3 Candidates: Blender-n and DCH-n

DOI10.1007/978-3-642-04474-8_6zbMATH Open1307.94068OpenAlexW2168552221MaRDI QIDQ3399201FDOQ3399201

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

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

zbMATH Keywords

collision attacksSHA-3preimage attacksHash functionsBlenderDCH

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Title not available (Why is that?)
• On the Indifferentiability of the Sponge Construction
• Advances in Cryptology – CRYPTO 2004
• Second Preimage Attacks on Dithered Hash Functions
• Linear-XOR and Additive Checksums Don’t Protect Damgård-Merkle Hashes from Generic Attacks
• A Failure-Friendly Design Principle for Hash Functions
• Finding Collisions in the Full SHA-1
• Title not available (Why is that?)
• How to Break MD5 and Other Hash Functions
• Cryptanalysis of the GOST Hash Function
• Analysis of the Hash Function Design Strategy Called SMASH

Cited In (2)

• Security Analysis and Comparison of the SHA-3 Finalists BLAKE, Grøstl, JH, Keccak, and Skein
• An efficient structural attack on NIST submission DAGS

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)