~/talk

Fun with Lattices

Talkat LambdaConf 2019 · 2019-06-05..06-07· [security]
links:none on file
slides:none on file

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

  1. 0:00Intro
  2. 0:53What are Lattices
  3. 2:51Table of Contents
  4. 4:44Goal
  5. 7:14Linear Combinations
  6. 9:17General Points
  7. 10:38Inner Product
  8. 14:16Lattices
  9. 17:15Ndimensional Ball
  10. 17:41Linearly Independent
  11. 18:06Linearly Dependent
  12. 25:33Proof
  13. 26:25Partition
  14. 27:09Proof of conjecture
  15. 30:26Proof of uniqueness
  16. 31:51Linear transformation
  17. 33:07When
  18. 44:24Volume
  19. 44:51Original Lattice
  20. 45:02Cryptography
  21. 48:10Discrete logarithms
  22. 49:11RSA
  23. 49:42DiffieHellman
  24. 50:54Similar Problems
  25. 53:47Minimize
  26. 55:28Intermission
  27. 56:13orthogonality
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.