Lattice based cryptography
summary
Lattice cryptography explains encryption as encoding a message as a lattice point then adding noise so decryption is matrix–vector multiplications with a short basis as secret; practical schemes (Kyber, Dilithium, Falcon) use structured, often cyclic lattices to cut key size and run in milliseconds, with Kyber-512 using about 1024 dimensions. Signatures require discrete Gaussian sampling and careful smoothing to avoid leakage (thousands of signatures can reveal keys); best attacks solve up to ~180 dimensions using GPUs and up to 1.5 TB RAM, far from the ~400+ needed to break standards.
AI-written summary · about
chapters (6)
- 0:00Introduction to lattice cryptography
- 1:55Mathematical foundations
- 7:16Public key encryption
- 15:24Digital signatures
- 26:27Cryptanalysis state
- 33:36Q&A
related talks
39mLattice Based Cryptography Primer
01h 40mHistorical Talk on Lattice-Based Cryptography
01h 04mUsing Lattices for Cryptanalysis
01h 02mLattices and the NIST PQ-crypto Standardization Process
01h 07mLattices and Encrypted Computation
22mExplaining Post-Quantum Cryptography with Cartoons
40mPost-Quantum
57mAlgorithms for Lattice Problems, in Practice
