1. Introduction and Minkowski’s theorem. (notes)
  2. The Gram-Schmidt orthogonalization and the LLL algorithm. (notes)
  3. Crypto interlude 1: Using LLL to break knapsack-based cryptography.
  4. Crypto interlude 2: Ajtai’s worst-case to average-case reduction.
  5. Babai’s nearest plane algorithm. (notes)
  6. GPV’s lattice-based signatures and discrete Gaussian sampling.

I’m in the process of typesetting¬†the lecture notes. Enjoy your winter break, and I’ll see you in the spring!