Theoretical Cryptography - Winter 2011/12

Instructor: Moni Naor 


When:     Tuesday 14:00--16:00
Where: FGS B (Midrasha Building)

DESCRIPTION:   Cryptography deals with methods for protecting the privacy, integrity and functionality of computer and communication systems. The goal of the course is to provide a firm foundation to the construction of such methods. In particular we will cover topics such as notions of security of a cryptosystem, proof techniques for demonstrating security and cryptographic primitives such as one-way functions and trapdoor permutations.

PREREQUISITES: Students are expected to be familiar with algorithms, data structures, probability theory, and linear algebra, at an undergraduate level. No prior cryptography course will be assumed.

METHOD OF EVALUATION: There will be around six to eight homework assignments and a final test. Homework assignments should be turned in on time (usually two weeks after they are given)! Try and do as many problems from each set. You may discuss the problems with other students, but the write-up should be individual. There will also be reading assignments. Each student should take notes of (at least) one lecture.

Exam : The exam will be in class.

BIBLIOGRAPHY: There is no textbook for the course. A lot of relevant material is available in 

Online Courses and Material:



Reading assignment:

History: Key Papers in Cryptography: