Efficient Hash Collision Search Strategies on Special-Purpose Hardware
From MaRDI portal
Publication:5504548
DOI10.1007/978-3-540-88353-1_4zbMath1166.94311OpenAlexW2175164727MaRDI QIDQ5504548
Sven Schäge, Christof Paar, Tim Güneysu
Publication date: 22 January 2009
Published in: Research in Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-88353-1_4
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Advances in Cryptology – CRYPTO 2004
- Multi-block Collisions in Hash Functions Based on 3C and 3C+ Enhancements of the Merkle-Damgård Construction
- How to Break MD5 and Other Hash Functions
- Finding Collisions in the Full SHA-1
- Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
- Finding SHA-1 Characteristics: General Results and Applications
- Information Security and Privacy
This page was built for publication: Efficient Hash Collision Search Strategies on Special-Purpose Hardware