MATH 3CY3, Fall 2018
What could be more romantic than secret writing? Once you write the alphabet as numbers (nothing secret about this step) encryption is done by a bijection from the set of sequences of numbers of a given length to itself. What makes a public key encryption system possible is that the function should be easy to compute but its inverse is hard to compute. Finding such functions involves beautiful ideas in number theory. This course is about learning and applying those ideas.
INSTRUCTOR: B. Hart
Introduction to cryptosystems used in modern security systems: elementary number theory, primality testing and factorization, discrete logarithm, SRA cryptosystems, elliptic curve cryptosystems.
Three lectures; one term
Prerequisite(s): MATH 2R03
PLEASE REFER TO MOSAIC FOR THE MOST UP-TO-DATE INFORMATION ON TIMES AND ROOMS