Definition
The property of a hash function that finding two different inputs with the same hash value is computationally infeasible
Visual IT Encyclopedia › Information Security › Cryptography
Visual IT Encyclopedia › Information Security › Cryptography
Definition
The property of a hash function that finding two different inputs with the same hash value is computationally infeasible
The example hash function is SHA-256. Any input gives a 256-bit hash value, which is 64 hexadecimal digits.
vote yes298bab39 2d28f771 a307e3a0 17dd03ff 96620849 876213d1 781244f1 9ec96d6dvote nob3afc70f 3eb12ed9 8cd02e61 7680599b 9c1f44d7 afbe244c 56540308 b9e67b0a0 / 4
What is collision resistance?
Collision resistance means you cannot find two different inputs with the same hash value, a collision. It is also called strong collision resistance. Unlike a second preimage, the attacker picks both inputs, which makes the attack easier and the property harder to keep.
Orange rows are inputs the attacker picked. Below them, the number of compared pairs is counted.