CS 442 - Introduction to Cryptography (Spring 2026)
Course Overview
Cryptography has evolved from the art of writing and solving codes into the study of mathematical techniques for securing digital information, systems, and distributed computations in untrusted environments. Today, it forms the backbone of modern digital security.
This course will introduce the fundamental principles of modern cryptography. We will begin with core cryptographic primitives such as encryption and message authentication, and then progress to advanced primitives including zero-knowledge proofs and secure multiparty computation. We will analyze the security properties that are desirable for each of these primitives and learn how to formally define them. We will also discuss constructions of these primitives and rigorously prove that they meet the defined security requirements. By the end of the course, you will be able to use these primitives in the design of secure systems and analyze real-world cryptosystems.
Basic Information
-
Instructor: Aarushi Goel
Instructor Office Hours: 3.30 PM - 4.30 PM, Thursday (HILL 418)
Class Time: 2:00 PM - 3:20 PM, Tuesday and Thursday
Class Location: SEC 209
Discussion: Piazza
-
TA: Yuange Li
TA Office Hours: 3.30 PM - 4.30 PM, Tuesday (HILL 420)
Email: yl1407 [AT] rutgers [dot] edu
Pre-Requisites
CS 206 or an equivalent course on Discrete Mathematics is required. Familiarity with basic probability theory, computational complexity, and mathematical proof techniques is also expected.
Grading Policy
10% Class Participation
30% Midterm
40% Final Exam
20% Homeworks (best 5 out of 6)
All homeworks must be submitted via Gradescope (on Canvas).
Late Submission: Homework submitted upto 24 hours late will incur a penalty of 50%. Homework submitted more than 24 hours late will receive no credit.
Collaboration: You are encouraged to collaborate with your classmates on homework problems, however, your final write-up must be your own. Be sure to explicitly acknowledge everyone with whom you collaborated. You may also refer to books or online resources listed on this website to aid in solving homework problems. However, you must properly credit all such sources in your submission, and under no circumstances should you copy material verbatim. The use of AI tools is NOT allowed.
Academic Dishonesty: In general, any instance of academic dishonesty will result in a significant penalty to your overall course grade and will be referred to the Office of the Dean of Students for further action.
Homework Schedule
| Homework | Release (6:00 PM) | Due (11:59 PM) |
|---|---|---|
| Homework 1 | ||
| Homework 2 | ||
| Homework 3 | ||
| Homework 4 | ||
| Homework 5 | ||
| Homework 6 |
Class Schedule
| Date | Topics | Slides | Other References |
|---|---|---|---|
| Jan 20 | Introduction | Lecture 1 |
References
Useful Books
A Graduate Course in Applied Cryptography by Dan Boneh and Victor Shoup
Introduction to Modern Cryptography, Second Edition by Jonathan Katz and Yehuda Lindell
The Joy of Cryptography by Mike Rosulek
Foundations of Cryptography: Volume 1, Basic Tools by Oded Goldreich
Foundations of Cryptography: Volume 2, Basic Applications by Oded Goldreich
Useful Lecture Notes
A Course in Cryptography by Rafael Pass and Abhi Shelat
Introduction to Cryptography by Jonathan Katz
Lecture Notes on Cryptography by Shafi Goldwasser and Mihir Bellare
Introduction to Modern Cryptography by Mihir Bellare and Phillip Rogaway