Computational Number Theory

The branch of number theory concerned with designing, analyzing, and implementing algorithms to compute number-theoretic objects and properties, including exact integer arithmetic, primality testing, factorization, computations in finite fields and rings, and effective procedures for Diophantine problems.