CS 6802

CS 6802

Course information provided by the Courses of Study 2021-2022.

A mathematically rigorous course on lattices. Lattices are periodic sets of vectors in high-dimensional space. They play a central role in modern cryptography, and they arise naturally in the study of high-dimensional geometry (e.g., sphere packings). We will study lattices as both geometric and computational objects. Topics include Minkowski's celebrated theorem, the famous LLL algorithm for finding relatively short lattice vectors, Fourier-analytic methods, basic cryptographic constructions, and modern algorithms for finding shortest lattice vectors. We may also see connections to algebraic number theory.

When Offered Fall.

Prerequisites/Corequisites Prerequisite: MATH 4310 or permission of instructor.

  • Demonstrate algorithmic techniques such as basis reduction and sieving.
  • Identify Regev's lattice-based public-key encryption scheme.
  • Understand how Fourier-analytic methods can be used to study the geometry of lattices.

View Enrollment Information

Syllabi: none
  •   Regular Academic Session. 

  • 3 Credits Stdnt Opt

  • 18874 CS 6802   LEC 001

    • MW Thurston Hall 203
    • Aug 26 - Dec 7, 2021
    • Stephens-Davidowitz, N

  • Instruction Mode: In Person
    Seats are reserved for graduate students. Professional and undergraduate students should add themselves to the waitlist during add/drop. See enrollment page for more details: https://www.cs.cornell.edu/courseinfo/enrollment/cs-6000-level-courses.