Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate
From MaRDI portal
Publication:3183556
DOI10.1007/978-3-642-03356-8_4zbMath1252.94098OpenAlexW2146923862MaRDI QIDQ3183556
Benne de Weger, Jacob Appelbaum, Dag Arne Osvik, David Molnar, Arjen K. Lenstra, Marc Stevens, Alexander Sotirov
Publication date: 20 October 2009
Published in: Advances in Cryptology - CRYPTO 2009 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-03356-8_4
Related Items (16)
Collapseability of Tree Hashes ⋮ Practical cryptanalysis of ISO 9796-2 and EMV signatures ⋮ Practical Free-Start Collision Attacks on 76-step SHA-1 ⋮ Cryptanalysis of full \texttt{RIPEMD-128} ⋮ Malleability and ownership of proxy signatures: towards a stronger definition and its limitations ⋮ Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions ⋮ Security analysis of randomize-hash-then-sign digital signatures ⋮ Analysis of RIPEMD-160: new collision attacks and finding characteristics with MILP ⋮ Improved collision detection of MD5 with additional sufficient conditions ⋮ Concurrent signature without random oracles ⋮ Collisions of MMO-MD5 and Their Impact on Original MD5 ⋮ Efficient cache attacks on AES, and countermeasures ⋮ Robust multi-property combiners for hash functions ⋮ On Randomizing Hash Functions to Strengthen the Security of Digital Signatures ⋮ Fast Elliptic-Curve Cryptography on the Cell Broadband Engine ⋮ Memory-Efficient Algorithms for Finding Needles in Haystacks
This page was built for publication: Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate
