Time estimates for arithmetic and elementary number theory algorithms (division algorithm, Euclidean algorithm, congruences), modular arithmetic, finite fields, quadratic residues. Design of simple cryptographic systems, public key and RSA systems. Primality and factoring: pseudoprimes, Pollard’s rho-method, index calculus. Elliptic curve cryptography. (18/0/0/9/9) Offered in Winter Term in even-numbered years PREREQUISITES: MATH 210 or MATH 212 or MTHE 217 (MATH 217) or MATH 211 with permission of the instructor
