A hash-based signature scheme builds digital signatures from cryptographic hash functions rather than algebraic number-theoretic assumptions. Its security can rely on pre-image resistance, and modern hash functions make the approach naturally resistant to quantum computers. section 14.2
The basic construction grows from one-time signatures:
- A Lamport one-time key pair uses two random secrets for each signable bit and publishes their individual hashes. section 14.2.1
- Signing an n-bit message requires 2n secrets, so naive Lamport signatures are large and require strict one-time-key tracking. section 14.2.1
- Modern designs extend the Lamport foundation to support many more signatures, more practical parameters, and sometimes stateless private keys. section 14.2.1
Why naive one-time signatures become bulky
Signing at most 1,000 messages of 256 bits with a 256-bit hash output would require roughly 16 megabytes for each private and public key. Reusing a one-time key pair must be avoided. section 14.2.1
