Complex Multiplication Tests for Elliptic Curves

Simple item page
dc.creatorCharles, Denis
dc.date2004-09-26
dc.date.accessioned2026-07-07T05:12:35Z
dc.date.available2026-07-07T05:12:35Z
dc.descriptionWe 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.
dc.description13 pages, 2 tables, 1 appendix
dc.identifierhttps://arxiv.org/abs/math/0409501
dc.identifierhttp://arxiv.org/abs/math/0409501
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/72630
dc.subjectNumber Theory
dc.subject11G05; 11G15
dc.titleComplex Multiplication Tests for Elliptic Curves
dc.typetext

Files

Collections

arXiv