Course Information
Course Slot: A (Mon 9:00-10:00, Wed 11:00-12:00, Thu 10:00-11:00)
Classroom: A-117
List of topics:
Euclid's algorithm, Bezout's lemma, prime numbers, fundamental theorem of arithmetic, congruences,
Fermat's little theorem, the rings Z
n and Z
p, Lagrange's theorem, roots of unity,
quadratic residues, quadratic equations in Z
p, finite fields, applications of finite fields,
univariate polynomial factorization in Z
p, linear equations over Z, polynomial factorization over Z, primality testing,
integer factoring, binary quadratic forms.
References:
1. This Course Notes:
Computational Number Theory
2. Victor Shoup:
A computational introduction to number theory and algebra
3. Neal Koblitz: A course in number theory and cryptography
4. Crandall and Pomerance: Prime numbers - A computational perspective
Other recommended books on Number Theory:
4. The Higher Arithmetic by Henry Davenport,
5. A Concise Introduction to the Theory of Numbers by Alan Baker,
6. An Introduction to the Theory of Numbers by Hardy and Wright
7. A course in number theory by H.E. Rose