CS 276: Cryptography (Fall 2018)

Overview

Instructor: Sanjam Garg. 
Time & Location: 12:30--1pm, Tuesdays, Soda 320; and 2--3:30pm, Friday, Soda 310. 
Office Hours: Just drop by my office after class or fix an appointment (by email).
Prerequisites: CS 170 or equivalent. (Exposure to undergraduate level algorithms and probability, maturity with mathematical proofs)

Focus: The focus of this class will be the theoretical foundations and applications of modern cryptography.

For undergraduate students: 

GradingHomeworks - 20%, Midterm I - 25%, Midterm II - 25%, Final/Project 30%

Graduate Student Instructor: Akshayaram Srinivasan

Course Notes (Will be updated as the class proceeds.)



Topics Outline (Working Schedule!)


Aug 24Introduction & One Way Functions  Notes by Thomas Holenstein
More detailed notes (Chapter 1 and 2 (Section 2.1 to 2.3))
Additional fun reading:
A Note on Negligible Functions
Aug 28Hardness Amplification
Aug 31Levin's one-way functionLevin's one way function [Scribe notes for a class by Rafael Pass]
Sep 4Hard Core Bit Scribe notes for a class by Rafael Pass
Sep 7Computational Indistinguishability and Pseudorandom Generators Notes by Yehuda Lindell

HW1 released on 09/08
Sep 11Pseudorandom Functions 
Sep 14Semantic Security
Sep 18Digital Signatures and CRHFsTake home Midterm 1 (to be released on 09/19)
Sep 21No class!
Sep 25Midterm I (No Class)
Sep 28
Oct 2
Oct 5
Oct 9
Oct 12
Oct 16
Oct 19
Oct 23
Oct 26Midterm II
Oct 30
Nov 2
Nov 6
Nov 9
Nov 13
Nov 16
Nov 20
Nov 23Thanksgiving Day! (No class)
Nov 27
Nov 30Final!


Reference Material:

 

There is no required textbook for the course and lecture notes on essentially everything that will be covered can be found online and will be scribed as part of the class. However, following can be excellent reference material.