Main

CS 195-7: Introduction to Cryptography

Tentative plan for first month

Lecture 1, 9/3. Overview of modern cryptography. Unconditional security: one-time pad, Shannon's impossibility result.
Lecture 2, 9/5. Notions of security. Security under computational assumptions.
Lectures 3 and 4, 9/10-12/02. One-way functions, trapdoor permutations. RSA.
Lecture 5, 9/17. Goldwasser-Micali cryptosystem: overview of the underlying number theory.
Lecture 6, 9/19. Goldwasser-Micali cryptosystem: indisinguishability, proof of security for one-but messages under quadratic residuocity assumption.
Week of 9/24, 9/26: no lecture.
Lectures 7-8 10/1, 10/3: GM cryptosystem for many bits: hybrid argument, semantic security.
Lectures 9-10, 10/8, 10/10 Pseudo one-time pad, pseudorandomness.
Further along in the semester: security against adaptive adversaries -- the case of encryption and digital signature schemes; pseudorandom functions; zero-knowledge proofs.