Computational Algebraic Number Theory

Michael E. Pohst (auth.)0817629130, 9780817629137, 3764329130

Computational algebraic number theory has been attracting broad interest in the last few years due to its potential applications in coding theory and cryptography. For this reason, the Deutsche Mathematiker Vereinigung initiated an introductory graduate seminar on this topic in Düsseldorf. The lectures given there by the author served as the basis for this book which allows fast access to the state of the art in this area. Special emphasis has been placed on practical algorithms – all developed in the last five years – for the computation of integral bases, the unit group and the class group of arbitrary algebraic number fields. Contents: Introduction • Topics from finite fields • Arithmetic and polynomials • Factorization of polynomials • Topics from the geometry of numbers • Hermite normal form • Lattices • Reduction • Enumeration of lattice points • Algebraic number fields • Introduction • Basic Arithmetic • Computation of an integral basis • Integral closure • Round-Two-Method • Round-Four-Method • Computation of the unit group • Dirichlet’s unit theorem and a regulator bound • Two methods for computing r independent units • Fundamental unit computation • Computation of the class group • Ideals and class number • A method for computing the class group • Appendix • The number field sieve • KANT • References • Index

---

Table of contents :
Front Matter….Pages i-ix
Introduction….Pages 1-3
Topics from finite fields….Pages 4-10
Topics from the geometry of numbers….Pages 11-26
Algebraic number fields….Pages 27-33
Computation of an integral basis….Pages 34-43
Computation of the unit group….Pages 44-60
Computation of the class group….Pages 61-75
Back Matter….Pages 76-90