one two
Course CS 310 - 01
CRN 22297
Credit Hours 1
Description

When is a cryptographic system secure and how will we ever know? This course introduces the computational models and theory computer scientists use to address these issues. Topics include one-way functions, trapdoor functions, probabilistic complexity classes, pseudorandom generators, interactive proof systems, zero-knowledge proofs, and the application of these theories to modern cryptology.

Seats Available 16
Max. Enrollment 25
Permission of Instructor By permission of the instructor
Prerequisite(s) CS 231 or CS 235 or permission of the instructor.
Distributions Mathematical Modeling
Instructor(s) Randy Shull
Meeting Time(s) MTh - 11:10 am - 12:20 pm Loc: Science Center E111