Add to ORKGInternational audienceWe 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
Miyaji, Nakabayashi and Takano have recently suggested a construction of the so-called MNT elliptic ...
AbstractLet p be a fixed small prime. We give an algorithm with preprocessing to compute the j-invar...
In this thesis we give a brief introduction to arithmetics of prime fields. These are very attractiv...
International audienceWe present a fast algorithm for building ordinary elliptic curves over finite ...
We present a fast algorithm for building ordinary elliptic curves over finite prime fields having ar...
We present a fast algorithm for building ordinary elliptic curves over finite prime fields having ar...
Abstract. A variation of the Complex Multiplication (CM) method for generating elliptic curves of kn...
Abstract. A variation of the Complex Multiplication (CM) method for generating elliptic curves of kn...
This thesis describes a procedure (the `CM method'), based on the theory of complex multiplication, ...
The subject of the thesis at hand is the description of an efficient algorithm for finding an ellipt...
Abstract. We consider the generation of prime-order elliptic curves (ECs) over a prime field Fp usin...
AbstractWe consider curves defined over small finite fields with points of large prime order over an...
We study and improve the CM-method for the creation of elliptic curves with specified group order ov...
We study and improve the CM-method for the creation of elliptic curves with specified group order ov...
We describe an algorithm for determining elliptic curves defined over a given number field with a gi...
Miyaji, Nakabayashi and Takano have recently suggested a construction of the so-called MNT elliptic ...
AbstractLet p be a fixed small prime. We give an algorithm with preprocessing to compute the j-invar...
In this thesis we give a brief introduction to arithmetics of prime fields. These are very attractiv...
International audienceWe present a fast algorithm for building ordinary elliptic curves over finite ...
We present a fast algorithm for building ordinary elliptic curves over finite prime fields having ar...
We present a fast algorithm for building ordinary elliptic curves over finite prime fields having ar...
Abstract. A variation of the Complex Multiplication (CM) method for generating elliptic curves of kn...
Abstract. A variation of the Complex Multiplication (CM) method for generating elliptic curves of kn...
This thesis describes a procedure (the `CM method'), based on the theory of complex multiplication, ...
The subject of the thesis at hand is the description of an efficient algorithm for finding an ellipt...
Abstract. We consider the generation of prime-order elliptic curves (ECs) over a prime field Fp usin...
AbstractWe consider curves defined over small finite fields with points of large prime order over an...
We study and improve the CM-method for the creation of elliptic curves with specified group order ov...
We study and improve the CM-method for the creation of elliptic curves with specified group order ov...
We describe an algorithm for determining elliptic curves defined over a given number field with a gi...
Miyaji, Nakabayashi and Takano have recently suggested a construction of the so-called MNT elliptic ...
AbstractLet p be a fixed small prime. We give an algorithm with preprocessing to compute the j-invar...
In this thesis we give a brief introduction to arithmetics of prime fields. These are very attractiv...