gen-briefly-explain-a-cryptographic-hash-function-and-one-common-a36d

Briefly explain a cryptographic hash function and one common misconception about it.

# Cryptographic Hash Function A **cryptographic hash function** is a mathematical algorithm that takes any input (like a file or message) and produces a fixed-size string of characters called a hash or digest. It has key properties: - **Deterministic**: Same input always produces the same hash - **One-way**: Computationally infeasible to reverse (can't get original input from hash) - **Collision-resistant**: Extremely difficult to find two different inputs that produce the same hash - **Avalanche effect**: Small input changes drastically alter the output Common examples: SHA-256, MD5, SHA-1 ## Common Misconception **"Hash functions encrypt data"** This is false. Hashing and encryption are fundamentally different: - **Hashing** is *one-way* and irreversible by design—you cannot "decrypt" a hash back to the original data - **Encryption** is *two-way* and reversible—you can decrypt ciphertext back to plaintext with the right key Hashing is used for verification and integrity checks (like password storage), while encryption is used to protect confidential data while keeping it recoverable.