MATH M209A: Cryptography
(Same as Computer Science M282A.) Lecture, four hours; outside study, eight hours. Introduction to theory of cryptography, stressing rigorous definitions and proofs of security. Topics include notions of hardness, one-way functions, hard-core bits, pseudorandom generators, pseudorandom functions and pseudorandom permutations, semantic security, public-key and private-key encryption, secret-sharing, message authentication, digital signatures, interactive proofs, zero-knowledge proofs, collision-resistant hash functions, commitment protocols, key-agreement, contract signing, and two-party secure computation with static security. Letter grading.
Same course as COM SCI M282A
4 units, graduate
Offered Fall and Winter quarters
- Predicted GPA
- 3.38
- A or A minus
- 56%
- D, F or withdrew
- 6%
- Sections
- No sections listed for this term. Offered Fall and Winter quarters.
- By instructor
- Fall 2021 to Fall 2025
- All instructors
- 3.38 GPA
- 56% A
- 6% DFW
- 34 grades
- OSTROVSKY
- 3.41 GPA
- 56% A
- 6% DFW
- 34 grades
- Prerequisites
- Not read yet
- Restrictions
- Not read yet
- Grading
- Not read yet
What past students say
Read from 2 reviews, all instructors
No professor is listed for this term yet, so these count the reviews of every professor who has taught it.
- Teaching
- 1 says unclear
- Exams
- 1 says hard
- Lectures
- 1 says not recorded
- Past exams
- 1 says not shared
- Curve
- 1 says curved
- Slides
- 1 says posted, 1 says not posted
Each figure counts the reviews that say so. Most reviews skip most topics.