Home Page


EECS 574
          Graphics

EECS 475: Introduction to Cryptography (Winter 2022)

Overview: Cryptography, or “secret writing,” is nearly as old as written communication itself. Yet only in the past few decades has it grown from a “black art” into science with rigorous mathematical foundations and methodologies. These have taken cryptography far beyond its roots in simple secret codes, to a discipline with wide-reaching influence on computing as a whole. This class is an undergraduate-level introduction to modern cryptography. The emphasis is on essential concepts, precise attack models and security definitions, and constructions of some real-world cryptosystems. Specific topics/syllabus include:


Instructor: Mahdi Cheraghchi



Syllabus:

Expected outcomes: By the end of this course, you should be able to critically think about the design of cryptographic primitives and ways of safely composing and utilizing them in applications. You should gain insights, based on mathematical principles, on good and bad practices in the design of cryptographic systems. While practical considerations such as the actual implementations and the concrete choice of various parameters are generally beyond the scope of this course, you will be able to understand the foundations and have a clear insight on principles underlying secure cryptosystems.


Required textbook: Introduction to Modern Cryptography (2nd edition) by Jonathan Katz and Yehuda Lindell.


Prerequisites: The formal prerequisites are: (EECS 203 or MATH 312 or MATH 412) and (EECS 180 or EECS 183 or EECS 280) and EECS 376. Other helpful, but not required, courses include: EECS 477 and/or 586 (Algorithms), and Math 425 (Probability).


Note: This course is quite mathsy by design, as mathematics is the fundamental pillar of good cryptography. Hence the main prerequisite is a level of “mathematical maturity.” Specifically, students should be comfortable with discrete mathematics (e.g., counting, summations, modular arithmetic), basic probability (e.g., probability spaces, random variables, elementary laws and manipulations), and design and analysis of algorithms (e.g., precisely describing an algorithm, reasoning about its correctness, and analyzing its running time). We will discuss selected proofs in some detail, and heavily use the idea of reductions from Theory of Computation (i.e., assuming A is impossible, show B is impossible by showing solving B can lead to a solution for A). You may recall examples of this from EECS 376.


Evaluation criteria: Participation, Homework (almost once every two weeks), Midterm Exam, Scribe Notes, Final Project (written report).


Lectures: Mon/Wed 10:30 AM - 12:00 PM at G906 COOL (from Jan 5 to Apr 19, 2022)


Discussions (required): Fridays 12:30PM - 1:30PM or 1:30PM - 2:30PM at 1010 DOW.


Graduate students: This is an Upper Level CS (ULCS) elective course and is not intended for graduate students. There is a graduate version (EECS 575) that is specifically designed for graduate students.




Home Page