Journal ArticleOPEN ACCESS

Building curves with arbitrary small MOV degree over finite prime fields

Journal of Cryptology (2005) 18(2) 79-89
DOI: 10.1007/s00145-004-0219-7
41Citations
Citations of this article
45Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2004 International Association for Cryptologic Research.

Author supplied keywords

Cite

CITATION STYLE

APA

Dupont, R., Enge, A., & Morain, F. (2005). Building curves with arbitrary small MOV degree over finite prime fields. Journal of Cryptology, 18(2), 79–89. https://doi.org/10.1007/s00145-004-0219-7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free