|(Formerly numbered CS 120/CSCI E-177, last offered Fall 2006.)|
|Prof. Salil P. Vadhan|
Algorithms to guarantee privacy and authenticity of data during communication and computation. Rigorous proofs of security based on precise definitions and assumptions. Topics may include one-way functions, private-key and public-key encryption, digital signatures, pseudorandom generators, fully homomorphic encryption, and the role of cryptography in network and systems security.
Schedule & Assignments
On-demand lecture & section videos
CS120 Syllabus (Harvard FAS)
CSCI E-177 Syllabus (Harvard Extension)
Lecture Notes & Assignments