Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



Constructing elliptic curves over finite fields with prescribed torsion

Author: Andrew V. Sutherland
Journal: Math. Comp. 81 (2012), 1131-1147
MSC (2010): Primary 11G05, 11G07; Secondary 11-04, 14H10
Published electronically: August 4, 2011
MathSciNet review: 2869053
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: We present a method for constructing optimized equations for the modular curve $ X_1(N)$ using a local search algorithm on a suitably defined graph of birationally equivalent plane curves. We then apply these equations over a finite field $ \mathbb{F}_q$ to efficiently generate elliptic curves with nontrivial $ N$-torsion by searching for affine points on $ X_1(N)(\mathbb{F}_q)$, and we give a fast method for generating curves with (or without) a point of order $ 4N$ using $ X_1(2N)$.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC (2010): 11G05, 11G07, 11-04, 14H10

Retrieve articles in all journals with MSC (2010): 11G05, 11G07, 11-04, 14H10

Additional Information

Andrew V. Sutherland
Affiliation: Department of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139

Received by editor(s): September 21, 2010
Received by editor(s) in revised form: February 20, 2011
Published electronically: August 4, 2011
Article copyright: © Copyright 2011 American Mathematical Society
The copyright for this article reverts to public domain 28 years after publication.