A course in computational algebraic number theory
@inproceedings{Cohen1993ACI, title={A course in computational algebraic number theory}, author={H. Cohen}, booktitle={Graduate texts in mathematics}, year={1993} }
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… CONTINUE READING
Topics from this paper
2,603 Citations
Computability in principle and in practice in algebraic number theory: Hensel to Zassenhaus
- Mathematics
- 2012
- PDF
Sieving Methods for Class Group Computation
- Computer Science
- Algorithmic Algebra and Number Theory
- 1997
- 9
Elliptic and modular curves over finite fields and related computational issues
- Mathematics
- 1997
- 207
- PDF
References
SHOWING 1-10 OF 228 REFERENCES
Algebraic factoring and rational function integration
- Mathematics, Computer Science
- SYMSAC '76
- 1976
- 195
- PDF