PMAT 527 - Computational Number Theory - Fall 2010

An investigation of major problems in computational number theory, with emphasis on practical techniques and their computational complexity. Topics include basic integer arithmetic algorithms, finite fields, primality proving, factoring methods, algorithms in algebraic number fields. Prerequisite(s): Pure Mathematics 427 or 429.
This course may not be repeated for credit.