~/talk

The Mathematics of Lattices I

Talkat Cryptography Boot Camp 2015 · 2015-05-18..05-22· [cryptography]
links:none on file
slides:none on file

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

  1. 0:00The Mathematics of Lattices
  2. 3:16Good Basis, Bad Basis
  3. 5:19Hard Problems
  4. 14:14SVP: Algorithms and Complexity
  5. 22:21Why Lattice-based Crypto?
  6. 23:45Cryptographic Hardness
  7. 24:36From Hardness to Usefulness
  8. 26:53What I Won't Get to Tell You
  9. 27:43Short Integer Solutions (SIS)
  10. 31:17Generalized SIS (GSIS)
  11. 35:00Collision-Resistant Hash Function
  12. 46:061-D Gaussian Distribution
  13. 46:472-D Gaussian Distribution
  14. 51:24Worst-Case/Average-Case Reduction
~/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.