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, RSA systems. Primality and factoring: pseudoprimes, Pollard's rho-method, index calculus. Elliptic curve cryptography. Offered jointly with MATH-418. Three term hours, fall or winter; lectures.
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, RSA systems. Primality and factoring: pseudoprimes, Pollard's rho-method, index calculus. Elliptic curve cryptography. Offered jointly with MATH-418. Three term hours, fall or winter; lectures.
