MODERN CRYPTOGRAPHY

Elements of modern cryptography, emphasizing mathematical underpinnings of public key systems and elliptic methods. Modern factorization methods, including Pollard’s algorithm and Lenstra’s elliptic curve approach. Background topics in number theory, abstract algebra, and projective geometry as needed.Prerequisite: (MT 301) or (MT 142 and CS 242). Offered: Not more than once every two years.