COMP 537: Cryptography
Fall 2025Instructor: Saba Eskandarian
Contact: saba@cs.unc.edu or anonymous feedback form
TAs: To be announced
Lectures: Tues/Thurs 2pm-3:15pm, FB009
Office Hours: To be announced
Links:
Syllabus
Course Schedule
Gradescope
Canvas
Anonymous Feedback
Course Description
Cryptography is an indispensable tool for protecting information in computer systems. Our web browsers use it almost every time we connect to a website; it protects our private messages from prying eyes; it enables the modern world of online commerce; and it guards the freedoms of journalists, dissidents, and oppressed groups throughout the world.
At the same time, cryptography has deep connections to the theory of computation, number theory, algebra, and computational complexity theory. Major open questions in cryptography have immediate ramifications for whether P=NP, and cryptography research has given rise to several of the most beautiful ideas in computer science. These ideas (which we will cover) have been recognized by several Turing awards.
This course will introduce you to both sides of cryptography. Our main focus will be on the inner workings of cryptographic primitives and how to use them correctly. We will begin with standard cryptographic tools such as encryption, message authentication, key exchange, and digital signatures before moving on to more advanced topics like elliptic curves, post-quantum cryptography, and zero-knowledge. See the course schedule page for a more detailed list of topics. Throughout the course we will also explore the techniques used in modern cryptography to reason about the security of cryptographic schemes.
Assignments
NOTE: assignments are not yet updated. These are last year's assignments. They will be updated for fall 2025 soon.
- Problem set 1: due Thursday, August 28
- Problem set 2: due Tuesday, September 16
- Programming assignment 1 (starter code): due Thursday, September 25
- Problem set 3: due Thursday, October 9
- Programming assignment 2 (starter code): due Tuesday, October 28
- Problem set 4: due Thursday, November 13
- Problem set 5: due Tuesday, December 2
Programming assignments use Python 3.
Resources
The following resources may be helpful as reference throughout the course.- A Graduate Course in Applied Cryptography, textbook by Dan Boneh and Victor Shoup
- Introduction to Modern Cryptography, textbook by Jonathan Katz and Yehuda Lindell
- Dan Boneh's online cryptography class, videos covering some of the material from this class
- Attacks and Reductions in Cryptography, a short tutorial by David Wu
- Arithmetic Modulo Primes, a cheat sheet by Dan Boneh
- Arithmetic Modulo Composites, a cheat sheet by Dan Boneh
- Glossary of Crypto Definition Acronyms