New second preimage attacks on dithered hash functions with low memory complexity
From MaRDI portal
Publication:1698640
DOI10.1007/978-3-319-69453-5_14zbMATH Open1412.94152OpenAlexW2734917216MaRDI QIDQ1698640FDOQ1698640
Authors: Muhammad Barham, Orr Dunkelman, Stefan Lucks, Marc Stevens 
Publication date: 16 February 2018
Full work available at URL: https://ir.cwi.nl/pub/25396
Recommendations
Cites Work
- Title not available (Why is that?)
- On the Indifferentiability of the Sponge Construction
- 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
- Second Preimage Attacks on Dithered Hash Functions
- Parallel collision search with cryptanalytic applications
- Title not available (Why is that?)
- One Way Hash Functions and DES
- Abelian squares are avoidable on 4 letters
- New second-preimage attacks on hash functions
- Herding, second preimage and Trojan message attacks beyond Merkle-Damgård
- Cycle detection using a stack
- Advances in cryptology - CRYPTO '89. Proceedings of a conference held at the University of California, Santa Barbara, CA (USA), August 20-24, 1989
Cited In (5)
- A second pre-image attack and a collision attack to cryptographic hash function lux
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- Second Preimage Attacks on Dithered Hash Functions
- New second-preimage attacks on hash functions
- New Second Preimage Attack Variants against the MD-Structure
This page was built for publication: New second preimage attacks on dithered hash functions with low memory complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1698640)
