Definition
The property of a hash function that, given one input, finding a different input 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, given one input, finding a different input 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.
pay 100 to bob7ed79496 46cf54c4 8ed7eb97 5c6fbab8 683de72b a1aafee7 794d395c 4681952a0 / 4
What is second preimage resistance?
Second preimage resistance means that, given a fixed input, you cannot find a different input with the same hash value. It is also called weak collision resistance. Unlike preimage resistance, the attacker knows the original too.
The original is the payment order pay 100 to bob; orange rows are the attacker's forgeries.