Linked from

The 29 pages that link to Cryptographic hash function, each with the reason it gives.

• Modular arithmeticRelated: Simple hash schemes often reduce sums or polynomial values modulo a fixed number.

• FunctionBroader topic: It applies the function idea to indexing, integrity checks, and cryptography.

• CryptographyRelated: Hashes support integrity checks, digital signatures, and password storage.

• Error-correcting codeCompared with: A hash can expose tampering but cannot reconstruct corrupted input.

• Digital forensicsRelated: Matching hashes can show that an acquired image remained unchanged.

• Fermat's little theoremRelated: Modular exponentiation informed by Fermat's theorem appears in some number-theoretic hash constructions.

• Public-key cryptographyRelated: Signature schemes commonly sign message digests rather than entire messages.

• CryptanalysisRelated: Cryptanalysis also tests whether hash functions permit collisions or preimage recovery.

• Injective functionCompared with: Finite hash ranges make collisions inevitable for sufficiently large input spaces.

• Digital signatureRelated: Many signature schemes sign a message’s digest rather than its full contents.

• EncryptionCompared with: Unlike encryption, hashing is not designed to recover the original data with a key.

• Transport Layer SecurityRelated: Hashes support transcript verification and key derivation in TLS.

• BitcoinRelated: Hashes link blocks and support the proof-of-work puzzle.

• Birthday ProblemRelated: Hash outputs behave like birthday values when estimating accidental collisions.

• Deterministic algorithmRelated: The same message must produce the same digest for integrity checks to work.

• Post-quantum cryptographyRelated: Hash security assumptions also support post-quantum signatures and authentication.

• Exclusive orRelated: Many hash constructions combine bits with exclusive or, though the connective alone provides no security.

• Hash tableCompared with: Hash tables need distribution and speed, not the security guarantees cryptographic hashes target.

• RemainderRelated: Remainder operations can map integers into a fixed-size table, though poor choices cause clustering.

• BlockchainRelated: Each block’s hash links it to earlier data, so changes disrupt the chain.

• Discrete logarithmCompared with: Hash-based cryptography offers alternatives whose security need not depend on discrete logarithms.

• HexadecimalRelated: Digest bytes are usually displayed as hexadecimal strings.

• Proof of workBroader topic: Mining repeatedly hashes candidate block data until an output meets the target.

• Public key infrastructureRelated: Digital signatures commonly use hashes to represent certificate contents efficiently.

• Brute-force attackRelated: Attackers can test guesses against stored password hashes without submitting them to a login service.

• Symmetric-key algorithmCompared with: A hash does not decrypt data or replace a keyed symmetric cipher.

• Associative arrayBroader topic: It maps associative-array keys to candidate storage locations in hash-table implementations.

• Set (abstract data type)Related: Hash-based sets use these outputs to find possible matches efficiently.

• Bram CohenRelated: Hashing helps identify pieces of BitTorrent files and underpins Chia’s proof-of-space mechanism.