Skip to search formSkip to main contentSkip to account menu

Collision attack

Known as: Chosen prefix collision attack, Chosen prefix collision, Prefix collision attack 
In cryptography, a collision attack on a cryptographic hash tries to find two inputs producing the same hash value, i.e. a hash collision. In… 
Wikipedia (opens in a new tab)

Related topics

Related topics

41 relations
Birthday attackCertificate authorityCode signingCollision (computer science)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
A review of collisions in cryptographic hash function used in digital forensic tools
Highly Cited
2017
Highly Cited
2017
Time efficient secure DNA based access control model for cloud computing environment
2016
2016
Robustness and security enhancement of SHA with modified message digest and larger bit difference
Now a day's data is transmitted between users through internet in the form of multimedia. The data transmission requires less… 
2015
2015
A Meet-in-the-Middle Attack on Round-Reduced mCrypton Using the Differential Enumeration Technique
This paper describes a meet-in-the-middle (MITM) attack against the round reduced versions of the block cipher mCrypton-64/96… 
2012
2012
A novel secure hash algorithm for public key digital signature schemes
Hash functions are the most widespread among all cryptographic primitives, and are currently used in multiple cryptographic… 
2010
2010
Improved Collision Attacks on the Reduced-Round Grøstl Hash Function
We analyze the Grostl hash function, which is a 2nd-round candidate of the SHA-3 competition. Using the start-from-the-middle… 
2010
2010
Practical Near-Collisions for Reduced Round Blake, Fugue, Hamsi and JH | NIST
A hash function is near-collision resistant, if it is hard to find two messages with hash values that differ in only a small… 
2009
2009
Improvement and security analysis on MD5: Improvement and security analysis on MD5
2008
2008
How to Fill Up Merkle-Damgård Hash Functions
Many of the popular Merkle-Damgard hash functions have turned out to be not collision-resistant (CR). The problem is that we no… 
2007
2007
Collision attack on reduced-round Camellia
  • Wenling WuD. Feng
  • Science in China Series F: Information Sciences
  • 2007
  • Corpus ID: 1747697
Camellia is the final winner of 128-bit block cipher in NESSIE. In this paper, we construct some efficient distinguishers between… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)