Complex Multiplication Tests for Elliptic Curves
Number Theory
2007-05-23 v1
Abstract
We consider the problem of checking whether an elliptic curve defined over a given number field has complex multiplication. We study two polynomial time algorithms for this problem, one randomized and the other deterministic. The randomized algorithm can be adapted to yield the discriminant of the endomorphism ring of the curve.
Keywords
Cite
@article{arxiv.math/0409501,
title = {Complex Multiplication Tests for Elliptic Curves},
author = {Denis Charles},
journal= {arXiv preprint arXiv:math/0409501},
year = {2007}
}
Comments
13 pages, 2 tables, 1 appendix