preimage resistance
The property of a hash function that, given only a digest, makes it infeasible to find any input that produces that digest.
In more detail
It is what makes hashing one-way. A related property, second-preimage resistance, means that given one input you cannot find a different input with the same digest. Preimage resistance does not protect guessable inputs such as passwords: an attacker simply hashes likely guesses and compares, which is why passwords need salts and slow hash functions.
Example
Preimage resistance: no working back from a digestRelated terms
- collision resistance — The property of a hash function that makes it infeasible to find any two different inputs that produce the same digest.
- hash — A short fixed-length fingerprint calculated from data, which changes completely if even one byte of the data changes.
- password hashing — Storing a password as the output of a deliberately slow, salted hash function, so a stolen database does not reveal the passwords.
- salt — An extra value mixed into data before hashing so that otherwise identical inputs produce different hashes.
Taught in
- Cryptographic Hashing: SHA-256, SHA-3 & Passwords — Cybersecurity Fundamentals, GRC & Cryptography