A Course In Computational Algebraic Number Theory

This book describes 148 algorithms which are fundamental for number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first seven chapters lead the reader to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations. The last three chapters give a survey of factoring and primality testing methods, including a detailed description of the number field sieve algorithm. The book ends with a description of available computer packages and some useful tables. The book also contains a large number of exercises. Written by an authority in the field, and one with great practical and teaching experience it is sure to become the standard and indispensable reference on the subject.