Explore lattice theory and its applications in this comprehensive lecture from the Lattices: Algorithms, Complexity, and Cryptography Boot Camp. Delve into the fundamentals of lattices, the Shortest Vector Problem, and other related lattice problems. Examine civic algorithms, ruling out techniques, and living algorithms. Discover key concepts such as LML and BKZ while considering open problems and questions in the field. Gain insights into the complexity and cryptographic implications of lattice-based algorithms through this in-depth presentation by Stephens-Davidowitz.
Overview
Syllabus
Introduction
What is a Lattice
Shortest Vector Problem
Other Lattice Problems
Civic Algorithms
Ruling it out
Silly thought
When
Why
Better
Open Problem
Living Algorithms
Open Problem 2
Open Problem 4
Open Question
LML
BKZ
Taught by
Simons Institute
