Lesson plan
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. This is in contrast to a preimage attack where a specific target hash value is specified. There are roughly two types of collision attacks: ;Classical collision attack: Find two different messages m 1 and m 2 such that hash(m 1 ) = hash(m 2 ). More generally: ;Chosen-prefix collision attack: Given two different prefixes p 1 and p 2 , find two suffixes s 1 and s 2 such that hash(p 1 ∥ s 1 ) = hash(p 2 ∥ s 2 ), where ∥ denotes the concatenation operation.
Article summary
In cryptography, a collision attack on a cryptographic hash tries to find two inputs producing the same hash value, i.e. a hash collision. This is in contrast to a preimage attack where a specific target hash value is specified. There are roughly two types of collision attacks: ;Classical collision attack: Find two different messages m 1 and m 2 such that hash(m 1 ) = hash(m 2 ). More generally: ;Chosen-prefix collision attack: Given two different prefixes p 1 and p 2 , find two suffixes s 1 and s 2 such that hash(p 1 ∥ s 1 ) = hash(p 2 ∥ s 2 ), where ∥ denotes the concatenation operation.
Key claims
- publication date: 2008 — source: Wikipedia, revision 1314992506, retrieved 2026-10-20 · confidence 0.95
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- The record states that the publication date is "2008". What evidence would count against this claim?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
- Wikipedia, “Collision attack”, revision 1314992506, retrieved 2026-10-20 https://en.wikipedia.org/w/index.php?oldid=1314992506
Key claims and bibliography are generated from the same tracked claims and sources as the article page.