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
Wireless sensor networks (WSNs) consist of sensor nodes. It is a collection of wild number of low cost device constraint sensor… 
2012
2012
In 2010, Tao Xie and Dengguo Feng [XF10] constructed the rst single-block collision for MD5 consisting of two 64-byte messages… 
2010
2010
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
In this note, we present a collision attack on AURORA-512, which is one of the candidates for SHA-3. The attack complexity is… 
2008
2008
Latest news [Dec. 31, 2008] Responses from Verisign (RapidSSL), Microsoft and Mozilla. [Jan. 2, 2009] Responses from TC… 
2007
2007
  • Wenling WuD. Feng
  • 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… 
2006
2006
Camellia is a 128-bit block cipher which has been selected as an international standard by ISO/IEC and a European encryption… 
2005
2005
Camellia is the final winner of 128-bit block cipher in NESSIE. In this paper, we construct some efficient distinguishers between… 
2001
2001
All-or-nothing property is a new encryption mode proposed by Rivest and has the property that one must decrypt the entire…