MATH 523 - Cryptography and Computational Number Theory

Units: 3

Algorithms for factorization and primality testing: pseudo-primes, quadratic sieve, Lucas Test, continued fractions, factorization using elliptic curves, and public key cryptosystems such as RSA, which is widely used for secure transfer of data on the internet. Additional background material (such as the rudiments of elliptic curves) will be introduced as needed. Combines theoretical ideas with computer lab experimentation and implementation. Some familiarity with a computer language is useful but not required.

Prerequisite(s): For undergraduates and enrollment requirement For graduate students: MATH 350 or 370 with a grade of C (2.0) or better.