MATH 6302 — Lattices: Geometry, Cryptography, and Algorithms
General Information
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.
Full Cornell course description (FA26)
Credits: 3
Prerequisites and Enrollment
Prerequisites: background equivalent to: MATH 4310.
Recorded Offerings
| Semester | Listed instructors | Course details |
|---|---|---|
| Fall 2026 | Noah Stephens-Davidowitz | Roster / syllabus |
Workload and General Advice
Student contributions have not been added yet. Consult the offering’s syllabus for assignments and assessment details.
Student Experiences
No testimonials yet.
Course information checked against Cornell’s Spring and Fall 2026 rosters on September 18, 2026. The listed semesters are verified examples, not a complete offering history.