Differential Collisions in SHA-0
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
The Full Cost of Cryptanalytic Attacks
Journal of Cryptology
Provably good codes for hash function design
SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
Hash functions and the (amplified) boomerang attack
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
Finding SHA-1 characteristics: general results and applications
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Improved collision search for SHA-0
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
The impact of carries on the complexity of collision attacks on SHA-1
FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Efficient collision search attacks on SHA-0
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Finding collisions in the full SHA-1
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Cryptanalysis of the hash functions MD4 and RIPEMD
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
How to break MD5 and other hash functions
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Collisions of SHA-0 and reduced SHA-1
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Exploiting coding theory for collision attacks on SHA-1
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Algebraic cryptanalysis of 58-round SHA-1
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
Collisions on SHA-0 in One Hour
Fast Software Encryption
Collisions for Round-Reduced LAKE
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
Cryptanalysis of the GOST Hash Function
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Preimages for Reduced SHA-0 and SHA-1
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Rebound Distinguishers: Results on the Full Whirlpool Compression Function
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
MD5 Is Weaker Than Weak: Attacks on Concatenated Combiners
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Rebound attack on reduced-round versions of JH
FSE'10 Proceedings of the 17th international conference on Fast software encryption
Second-preimage analysis of reduced SHA-1
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security
Optimal covering codes for finding near-collisions
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
Classification and generation of disturbance vectors for collision attacks against SHA-1
Designs, Codes and Cryptography
Practical attacks on the maelstrom-0 compression function
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Hyper-Sbox view of AES-like permutations: a generalized distinguisher
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Collision attack for the hash function extended MD4
ICICS'11 Proceedings of the 13th international conference on Information and communications security
Second-Order differential collisions for reduced SHA-256
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Building a collision for 75-round reduced SHA-1 using GPU clusters
Euro-Par'12 Proceedings of the 18th international conference on Parallel Processing
The SHA-3 competition: lessons learned
Proceedings of the 6th International Conference on Security of Information and Networks
| Hi-index | 0.00 |
The diversity of methods for fast collision search in SHA-1 and similar hash functions makes a comparison of them difficult. The literature is at times very vague on this issue, which makes comparison even harder. In situations where differences in estimates of attack complexity of a small factor might influence short-term recommendations of standardization bodies, uncertainties and ambiguities in the literature amounting to a similar order of magnitude are unhelpful. We survey different techniques and propose a simple but effective method to facilitate comparison. In a case study, we consider a newly developed attack on 70-step SHA-1, and give complexity estimates and performance measurements of this new and improved collision search method.