Arithmetic Algorithms

CS 812

Credits: 

3

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. Prereq: Math 541 and CS 367, or consent of instructor.

Subscribe to RSS - Arithmetic Algorithms