COM SCI M282A · CS M282ACryptography
Computer Science · 4 units · Graduate courses (200-299)
(Same as Mathematics M209A.) 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.
When it runs
- Fall 2025
- Fall 2026
Scheduled, not typical — from UCLA’s Schedule of Classes, which publishes Fall 2025 through Spring 2027 and nothing before it.
Requisites
UCLA lists no requisites for this course.
Requires
Everything that has to come before this course, not just the courses named in the requisite above.
Nothing — this is an entry point.
Unlocks
What this course is a requisite for, and what those courses lead to in turn.
COM SCI M282A
- COM SCI M282BCryptographic Protocols
1 course lists this as a requisite. The whole downstream is here — 1 course over 1 level. Every course here opens its own tree.