A Course in Computational Algebraic Number Theory (Graduate Texts in Mathematics Vol. 138)
From Book News, Inc. Describes 148 algorithms that are fundamental for number-theoretic computations including computations related to algebraic number theory, elliptic curves, primality testing, and factoring. A complete theoretical introduction is given for each subject, reducing prerequisites to a minimum. The detailed description of each algorithm allows immediate computer implementation; numerous further hints for implementation are also provided. Many of the algorithms have never been published or appear for the first time in book form. Annotation copyright Book News, Inc. Portland, Or.
Kurzbeschreibung 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...