A Course in Computational Algebraic Number Theory

Front Cover
Springer-Verlag, 1993 - Mathematics - 534 pages
0 Reviews
One of the first of a new generation of books in mathematics that show the reader how to do large or complex computations using the power of computer algebra. It contains descriptions of 148 algorithms, which are fundamental for number theoretic calculations, in particular for computations related to algebraic number theory, elliptic curves, primality testing, lattices and factoring. For each subject there is a complete theoretical introduction. A detailed description of each algorithm is given allowing for immediate computer implementation. Many of the algorithms are new or appear for the first time in this book. A large number of exercises is also included.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.


Fundamental NumberTheoretic Algorithms
Algorithms for Linear Algebra and Lattices
Algorithms on Polynomials

11 other sections not shown

Other editions - View all

Common terms and phrases

About the author (1993)

Cohen, Universite de Bordeaux 1, Talence, France.

Bibliographic information