CS 8803TFC - Theoretical Foundations of Cryptography, Spring 2011
Instructor: Chris Peikert
Time: Tue/Thu 3-4:30pm (First meeting:
Jan 11th Jan 18th, due to weather)
Location: College of Computing Building, Room 102
Summary: Cryptography, or "secret writing," is nearly as old as written communication itself. Yet only over the past few decades has it grown from a "black art" into a true science with rigorous mathematical foundations and methodologies. These have taken cryptography far beyond its roots in simple secret codes, to a discipline with far-reaching influence on computing as a whole.
This class is a graduate-level, theory-oriented introduction to the foundations of modern cryptography. The emphasis is on essential concepts, precise models and definitions, and proof techniques. Topics include: one-way functions and related complexity assumptions, pseudorandomness, public-key and identity-based crypto, zero knowledge and commitment, and connections to diverse areas of computer science. As time permits, we may also touch upon specialized topic areas such as secure multiparty computation, private information retrieval, or lattice-based cryptography.
For more information and course policies, see the course information and syllabus handout.
Handouts and Lecture Notes
Indistinguishability and Pseudorandomness
- The Georgia Tech cryptography reading group.
- A Course in Cryptography, by Rafael Pass and abhi shelat (freely available notes)
- Boaz Barak's course at Princeton
- Salil Vadhan's course at Harvard
- Yevgeniy Dodis's course at NYU
- A Computational Introduction to Number Theory and Algebra, a book by Victor Shoup (freely available)
- A collection of good advice on reading and writing mathematical proofs.
Previous iterations of this course: