Cryptography & Post-Quantum› Lattice Foundations›Lattices and Their Hard Problems: SVP, CVP, and the Geometry of Security

In this series

Lattice Foundations

1Lattices and Their Hard Problems: SVP, CVP, and the Geometry of SecurityResearch
2Learning With Errors: The Distribution, the Decision-Search Equivalence, and Regev's ReductionResearch
3Ring-LWE and Module-LWE: Buying Efficiency with Algebraic StructureResearch
4Parameters and the Security Estimate: Core-SVP, BKZ Block Size, and NIST LevelsResearch
5Where the Assumptions Could Fail: Algebraic and Dual Attacks on Structured LatticesResearch

← All research

HostExpert

Murali Chillakuru

Press play to begin the walkthrough.

0:00

7:56

Lattice Foundations · 1 / 5

Lattices and Their Hard Problems: SVP, CVP, and the Geometry of Security

Back