Prerequisite: 6.046 and 6.045 (or equivalent)
Instructor: Professor Vinod Vaikuntanathan
Schedule: MW2:30-4, room 26-328
Integer lattices are powerful mathematical objects that have found applications in many diverse facets of computer science, most notably in the areas of cryptography and combinatorial optimization. This course gives an introduction to the theory of integer lattices -- algorithms and applications to combinatorial optimization, their recent use in cryptography culminating in the first construction of a fully homomorphic encryption scheme, and the fascinating complexity landscape associated with lattice problems.