COMPSCI 435 - Introduction to Cryptography, Fall 2024
Lecture Hall: |
Sewell Social Sciences 5206, 2:30-3:45PM Monday, Wednesday, Friday |
Instructor : |
Rishab Goyal, rishab.goyal@wisc.edu |
Teaching Assistants : |
Abtin Afshar, abtin@cs.wisc.edu
|
Peer Mentor : |
Sanjay Nagarimadugu, snagarimadug@wisc.edu |
Cross Listed as: |
ECE 435, MATH 435 |
Course Description
The objective of this course is to provide an introduction to the theoretical and mathematical underpinnings of modern cryptographic toolset such as encryption, authentication, pseudorandomness, collision-resistance, etc. We will also discuss how number-theoretic hardness can be translated to security of various cryptographic systems.
Textbook and Notes: The course has no required textbook. Supplementary notes will be provided through Canvas. We strongly recommend the textbook - "Introduction to Modern Cryptography" by Katz and Lindell and use this textbook as an auxiliary resource.
Attendance Policy: We will be recording your attendance for lectures using TopHat. More details will follow soon. You are expected to attend all lectures. We will allow absences for religious observances and medical emergencies (with a doctor's note). Please talk to instructor about this.
Resources:
Syllabus | Exam Info | Assignment Info | Office Hours | Canvas | Piazza (ask questions here)
Tentative Schedule
Note: Dates for topics and homeworks should be considered tentative and some topics might require multiple lectures.
| Week | Lec No. | Date | Topic | Other |
|---|---|---|---|---|
| 1 | 1 | 9/4 | Course logistics, history and basics of cryptography | |
| 2 | 9/6 | Perfectly secure encryption | ||
| 2 | 3 | 9/9 | Perfectly secure encryption (cont.), computational security | d |
| 4 | 9/11 | IND-CPA: Security games and reduction | PS 1 Out | |
| 5 | 9/13 | IND-CPA: Security games and reduction (cont.) | ||
| 3 | 6 | 9/16 | Pseudorandom functions (PRFs) | |
| 7 | 9/18 | IND-CPA secure encryption via PRFs | ||
| 8 | 9/20 | IND-CPA secure encryption via PRFs (cont.), pseudorandom generators (PRGs) | ||
| 4 | 9 | 9/23 | Pseudorandom permutations (PRPs), advanced encryption standard (AES) | |
| 10 | 9/25 | Block ciphers | PS1 Due PS2 Out |
|
| 11 | 9/27 | Beyond encryption, message authentication codes (MACs) | ||
| 5 | 12 | 9/30 | MACs (cont.) | |
| 13 | 10/2 | Collision resistant hash functions (CRHFs), upgrading MACs (from short to long) | ||
| 14 | 10/4 | CRHFs (cont.) | ||
| 6 | 15 | 10/7 | CRHFs (cont.) | |
| 16 | 10/9 | IND-CCA secure encryption | PS2 Due PS3 Out |
|
| 17 | 10/11 | IND-CCA secure encryption (cont.) | ||
| 7 | 18 | 10/14 | Number theory (GCD, Euclid, and Fermat) | |
| 10/16 | Discussion Section - Mid-Term Exam Review | |||
| 10/18 | 10/18 - Mid-Term Exam (in class) | |||
| 8 | 10/21 | Discussion Section - Mid-Term Exam Solutions | ||
| 10/23 | Special Discussion Section | |||
| 10/25 | Discussion Section - Number Theory | |||
| 9 | 19 | 10/28 | Number theory (cont.) | |
| 20 | 10/30 | Cryptographic assumptions from number theory (DLog, CDH, DDH) | PS3 Due PS4 Out |
|
| 21 | 11/1 | Diffie-Hellman key exchange and public-key encryption | ||
| 10 | 22 | 11/4 | Public-key encryption (cont.) | |
| 23 | 11/6 | Collision resistance via discrete log | ||
| 24 | 11/8 | (Public-key) Signatures | ||
| Classes from 11/11 - 12/11 will include special topics, discussion sections, exam reviews | ||||
| 11/13 - PS4 Due & PS5 Out | ||||
| 12/6 - PS5 Due | ||||
| 12/18 - Final Exam | ||||
| 12/20 - Special Office Hours - Final Exam Solutions | ||||