Secure Hashing Algorithms (SHA): overview, families, uses and security

Core properties and intended security

Cryptographic hashes aim to provide three basic resistance properties: preimage resistance (difficult to find an input matching a given digest), second‑preimage resistance (difficult to find a different input with the same digest), and collision resistance (difficult to find any two distinct inputs with the same digest). In practice these properties guide algorithm choice and keying methods. Implementations also consider speed, memory use, and side‑channel resistance.

Major SHA families

• SHA‑0 — an early version that was withdrawn shortly after publication and is of historical interest.
• SHA‑1 — produced 160‑bit digests and was widely used for many years; practical collision attacks led to its deprecation for most security purposes.
• SHA‑2 — a family including SHA‑224, SHA‑256, SHA‑384 and SHA‑512 (and truncated variants). These produce larger digests and remain broadly recommended for integrity and signature schemes.
• SHA‑3 — standardized later and based on the Keccak sponge construction; it complements SHA‑2 and offers different internal structure and algorithmic diversity.

History and standardization

The SHA family evolved through successive standards to address emerging attack methods and performance requirements. SHA‑1 was widely adopted but later found vulnerable to collision attacks, prompting migration to SHA‑2. SHA‑3 resulted from a public competition and provides an alternative design principle (sponge construction) to the Merkle–Damgård‑style designs used by earlier members. For formal specifications and standards refer to official publications and FIPS documentation: standards and references.

Common uses and examples

SHA algorithms are used where a fixed, reproducible fingerprint of data is needed: digital signatures, code and document signing, certificate chains, message authentication codes (HMAC), integrity checks, and components of network protocols such as TLS. They appear in password‑related systems (usually combined with salts and slow key‑derivation functions), and in blockchain applications where SHA‑256 is commonly used in block hashing and proof‑of‑work constructions.

Practical guidance and notable facts

Because cryptographic strength changes over time, current guidance recommends avoiding SHA‑1 for collision‑resistant needs and using SHA‑2 or SHA‑3 families instead. When hashing passwords or deriving keys, combine a secure hash with salting and a slow, configurable function (e.g., PBKDF2, bcrypt, scrypt, Argon2). SHA‑3 offers algorithmic diversity and may reduce systemic risk if vulnerabilities are found in SHA‑2 designs. For further reading and implementation resources see representations and additional materials at conceptual overviews.