A description of 148 algorithms fundamental to number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first seven chapters guide readers 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, while the last three chapters survey factoring and primality testing methods, including a detailed description of the number field sieve algorithm. The whole is rounded off with a description of available computer packages and some useful tables, backed by numerous exercises. Written by an authority in the field, and one with great practical and teaching experience, this is certain to become the standard and indispensable reference on the subject.

Written by an authority with great practical and teaching experience in the field, this book addresses a number of topics in computational number theory. Chapters one through five form a homogenous subject matter suitable for a six-month or year-long course in computational number theory. The subsequent chapters deal with more miscellaneous subjects.

Now in paperback, this classic book is addresssed to all lovers of number theory. On the one hand, it gives a comprehensive introduction to constructive algebraic number theory, and is therefore especially suited as a textbook for a course on that subject. On the other hand many parts go beyond an introduction an make the user familliar with recent research in the field. For experimental number theoreticians new methods are developed and new results are obtained which are of great importance for them. Both computer scientists interested in higher arithmetic and those teaching algebraic number theory will find the book of value.

Developed from the author's popular graduate-level course, Computational Number Theory presents a complete treatment of number-theoretic algorithms. Avoiding advanced algebra, this self-contained text is designed for advanced undergraduate and beginning graduate students in engineering. It is also suitable for researchers new to the field and pract

The problems are systematically arranged to reveal the evolution of concepts and ideas of the subject Includes various levels of problems - some are easy and straightforward, while others are more challenging All problems are elegantly solved

First published in 1979 and written by two distinguished mathematicians with a special gift for exposition, this book is now available in a completely revised third edition. It reflects the exciting developments in number theory during the past two decades that culminated in the proof of Fermat's Last Theorem. Intended as a upper level textbook, it

This text for a graduate-level course covers the general theory of factorization of ideals in Dedekind domains as well as the number field case. It illustrates the use of Kummer's theorem, proofs of the Dirichlet unit theorem, and Minkowski bounds on element and ideal norms. 2003 edition.

Broad graduate-level account of Algebraic Number Theory, first published in 2001, including exercises, by a world-renowned author.

Requiring no more than a basic knowledge of abstract algebra, this text presents the mathematics of number fields in a straightforward, pedestrian manner. It therefore avoids local methods and presents proofs in a way that highlights the important parts of the arguments. Readers are assumed to be able to fill in the details, which in many places are left as exercises.

A quick guide to computing in algebraic geometry with many explicit computational examples introducing the computer algebra system Singular.