What Is a Cryptographic Hash Function?

A cryptographic hash function is a deterministic algorithm that maps an input of arbitrary length to a fixed-size output, called a message digest or hash value, while satisfying a set of security properties that make the mapping computationally irreversible and collision-resistant. The output length is fixed regardless of input size: SHA-256, for example, always produces a 256-bit digest whether the input is a single byte or a multi-gigabyte file. This combination of fixed output, one-way computation, and avalanche sensitivity (where a one-bit change in input produces a radically different digest) makes cryptographic hash functions a foundational primitive in information security.

The field draws on number theory, combinatorics, and computational complexity theory. Hash functions are distinct from checksums and cyclic redundancy checks, which detect accidental errors but are not designed to resist adversarial manipulation. A cryptographic hash function must withstand deliberate attempts to find colliding inputs or to reverse-engineer an input from its digest.

Security Properties

The NIST Cryptographic Hash Function project specifies three core security properties that approved hash algorithms must satisfy. Preimage resistance requires that, given a hash value, it is computationally infeasible to find any input that produces it. Second-preimage resistance requires that, given a specific input and its hash, it is computationally infeasible to find a different input with the same hash. Collision resistance requires that it is computationally infeasible to find any two distinct inputs that produce the same hash value. The expected collision-resistance strength of an L-bit hash function is L/2 bits: SHA-256, with a 256-bit output, provides approximately 128-bit collision resistance. This relationship guides algorithm selection when matching a hash function to a required security level.

Standardized Algorithms

The primary standard governing cryptographic hash algorithms in the United States is FIPS 180-4, the Secure Hash Standard, published by NIST. FIPS 180-4 specifies seven algorithms: SHA-1 and the SHA-2 family (SHA-224, SHA-256, SHA-384, SHA-512, SHA-512/224, and SHA-512/256). SHA-1 is now deprecated for most security purposes because practical collision attacks were demonstrated in 2017. SHA-256 and SHA-384 are the workhorses for current applications. FIPS 202, published in 2015, added the SHA-3 family, based on the Keccak permutation and a fundamentally different sponge construction rather than the Merkle-Damgard structure used in SHA-1 and SHA-2. SHA-3's structural difference from SHA-2 provides algorithmic diversity: if a weakness were found in the Merkle-Damgard construction, SHA-3 would remain unaffected.

Role in Security Protocols

Hash functions appear in nearly every layer of modern security infrastructure. Digital signature schemes apply a hash before signing, so that the signature covers a compact digest rather than the full message. HMAC (Hash-based Message Authentication Code), defined in NIST SP 800-107, combines a hash function with a secret key to provide both data integrity and origin authentication. Password storage systems apply iterated hash functions with random salts, making pre-computed dictionary attacks impractical. Blockchains use hash functions to link successive blocks and in proof-of-work puzzles. Certificate transparency logs use Merkle trees, binary tree structures whose nodes store hashes of subtrees, to provide tamper-evident logs of issued X.509 certificates.

Applications

Cryptographic hash functions have applications in a range of fields, including:

• Digital signatures and public key infrastructure (PKI)
• Message authentication codes and data integrity verification
• Password storage and key derivation functions
• Blockchain and distributed ledger transaction linking
• Software distribution integrity verification
• Certificate transparency and audit logging