Syllabus
Simple algorithms for factorization of integers. Subexponential algorithms, CFRAC and Quadratic Sieve.
Lenstra's method based on arithmetics of elliptic curves. Connection between factorization problem for integers and the discrete logarithm problem.
Annotation
The course is an introduction to methods for integer factorization, in particular, factoring algorithms with subexponential time complexity are presented.
The student gets enough details for basic implementation of these algorithms.