Fun with Lattices
summary
Explains that some lattice problems have average-case hardness equal to worst-case hardness, focuses on the shortest vector problem and the closest-vector variant, and uses Gram–Schmidt, Hadamard bounds and the Minkowski convex body theorem to give concrete lower and upper bounds (upper ≈ sqrt(n)·det(B)^(1/n)). Shows how a NTRUEncrypt-style ring construction and the GGH scheme encode messages via a good/bad basis pair, notes GGH is practically breakable while lattice assumptions drive modern post‑quantum work.
AI-written summary · about
chapters (27)
- 0:00Intro
- 0:53What are Lattices
- 2:51Table of Contents
- 4:44Goal
- 7:14Linear Combinations
- 9:17General Points
- 10:38Inner Product
- 14:16Lattices
- 17:15Ndimensional Ball
- 17:41Linearly Independent
- 18:06Linearly Dependent
- 25:33Proof
- 26:25Partition
- 27:09Proof of conjecture
- 30:26Proof of uniqueness
- 31:51Linear transformation
- 33:07When
- 44:24Volume
- 44:51Original Lattice
- 45:02Cryptography
- 48:10Discrete logarithms
- 49:11RSA
- 49:42DiffieHellman
- 50:54Similar Problems
- 53:47Minimize
- 55:28Intermission
- 56:13orthogonality
related talks
39mLattice Based Cryptography Primer
01h 07mLattices and Encrypted Computation
01h 04mUsing Lattices for Cryptanalysis
40mPost-Quantum
57mChallenges in Evaluating Costs of known Lattice Attacks
30mOn the Concrete Security of LWE with Small Secret
25mThe Whole is Greater than the Sum of its Parts: Linear Garbling and Applications
54mAttribute-based Encryption for Circuits
