The system will be going down for regular maintenance. Please save your work and logout.
Building curves with arbitrary small MOV degree over finite prime fields
DUPONT, Régis
Laboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX]
Algorithmic number theory for cryptology [TANC]
Laboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX]
Algorithmic number theory for cryptology [TANC]
ENGE, Andreas
Laboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX]
Algorithmic number theory for cryptology [TANC]
Laboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX]
Algorithmic number theory for cryptology [TANC]
MORAIN, François
Laboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX]
Algorithmic number theory for cryptology [TANC]
Laboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX]
Algorithmic number theory for cryptology [TANC]
DUPONT, Régis
Laboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX]
Algorithmic number theory for cryptology [TANC]
Laboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX]
Algorithmic number theory for cryptology [TANC]
ENGE, Andreas
Laboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX]
Algorithmic number theory for cryptology [TANC]
Laboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX]
Algorithmic number theory for cryptology [TANC]
MORAIN, François
Laboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX]
Algorithmic number theory for cryptology [TANC]
< Reduce
Laboratoire d'informatique de l'École polytechnique [Palaiseau] [LIX]
Algorithmic number theory for cryptology [TANC]
Language
en
Article de revue
This item was published in
Journal of Cryptology. 2005, vol. 18, n° 2, p. 79-89
Springer Verlag
English 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.
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.Read less <
English Keywords
elliptic curves over finite fields
MOV degree
complex multiplication
Origin
Hal imported