UC Seal UCLA 
Computer Science Department      

CS 282A & MATH 209A
Foundations of Cryptography

Instructor: Prof. Rafail Ostrovsky
Course Home Page
Contact Info
General Information/Policies
Course Materials


General Information/Policies

For course description and objectives, see Course Home Page.

Prerequisites: CS180 or equivalent, knowledge of randomized algorithms, basic probability theory, NP-completeness. Knowledge of computational number theory will also be useful.

Follow-up course: CS282B/MATH209B in the spring of 2005.

What should you expect? To get an idea, you can look at the lecture notes of a graduate cryptography course I taught at U.C. Berkeley in 1994. See it either in postscript or pdf formats.