A Course in Computational Algebraic Number Theory

Ranked #60 in Abstract Algebra

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... more

Similar Books

If you like A Course in Computational Algebraic Number Theory, check out these similar top-rated books:

Learn: What makes Shortform summaries the best in the world?