ARITHMETIC ALGORITHMS

3 credits.

Survey of algorithms and design paradigms for exact arithmetic, as used in public-key cryptography, computer algebra, and pseudo-random number generation. Topics include primality testing, factorization of integers and polynomials, discrete logarithms, and (optionally) elliptic curves and integer lattices. Students are strongly encourage to have knowledge of basic abstract algebra (e.g., MATH 541 ), and intermediate programming ability (e.g., COMP SCI 367 or COMP SCI 300 ).