Abstract
We present a fast algorithm for building ordinary elliptic curves over finite prime fields having arbitrary small MOV degree. The elliptic curves are obtained using complex multiplication by any desired discriminant.
Article PDF
Similar content being viewed by others
Use our pre-submission checklist
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Dupont, R., Enge, A. & Morain, F. Building Curves with Arbitrary Small MOV Degree over Finite Prime Fields. J Cryptology 18, 79–89 (2005). https://doi.org/10.1007/s00145-004-0219-7
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00145-004-0219-7