CS 127/227 > Previous Years

Previous Years

Spring 2020 and 2018 (same webpage) and Spring 2016 - most similar version to this one. See Final projects for Spring 2018 and the student feedback from Spring 2020 (CS 127 and CS227R combined), Spring 2018 (CS 127 and CS227R combined), and Spring 2016
Princeton crypto courses: Spring 2010 (feedback), Fall 2007, Fall 2005
At Harvard, CS 127 was previously taught by Salil Vadhan on Fall 2006 and Fall 2013, see here.

Teaching fellows: Leor Fishman and Alec Sun

Schedule:

Lecture	Day	Date	Topic
1	Tuesday	Jan 28	introduction
2	Thursday	Jan 30	Computational security
3	Tuesday	Feb 4	Pseudorandom generators
4	Thursday	Feb 6	Pseudorandom (aka key derivation) functions
5	Tuesday	Feb 11	Pseudorandom functions from pseudorandom generators, block ciphers
6	Thursday	Feb 13	Chosen ciphertext security
7	Tuesday	Feb 18	Hash functions, random oracles, proofs of work, cryptocurrencies
8	Thursday	Feb 20	More hash functions: Entropy extraction, protecting passwords, slow hashes, merkle trees
9	Tuesday	Feb 25	Public key cryptography, the obfuscation paradigm, Diffie Hellman and DSA
10	Thursday	Feb 27	Concrete candidates: RSA
11	Tuesday	Mar 3	Lattice based crypto
12	Thursday	Mar 5	Secure communication and the “handhsake”, SSL/TLS and friends
13	Tuesday	Mar 10	Fully homomorphic encryption 1
14	Thursday	March 12	Fully homomorphic encryption 2
spring break
15	Tuesday	March 24	Review of public key crypto, secure channels, and FHE
16	Thursday	March 26	Zero Knowledge Proofs
17	Tuesday	March 31	Multiparty secure computation 1
18	Thursday	April 2	Multiparty secure computation 2
19	Tuesday	April 7	Software obfuscation 1
20	Thursday	April 9	Software obfuscation 2
21	Tuesday	April 14	Quantum computing and crypto
22	Thursday	April 16	Quantum computing and crypto 2
23	Tuesday	April 21	TBD
24	Thursday	April 23	Embedded EthiCS
25	Tuesday	April 28	Course recap

Teaching fellows: Chi-Ning Chou and Yueqi Sheng

Schedule:

Lecture	Day	Date	Lecture	Slides
1	Tuesday	Jan 23	introduction	powerpoint
2	Thursday	Jan 25	Computational security	-
3	Tuesday	Jan 30	Pseudorandom generators	-
4	Thursday	Feb 1	Pseudorandom (aka key derivation) functions	-
5	Tuesday	Feb 6	Pseudorandom functions from pseudorandom generators, block ciphers	-
6	Thursday	Feb 8	Chosen ciphertext security	-
7	Tuesday	Feb 13	Hash functions, random oracles, proofs of work, cryptocurrencies	-
8	Thursday	Feb 15	More hash functions: Entropy extraction, protecting passwords, slow hashes, merkle trees	-
9	Tuesday	Feb 20	Public key cryptography, the obfuscation paradigm, Diffie Hellman and DSA	-
10	Thursday	Feb 22	Concrete candidates: RSA	-
11	Tuesday	Feb 27	Lattice based crypto	-
12	Thursday	March 1	Secure communication and the “handhsake”, SSL/TLS and friends	-
13	Tuesday	March 6	Fully homomorphic encryption 1	-
14	Thursday	March 8	Fully homomorphic encryption 2	-
-	Harvard Spring Break	-	-	-
15	Tuesday	March 20	Zero Knowledge Proofs	-
16	Thursday	March 22	Multiparty secure computation	-
17	Tuesday	March 27	no class	-
18	Thursday	March 29	Multiparty secure computation 2	-
19	Tuesday	April 3	Guest lecture by Yael Kalai Software obfuscation 1	-
20	Thursday	April 5	Guest lecture by Yael Kalai Software obfuscation 2	-
21	Tuesday	April 10	Quantum computing and crypto	-
22	Thursday	April 12	Quantum computing and crypto 2	-
23	Tuesday	April 17	SNARKs and their friends	-
24	Thursday	April 19	Course recap	-
25	Tuesday	April 24	Guest lecture by Bruce Schneier	-