MATH495H

Public key cryptography is at the center of most secure transactions these days, from using a credit card online to sending and signing secure messages. The security of a cryptosystem relies on finding solutions to difficult math problems like factorization of large numbers and the discrete logarithm problem. After an introduction to the basics, each student studies various methods of encryption like the RSA cryptosystem, the Diffie-Hellman key exchange, Elliptic Curve Cryptography, and various methods of breaking these encryptions. These topics draw from previous knowledge in abstract algebra, analysis, geometry, and number theory. Computer algebra systems also are used to illustrate the applications. Prerequisite(s): MATH 301 or 309.