Building curves with arbitrary small MOV degree over finite prime fields

Régis Dupont; Andreas Enge; François Morain

doi:10.1007/s00145-004-0219-7

Building curves with arbitrary small MOV degree over finite prime fields

Régis Dupont
, Andreas Enge
, François Morain

Laboratoire d'Informatique (LIX)

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	79-89
Number of pages	11
Journal	Journal of Cryptology
Volume	18
Issue number	2
DOIs	https://doi.org/10.1007/s00145-004-0219-7
Publication status	Published - 1 Apr 2005

Keywords

Complex multiplication
Elliptic curves over finite fields
MOV degree

Access to Document

10.1007/s00145-004-0219-7

Cite this

@article{7f437a3b232746548537b3b97e406995,

title = "Building curves with arbitrary small MOV degree over finite prime fields",

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.",

keywords = "Complex multiplication, Elliptic curves over finite fields, MOV degree",

author = "R{\'e}gis Dupont and Andreas Enge and Fran{\c c}ois Morain",

year = "2005",

month = apr,

day = "1",

doi = "10.1007/s00145-004-0219-7",

language = "English",

volume = "18",

pages = "79--89",

journal = "Journal of Cryptology",

issn = "0933-2790",

number = "2",

}

TY - JOUR

T1 - Building curves with arbitrary small MOV degree over finite prime fields

AU - Dupont, Régis

AU - Enge, Andreas

AU - Morain, François

PY - 2005/4/1

Y1 - 2005/4/1

N2 - 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.

AB - 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.

KW - Complex multiplication

KW - Elliptic curves over finite fields

KW - MOV degree

UR - https://www.scopus.com/pages/publications/17444391606

U2 - 10.1007/s00145-004-0219-7

DO - 10.1007/s00145-004-0219-7

M3 - Article

AN - SCOPUS:17444391606

SN - 0933-2790

VL - 18

SP - 79

EP - 89

JO - Journal of Cryptology

JF - Journal of Cryptology

IS - 2

ER -

Building curves with arbitrary small MOV degree over finite prime fields

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this