A Course in Computational Algebraic Number Theory
By Henri Cohen
1993
First Published
4.26
Average Rating
557
Number of Pages
Part of Series
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.
Avg Rating
4.26
Number of Ratings
19
5 STARS
58%
4 STARS
21%
3 STARS
11%
2 STARS
11%
1 STARS
0%
goodreads
