New ASIC/FPGA Cost Estimates for SHA-1 Collisions
暂无分享,去创建一个
Tim Güneysu | Christof Paar | Anupam Chattopadhyay | Ayesha Khalid | Muhammad Hassan | Christian Rechberger
[1] Xiaoyun Wang,et al. Finding Collisions in the Full SHA-1 , 2005, CRYPTO.
[2] Christophe De Cannière,et al. Finding SHA-1 Characteristics: General Results and Applications , 2006, ASIACRYPT.
[3] Vincent Rijmen,et al. Update on SHA-1 , 2005, CT-RSA.
[4] Marc Stevens. Attacks on Hash Functions and Applications , 2012 .
[5] Florian Mendel,et al. Collisions for 70-Step SHA-1: On the Full Cost of Collision Search , 2007, Selected Areas in Cryptography.
[6] Antoine Joux,et al. Differential Collisions in SHA-0 , 1998, CRYPTO.
[7] Evgeny A. Grechnikov. Collisions for 72-step and 73-step SHA-1: Improvements in the Method of Characteristics , 2010, IACR Cryptol. ePrint Arch..
[8] Tim Güneysu,et al. Cryptanalysis with COPACOBANA , 2008, IEEE Transactions on Computers.
[9] Marc Stevens,et al. New Collision Attacks on SHA-1 Based on Optimal Joint Local-Collision Analysis , 2013, EUROCRYPT.
[10] Akashi Satoh,et al. Hardware Architecture and Cost Estimates for Breaking SHA-1 , 2005, ISC.
[11] Andrew V. Adinetz,et al. Building a Collision for 75-Round Reduced SHA-1 Using GPU Clusters , 2012, Euro-Par.