Discrete Mathematics of Cryptography (MA503)

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, the Chinese remainder theorem; 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 CS668. Recommended for high-level undergraduate students. Prerequisites: MA502