New second preimage attacks on dithered hash functions with low memory complexity

DOI10.1007/978-3-319-69453-5_14zbMath1412.94152OpenAlexW2734917216MaRDI QIDQ1698640

Orr Dunkelman, Stefan Lucks, Muhammad Barham, Marc Stevens

Publication date: 16 February 2018

Full work available at URL: https://ir.cwi.nl/pub/25396

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• New second-preimage attacks on hash functions
• Advances in cryptology - CRYPTO '89. Proceedings of a conference held at the University of California, Santa Barbara, CA (USA), August 20-24, 1989
• Parallel collision search with cryptanalytic applications
• Cycle detection using a stack
• Herding Hash Functions and the Nostradamus Attack
• Breaking the ICE – Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions
• Herding, Second Preimage and Trojan Message Attacks beyond Merkle-Damgård
• Abelian squares are avoidable on 4 letters
• Advances in Cryptology – CRYPTO 2004
• Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
• On the Indifferentiability of the Sponge Construction
• Second Preimage Attacks on Dithered Hash Functions
• One Way Hash Functions and DES

This page was built for publication: New second preimage attacks on dithered hash functions with low memory complexity