liveBook · Manning

Pre-image resistance

Pre-image resistance is the property that it is computationally infeasible to find an input producing a specified hash output.

How 2 Manning books explain it

Real-World Cryptography

Pre-image resistance is the property that, given a hash output, it is computationally infeasible to find an input that hashes to that output.

How it is used
Explains when a published digest can conceal its input and when predictable inputs make guessing practical.
How deep it goes
Defines one-wayness, demonstrates exhaustive guessing, and distinguishes second pre-image and collision resistance without proving internals.
Examples
Uses a blender analogy, yes/no choices, predictable sentences, and tiny two-bit digests to expose weaknesses.
What you can do after
Evaluate whether a hashing use meaningfully hides an input or merely disguises a small, predictable candidate set.

Read how Real-World Cryptography explains pre-image resistance →

Hacking Cryptography

The security property that makes it computationally infeasible to find an input corresponding to a specified hash output.

How it is used
Defines the one-way security goal used to protect password hashes and support trustworthy digest-based verification.
How deep it goes
Defines the attacker’s target and distinguishes it from related properties, but does not develop a concrete inversion algorithm.
Examples
Uses password digests, reverse-looked-up password dictionaries, and fixed-size hash outputs as concrete illustrations.
What you can do after
Evaluate hash security claims by distinguishing reversal of a chosen digest from second-preimage and collision attacks.

Read how Hacking Cryptography explains pre-image resistance →

Related concepts

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.