Harvard Theory of Computation Seminar

Ideal Lattices: Cryptographic Applications and Open Problems

Daniele Micciancio, UCSD

Place and Time: Monday, November 27, Maxwell Dworkin 319 Refreshments at 2:30pm, talk at 2:45pm

ABSTRACT

Cyclic codes are among the most useful and widely used error correcting codes in coding theory and communication applications. We consider a similarly defined class of "cyclic lattices" (and a natural generalization, called "ideal lattices"), and discuss cryptographic applications, connections with other problems in algebraic number theory, and open problems concerning their computational complexity.