Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate
暂无分享,去创建一个
Marc Stevens | Arjen K. Lenstra | David Molnar | Benne de Weger | Dag Arne Osvik | Jacob Appelbaum | Alexander Sotirov | D. Molnar | Jacob Appelbaum | A. Sotirov | M.M.J. Stevens | B. Weger | A. Lenstra
[1] Arjen K. Lenstra,et al. Predicting the winner of the 2008 US Presidential Elections using a Sony PlayStation 3 , 2007 .
[2] Vlastimil Klíma,et al. Finding MD5 Collisions on a Notebook PC Using Multi-message Modifications , 2005, IACR Cryptol. ePrint Arch..
[3] Tao Xie,et al. Could The 1-MSB Input Difference Be The Fastest Collision Attack For MD5 ? , 2008, IACR Cryptol. ePrint Arch..
[4] Marc Stevens,et al. On Collisions for MD5 , 2007 .
[5] Hans Dobbertin. Cryptanalysis of MD4 , 1996, FSE.
[6] Xiaoyun Wang,et al. Finding Collisions in the Full SHA-1 , 2005, CRYPTO.
[7] Vlastimil Klíma,et al. Tunnels in Hash Functions: MD5 Collisions Within a Minute , 2006, IACR Cryptol. ePrint Arch..
[8] Xiaoyun Wang,et al. Efficient Collision Search Attacks on SHA-0 , 2005, CRYPTO.
[9] Hans Dobbertin. Cryptanalysis of MD5 Compress , 1996 .
[10] Vincent Rijmen,et al. Update on SHA-1 , 2005, CT-RSA.
[11] Marc Stevens,et al. Fast Collision Attack on MD5 , 2006, IACR Cryptol. ePrint Arch..
[12] Xiaoyun Wang,et al. How to Break MD5 and Other Hash Functions , 2005, EUROCRYPT.
[13] Antoon Bosselaers,et al. Collisions for the Compressin Function of MD5 , 1994, EUROCRYPT.
[14] Dengguo Feng,et al. Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD , 2004, IACR Cryptol. ePrint Arch..
[15] Marc Stevens,et al. Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities , 2007, EUROCRYPT.
[16] Hugo Krawczyk,et al. Strengthening Digital Signatures Via Randomized Hashing , 2006, CRYPTO.