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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Now a day's data is transmitted between users through internet in the form of multimedia. The data transmission requires less… 
2015
2015
This paper describes a meet-in-the-middle (MITM) attack against the round reduced versions of the block cipher mCrypton-64/96… 
2012
2012
Hash functions are the most widespread among all cryptographic primitives, and are currently used in multiple cryptographic… 
2012
2012
We extend and improve biclique attacks, which were recently introduced for the cryptanalysis of block ciphers and hash functions… 
2010
2010
We analyze the Grostl hash function, which is a 2nd-round candidate of the SHA-3 competition. Using the start-from-the-middle… 
2008
2008
Many of the popular Merkle-Damgard hash functions have turned out to be not collision-resistant (CR). The problem is that we no… 
2008
2008
Latest news [Dec. 31, 2008] Responses from Verisign (RapidSSL), Microsoft and Mozilla. [Jan. 2, 2009] Responses from TC… 
2007
2007
We show that a 2112.9 collision attack exists against the FORK-256 Hash Function. The attack is surprisingly simple compared to…