Constructing elliptic curves of prime order
Broker, Reinier ; Stevenhagen, Peter
arXiv, 0712.2022 / Harvested from arXiv
Text on arXiv
We present a very efficient algorithm to construct an elliptic curve E and a finite field F such that the order of the point group E(F) is a given prime number N. Heuristically, this algorithm only takes polynomial time Otilde((\log N)^3), and it is so fast that it may profitably be used to tackle the related problem of finding elliptic curves with point groups of prime order of prescribed size. We also discuss the impact of the use of high level modular functions to reduce the run time by large constant factors and show that recent gonality bounds for modular curves imply limits on the time reduction that can be obtained.
Publié le : 2007-12-12
Classification:  Mathematics - Number Theory,  Mathematics - Algebraic Geometry,  14H52, 11G15 
@article{0712.2022,
     author = {Broker, Reinier and Stevenhagen, Peter},
     title = {Constructing elliptic curves of prime order},
     journal = {arXiv},
     volume = {2007},
     number = {0},
     year = {2007},
     language = {en},
     url = {http://dml.mathdoc.fr/item/0712.2022}
}

Broker, Reinier; Stevenhagen, Peter. Constructing elliptic curves of prime order. arXiv, Tome 2007 (2007) no. 0, . http://gdmltest.u-ga.fr/item/0712.2022/