How deeply does Software Security for Developers cover collision-resistant hash function?

Defines collision resistance and contrasts it with one-wayness, but defers the mathematics of hash-function design and assessment.

Collision-resistant hash function

As explained in Software Security for Developers

Collision resistance is the computational infeasibility of finding two distinct inputs that produce the same cryptographic hash value.

A collision-resistant hash function makes it computationally infeasible to find two different inputs that produce the same hash value. Hashes accept inputs of any size and return fixed-size outputs, so collision resistance is a security property rather than a guarantee that collisions are mathematically impossible. section 4.2.1

Different inputs, different SHA-256 values

SHA-256 produces different example outputs for lowercase “a,” uppercase “A,” and a 2.6 GB Ubuntu ISO. The values are fixed at 256 bits even though the inputs have very different sizes. section 4.2.1

Do not design or implement a cryptographic hash function yourself. Use standardized, peer-reviewed functions from a standard library and approved by the relevant information-security team. section 4.2.1

How Software Security for Developers covers it

Cover of Software Security for Developers

liveBook manning.com

Read Software Security for Developers on liveBook Get the book at manning.com

Also explained in

liveBook manning.com

Real-World CryptographyCollision resistance is the property that it is computationally infeasible to find two distinct inputs that produce the same hash output.
liveBook manning.com

Hacking CryptographyThe property that it is computationally infeasible to find any two distinct inputs that produce the same hash output.

Compare how 3 books explain collision-resistant hash function →

Related concepts

hash functionproduced by · A hash function deterministically maps input data to a value in a bounded output range, commonly for indexing, lookup, comparison, or integrity checking.
security propertykind of · A security property is a security-relevant characteristic that a cryptographic primitive or protocol is intended to provide.
capacityconfigured by · In a sponge construction, capacity is the portion of the internal state not directly exposed to input or output and determining security strength.
hash-based signature schemecontrasts with · A hash-based signature scheme is a digital signature scheme whose security is based on cryptographic hash-function properties rather than algebraic number-theoretic assumptions.
cryptographic hashpart of · A cryptographic hash is a fixed-length digest computed from input data by a deterministic function designed to resist preimage, second-preimage, and collision attacks.

This explainer was generated by Manning's knowledge graph from the text of Software Security for Developers. The section links point to the parts of the book it draws on.