Instructor: | Mark Zhandry () |

Office Hours: Mondays, 3pm-4pm, COS 314 | |

TAs: | Udaya Ghai () |

Office Hours: Tuesdays, 1pm-2pm, Tea Room | |

Qipeng Liu () | |

Office Hours: Wednesdays, 4pm-5pm, Location TBA | |

Lecture: | MW 1:30pm - 2:50pm, Room Friend Center 008 |

Grading: | 40% for roughly weekly homeworks, 30% Projects, 30% take-home final |

Piazza: | https://piazza.com/class/jb0zp9b0blf3o0 |

Textbook: | There is no official text for this course, however Introduction to Modern Cryptography by Katz and Lindell (KL) is a good resource. Each lecture will have pointers to the appropriate sections of KL for those following along with the book. |

In the last few decades, however, cryptography has been fundamentally transformed. Modern cryptography extends far beyond basic codes to encompass a wide variety of concepts such as authentication and integrity. Modern cryptography is also now more of a science, grounded on rigorous theoretical foundations thus ending the tug of war in favor of the code makers. These features of modern cryptography have been fundamental in transforming cryptography from a military tool into one of the fundamental pilliars of our modern digital lives.

This course is an introduction to modern cryptography, emphasizing the theoretical foundations. We will cover a variety of topics, including secret key and public key encryption, authentication, commitments, pseudorandom generators, and some advanced topics

Lecture | Topic | KL Section | Notes |

1 - M, 2/5 | Course introduction, A Brief History of Cryptography | 1.3 | [1] |

2 - W, 2/7 | Definitions in Cryptography, the One-time Pad | 1.4-2.2 | [2] |

3 - M, 2/12 | Multiple Message Security, Issues, Randomized Encryption | [3] | |

4 - W, 2/14 | Limitations of Information-Theoretic Security, Stream Ciphers, PRGs, and Computational Assumptions | 2.3-3.3 | [4] |

5 - M, 2/19 | Constructing PRGs | 6.1 | [5] |

6 - W, 2/21 | CPA security and PRFs | 3.4-3.5 | [6] |

7 - M, 2/26 | PRPs, Block Ciphers, Modes of Operation | 3.6, 6.2 | [7] |

8 - W, 2/28 | Constructing Block Ciphers | 6.2 | [8] |

9 - M, 3/5 | Attacks on Block Ciphers | 6.2 | [9] |

10 - W, 3/7 | Class Cancelled due to storm | ||

11 - M, 3/12 | Message Integrity, MACs | 4.1-4, 4.6 | [10] |

12 - M, 3/14 | Authenticated Encryption, CCA Security | 4.5 | [11] |

M, 3/19 | No Class - Spring Break | ||

W, 3/21 | |||

13 - M, 3/26 | Collision Resistant Hashing, Random Oracle Model | 5.1-4, 6.3 | [12] |

14 - W, 3/28 | Commitment Schemes | [13] | |

15 - M, 4/2 | Number-theoretic constructions of symmetric primitives | 8.3-8.4 | [14] |

16 - M, 4/4 | One-way functions, hardcore bits | 7.1 | [15] |

17 - M, 4/9 | Relationships between Symmetric Primitives | 7.2 | [16] |

18 - M, 4/11 | Key Exchange, Trapdoor Permutations | 10.3 | [17] |

19 - M, 4/16 | Public Key Encryption | 11.1-11.5, 13.1 | [18] |

20 - W, 4/18 | Digital Signatures | 12.1-12.4 | [19] |

21 - M, 4/23 | Digital Signatures from One-way Functions | 12.6 | [20] |

22 - W, 4/25 | Identification Protocols | 12.5 | [21] |

23 - M, 4/30 | Zero Knowledge | [22] | |

24 - W, 5/2 | Misc | [23] |

https://doodle.com/poll/8cpyuxwue8bnw9nr

hw1.tex

template.tex

Old exam: Spring 2017 Final Exam

- Part 0: February 9th
- Part 1: February 20th
- Part 2:
**March 8th**

p = total project points (out of 300)

f = final points (out of 300)

Numerical grade = (h+p+f)/10

There is no set curve or grading scale for the course (so for example a 90% may or may not end up being an A). However, expect the grade distribution to be roughly consistent with upper-level COS courses.