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.
EvaluationIf the number of students allows it: scribe (1/3) + article presentation (2/3).
PrerequisitesThe student should be comfortable with algorithms, complexity reductions, and probabilities. Having followed an introduction to cryptography is recommended.