Research

Watch · narrated walkthroughs

Lattice Foundations: The Hard Problems Behind the New Standards

ML-KEM and ML-DSA rest on one family of assumptions — Learning With Errors and its structured variants. The lattice problems, the worst-case-to-average-case reductions, and the concrete parameter methodology, derived from scratch. Grounded in the primary papers.

Murali Chillakuru·5 episodes
  1. 1
    Lattices and Their Hard Problems: SVP, CVP, and the Geometry of Security
    Watch ▸7:56
  2. 2
    Learning With Errors: The Distribution, the Decision-Search Equivalence, and Regev's Reduction
    Watch ▸7:54
  3. 3
    Ring-LWE and Module-LWE: Buying Efficiency with Algebraic Structure
    Watch ▸7:38
  4. 4
    Parameters and the Security Estimate: Core-SVP, BKZ Block Size, and NIST Levels
    Watch ▸7:47
  5. 5
    Where the Assumptions Could Fail: Algebraic and Dual Attacks on Structured Lattices
    Watch ▸7:45