Academics

  /  

Courses

  /  

Descriptions

COMP_SCI 496: Lattices in Computer Science

VIEW ALL COURSE TIMES AND SESSIONS

Prerequisites

All CS Ph.D students are welcome to enroll. The main prerequisite is strong mathematical maturity. Some familiarity with the following concepts will also be helpful: linear algebra, abstract algebra (including algebraic objects such as vector spaces, groups, and rings); basic complexity classes such as P, NP, and BPP; and probability theory.

Description

A "lattice" is a regular ordering of points in space. These geometric objects have been studied by mathematicians for over a hundred years, and in the last few decades have found many applications in computer science. In this class, we will discuss computational problems on lattices and their applications. We will emphasize the design of secure cryptosystems using lattice problems (part of an exciting area of research called lattice-based cryptography) and cryptanalysis, the study of breaking cryptosystems.

COURSE INSTRUCTOR: Dr. Huck Bennett