Prerequisites: CS282A or equivalent,
knowledge of randomized algorithms, basic probability theory, NP-completeness.
Knowledge of computational number theory will also be useful.
Textbooks: None.
The course material will consists of
research
papers in cryptography which will be available
either as class handouts or web-pointers.
You are required to read material for each lecture prior to that
lecture and might be occasionally tested if you have done so.
Grading Policy:
Class participation 5%;
Scribe Notes 30%
Final project 65%.
Final project:
Final project requires students to
read a paper outside of class, write (in TeX format)
a summary explaining
main ideas and proofs and
give a verbal presentation of the paper and its analysis
to the professor and
possibly to the whole class in lecture if time permits.
UCLA