Randy Shull

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.

CRN: 22297; Credit Hours: 1; Current Enrollment: 9; Seats Available: 16; Max Enrollment: 25;
Meeting Time(s): MTh - 11:10 am - 12:20 pm
Distributions: Mathematical Modeling
Prerequisites(s): CS 231 or CS 235 or permission of the instructor. Permission of Instructor: By permission of the instructor