COM SCI 183: Introduction to Cryptography
Lecture, four hours; discussion, two hours; outside study, six hours. Preparation: knowledge of basic probability theory. Enforced requisite: course 180. Introduction to cryptography, computer security, and basic concepts and techniques. 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, key-agreement, homomorphic encryption, private information retrieval and voting protocols, message authentication, digital signatures, interactive proofs, zero-knowledge proofs, collision-resistant hash functions, commitment protocols, and two-party secure computation with static security. Letter grading.
Units unknown, upper division
Offered Spring quarters
- Predicted GPA
- 3.34
- A or A minus
- 48%
- D, F or withdrew
- 2%
- Sections
- Sections not published yet.
- By instructor
- Spring 2022 to Spring 2025
- All instructors
- 3.34 GPA
- 48% A
- 2% DFW
- 148 grades
- OSTROVSKY
- 3.34 GPA
- 48% A
- 2% DFW
- 148 grades
- Prerequisites
- Enforced requisite: course 180.
- Restrictions
- Not read yet
- Grading
- Not read yet
- Final exam
- Final time not published
What past students say
Read from 5 reviews, all instructors
No professor is listed for this term yet, so these count the reviews of every professor who has taught it.
- Recommend
- 3 recommend it, 1 advises against
- Teaching
- 1 says clear, 2 unclear
- Exams
- 1 says easy, 2 hard
- Past exams
- 1 says shared
- Curve
- 2 say curved
- Slides
- 2 say posted
Each figure counts the reviews that say so. Most reviews skip most topics.