Skip to main content

What Is the Difference between a Preimage Attack and a Collision Attack in Hashing?

A preimage attack involves finding the original input (x) that maps to a specific, known hash output (H(x)). It is a reversal of the function.

A collision attack involves finding two different inputs (x and y) that produce the same hash output (H(x) = H(y)). Both attacks compromise the integrity of a hash function but target different security properties.

Collision resistance is often considered a stronger security requirement.

Besides Pre-Image Resistance, What Is Another Crucial Security Property of a Cryptographic Hash Function?
How Is a Second-Preimage Attack Different from a First-Preimage Attack?
How Does the Concept of ‘Hash Collision’ Relate to Blockchain Security?
What Is the Difference between a Preimage Attack and a Second Preimage Attack in Cryptography?