The Mathematics of Lattices I
summary
Introduces lattices as integer linear combinations and frames the key problems: SVP (shortest nonzero vector) and SIVP (short independent vectors). States concrete algorithmic facts: exact SVP best known in 2^n time and polynomial-time algorithm giving a 2^{n/2} approximation. Gives a cryptographic construction: SIS (short integer solutions) yields a family f_A(r)=A·r mod q that is collision-resistant, and proves a worst-case→average-case reduction using discrete Gaussians and the smoothing lemma to relate SIS hardness to worst-case lattice problems (≈√n loss).
AI-written summary · about
chapters (14)
- 0:00The Mathematics of Lattices
- 3:16Good Basis, Bad Basis
- 5:19Hard Problems
- 14:14SVP: Algorithms and Complexity
- 22:21Why Lattice-based Crypto?
- 23:45Cryptographic Hardness
- 24:36From Hardness to Usefulness
- 26:53What I Won't Get to Tell You
- 27:43Short Integer Solutions (SIS)
- 31:17Generalized SIS (GSIS)
- 35:00Collision-Resistant Hash Function
- 46:061-D Gaussian Distribution
- 46:472-D Gaussian Distribution
- 51:24Worst-Case/Average-Case Reduction
related talks
01h 42mMathematics of Lattices
39mLattice Based Cryptography Primer
01h 40mHistorical Talk on Lattice-Based Cryptography
01h 36mAlgorithms for Algebraic Lattices: Classical and Quantum
01h 32mThe Short Integer Solutions Problem and Cryptographic Applications
01h 03mComplexity of Lattice Problems
01h 08mCryptography from Ideal Lattices
01h 15mAlgebraic Lattices and Ring Learning with Errors
