In this course, we will overview the state of the art on the computational hardness of problems on Euclidean lattices. Euclidean lattices have implications in numerous areas in computer science, communication theory and computational mathematics. We will focus in particular on cryptographic applications of the presumed computational intractability of lattice problems.
Lecture notesWhile teaching this course, I was using handwritten notes. I have been asked a couple of times to make those notes available. Here they are. Use them with caution, at your own risk, I did not polish them nor removed the numerous bugs.
PrerequisitesThe student should be comfortable with algorithms, complexity reductions, and probabilities. Having followed an introduction to cryptography is recommended.