Efficient Hash Collision Search Strategies on Special-Purpose Hardware
From MaRDI portal
Publication:5504548
DOI10.1007/978-3-540-88353-1_4zbMATH Open1166.94311OpenAlexW2175164727MaRDI QIDQ5504548FDOQ5504548
Authors: Tim Güneysu, Christof Paar, Sven Schäge
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Finding Collisions in the Full SHA-1
- Title not available (Why is that?)
- How to Break MD5 and Other Hash Functions
- Collisions for 70-Step SHA-1: On the Full Cost of Collision Search
- Finding SHA-1 Characteristics: General Results and Applications
- Cryptanalysis of hash functions on the MD4-family.
- Information Security and Privacy
- Advances in Cryptology – CRYPTO 2004
- Multi-block Collisions in Hash Functions Based on 3C and 3C+ Enhancements of the Merkle-Damgård Construction
Cited In (1)
This page was built for publication: Efficient Hash Collision Search Strategies on Special-Purpose Hardware
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504548)