CS 503 Discrete Mathematics for Cryptography

Topics include basic discrete probability, including urn models and random mappings; a brief introduction to information theory; elements of number theory, including the prime number theorem, the Euler phi function, the Euclidean algorithm, and the Chinese remainder theorem; and elements of abstract algebra and finite fields including basic fundamentals of groups, rings, polynomial rings, vector spaces, and finite fields. Carries credit toward the Applied Mathematics degree only when followed by CS 579. Recommended for high-level undergraduate students.



Cross Listed Courses

MA 503


(CS 135 or MA 134 or MA 502) and (Grad Student or (Junior or Senior))


Computer Science Program Pure and Applied Mathematics Program

Typically Offered Periods

Fall Semester Spring Semester Summer Session 1