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}
}
  • H. Cohen
  • Published in Graduate texts in mathematics 1993
  • Computer Science, Mathematics
  • 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
    2,603 Citations
    Computational techniques in quadratic fields
    • 8
    • PDF
    Algebraic Number Fields
    Approximate computations with modular curves
    • PDF
    Sieving Methods for Class Group Computation
    • 9
    Research Statement and Plan
    • Highly Influenced
    On units related to the arithmetic of elliptic curves with complex multiplication
    • 1
    • PDF
    Computational Number Theory in Relation with L-Functions
    • PDF
    Algorithmic Factorization of Polynomials over Number Fields
    • Highly Influenced

    References

    SHOWING 1-10 OF 228 REFERENCES
    Algebraic factoring and rational function integration
    • 195
    • PDF
    Factoring integers with elliptic curves
    • 1,009
    • PDF
    Theorems on factorization and primality testing
    • 373
    Factoring polynomials over large finite fields*
    • 202
    • PDF
    On a Theorem of Ore
    • 36