Faster Multicollisions
From MaRDI portal
Publication:5504611
DOI10.1007/978-3-540-89754-5_6zbMath1203.94092OpenAlexW2912883550MaRDI QIDQ5504611
Publication date: 22 January 2009
Published in: Progress in Cryptology - INDOCRYPT 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-89754-5_6
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Advances in cryptology - CRYPTO '89. Proceedings of a conference held at the University of California, Santa Barbara, CA (USA), August 20-24, 1989
- How (Not) to Efficiently Dither Blockcipher-Based Hash Functions?
- Multicollision Attacks on Some Generalized Sequential Hash Functions
- Herding Hash Functions and the Nostradamus Attack
- Domain Extension of Public Random Functions: Beyond the Birthday Barrier
- Breaking the ICE – Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions
- The Complexity of Finding Cycles in Periodic Functions
- Advances in Cryptology – CRYPTO 2004
- Multi-collision Attack on the Compression Functions of MD4 and 3-Pass HAVAL
- Birthday Paradox for Multi-collisions
- Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
- Merkle-Damgård Revisited: How to Construct a Hash Function
- Second Preimage Attacks on Dithered Hash Functions
- Fast Software Encryption
This page was built for publication: Faster Multicollisions
