Applied Post-Quantum Cryptography
Start reading Download the PDF
- Part I: Foundations
- 1The Quantum Threat
- 2SageMath Basics for Post-Quantum Cryptography
- 3Linear Algebra Foundations
- 4Polynomial Rings
- 5From Convolution to Negacyclic Ring Arithmetic
- 6Number Theoretic Transform (NTT)
- Part II: Lattice-Based Cryptography
- Lattices and Hard Problems
- 7Lattices
- 8Gram–Schmidt Orthogonalization and the LLL Algorithm
- 9Shortest Vector Problem (SVP)
- Learning With Errors and Its Variants
- 10Probability and Error Distribution
- 11Learning With Errors (LWE)
- 12Ring-LWE (RLWE)
- 13Module-LWE (MLWE)
- Building ML-KEM (FIPS 203)
- 14Introduction to Kyber (ML-KEM)
- 15Centered Binomial Distribution (CBD) – Why Kyber does not use Gaussian
- 16Complete Implementation of ML-KEM (FIPS 203)
- Signatures: ML-DSA and FN-DSA
- 17Complete Implementation of ML-DSA (FIPS 204)
- 18FN-DSA (Falcon): Draft-Oriented Walkthrough
- Part III: Hash-Based Cryptography
- 19Hash-Based Signatures: One-Time and Few-Time
- 20Merkle Trees and Stateless Signatures
- 21SLH-DSA (SPHINCS+, FIPS 205): Algorithm Walkthrough
- Part IV: Code-Based Cryptography
- 22Classic McEliece
- 23HQC
- Part V: Multivariate and Isogeny-Based Cryptography
- 24Multivariate Cryptography
- 25Isogeny-Based Cryptography
- Part VI: Post-Quantum Cryptography in Practice
- 26Side-Channel Security
- 27Deploying Post-Quantum Cryptography
- 28Post-Quantum Migration of Blockchains
- Appendix
- ABinary Goppa Codes