The algorithmic number theory connects the classical number theory topics and the theory of computational complexity. In this course, we will study algorithms for finding integer solutions to certain equations, polynomial factorization, primality testing, and integer factorization. We will also study how the objects in question can be efficiently implemented on a computer. The algorithmic number theory problems are important for their mathematical interest and application to secure information exchange, such as RSA and elliptic curve cryptography.

For more information, visit the course webpage: https://users.metu.edu.tr/komer/781/