Two lessons in, you have met the workhorse algorithms: ML-KEM for key exchange and ML-DSA for digital signatures. This lesson covers the third finalized standard: SLH-DSA (FIPS 205). It exists for a specific reason, it plays a specific role, and understanding it is what separates a surface-level understanding of PQC from a genuine one.
Unit 1 progress
By the end of this lesson you will be able to
Explain what makes SLH-DSA "conservative" and why that matters as a security property
Distinguish between lattice-based and hash-based cryptographic foundations
Identify the specific use cases where SLH-DSA is preferred over ML-DSA
Explain the trade-off between SLH-DSA's conservative security and its performance characteristics
Part 1 — Why a third signature standard?
After ML-KEM and ML-DSA, a reasonable question is: why does NIST need a third standard? ML-DSA already handles digital signatures. The answer is about security diversity and risk management, two principles that run through the entire PQC migration strategy.
ML-KEM and ML-DSA both rely on the Module Learning With Errors (M-LWE) problem, a lattice-based mathematical structure. This is a well-studied problem and the community's confidence in its quantum resistance is high. But it is still a relatively young cryptographic foundation compared to hash functions. Hash functions have been the bedrock of cryptography for decades. SHA-2, SHA-3, and their predecessors have been analyzed exhaustively by thousands of researchers. Their security properties are as well-understood as anything in cryptography.
SLH-DSA's security depends entirely on the properties of hash functions, with no additional number-theoretic assumptions. If a breakthrough attack were ever discovered against lattice-based cryptography, a scenario considered unlikely but not impossible, SLH-DSA would remain secure. It is the cryptographic equivalent of a second deadbolt on a door that already has a high-tech lock.
Glossary terms reinforced
Hash-based cryptography vs Lattice-based cryptography
Hash-based (SLH-DSA): Security rests on the one-way nature of cryptographic hash functions. The most conservative, longest-analyzed foundation available. Produces larger, slower signatures. Best for high-assurance, long-lived use cases.
Lattice-based (ML-KEM, ML-DSA): Security rests on the hardness of Module-LWE problems. Well-studied and believed quantum-resistant, but newer as a cryptographic foundation. Better performance in most deployment contexts.
Part 2 — Trade-offs: SLH-DSA vs ML-DSA
The choice between SLH-DSA and ML-DSA is not about which is more secure in an absolute sense, both are believed to be quantum-resistant. It is about which security foundation you prefer and what performance trade-offs are acceptable for your use case.
Property
SLH-DSA (FIPS 205)
ML-DSA (FIPS 204)
ECDSA P-256 (retiring)
Security basis
Hash functions only — most conservative
Module-LWE lattice problems
Discrete log — broken by Shor's
Signature size
7,856 – 49,856 bytes (parameter-dependent)
2,420 – 4,627 bytes
~64 bytes
Signing speed
Slow (milliseconds to seconds for some parameter sets)
The large signature sizes are the main practical constraint of SLH-DSA. The smallest parameter set (SLH-DSA-SHA2-128s) produces 7,856-byte signatures. The largest (SLH-DSA-SHAKE-256f) produces 49,856 bytes. For comparison, the entire content of the US Constitution is around 45,000 bytes. A root CA certificate signed with SLH-DSA-256f would have a signature nearly as large as the document itself. This is why SLH-DSA is selected deliberately for specific high-value use cases rather than deployed everywhere.
Part 3 — When to use SLH-DSA
The decision between SLH-DSA and ML-DSA comes down to the answer to one question: Is the security assurance of hash-based cryptography worth the performance trade-off for this specific use case?
Use-case guidance
Root CA private key signing, the highest-value, longest-lived key in your PKI
Consider SLH-DSA
Long-lived document signatures, legal, financial, regulatory records that must verify for 20+ years
Consider SLH-DSA
TLS server certificates — short-lived (90 days), high volume, latency-sensitive
ML-DSA preferred
Software code signing — moderate volume, medium lifetime
Either acceptable
IoT firmware signing — constrained device, bandwidth-limited OTA updates
ML-DSA preferred
Offline signing of critical infrastructure configurations
Consider SLH-DSA
The key insight about "stateless" in SLH-DSA's name: earlier hash-based signature schemes (XMSS, LMS) required careful state management, using the same key twice in certain stateful schemes could catastrophically weaken security. SLH-DSA is stateless, meaning each signing operation is independent and there is no state to track. This makes it significantly easier to deploy safely, especially in distributed or redundant signing environments.
Part 4 — SLH-DSA and the three-algorithm picture
With Lesson 1.4 complete, all three NIST standards are in place. The picture of what replaces what is now complete: ML-KEM replaces RSA and ECDH for key exchange. ML-DSA is the general-purpose post-quantum signature. SLH-DSA is the conservative, high-assurance signature for the most critical and long-lived use cases.
In most organizations' migration work, SLH-DSA will appear in exactly one context initially: the question of what algorithm to use for new root CA keys. That decision is consequential, root CA keys last for decades, and it is where the SLH-DSA trade-off is most directly relevant. For everything else in a typical enterprise environment, ML-DSA is the working choice.
Comprehension check
Question 1 of 2
What makes SLH-DSA "conservative" compared to ML-DSA?
Question 2 of 2
An organization is choosing between ML-DSA and SLH-DSA for their root CA private key. Which factors favor SLH-DSA for this specific use case?