Terminology Index
Glossary
1801 terms
Showing 737-768 of 1801 terms
Hash Functions
Algorithms that take input of any size and produce a fixed-size, unique-looking output (a hash), designed so the same input always yields the same hash and it is infeasible to reverse or to find two inputs with the same hash.
A cryptographic hash function maps arbitrary data to a fixed-length digest with key properties: deterministic (same input, same output), one-way (you cannot recover the input), and collision-resistant (hard to find two inputs hashing the same). These make hashes ideal for verifying integrity, indexing data, and, with extra protections, storing passwords. Strong hash functions are foundational to digital signatures, integrity checks, and many security mechanisms.
Introduced in: Cryptography Essentials
Examples
- Hashing a file and comparing digests to verify it was not altered.
- Using a hash within a digital signature to detect tampering.
- Relying on collision resistance so two files cannot share a hash.
No related terms linked yet.
