We present a variation on the CM method that produces elliptic curves over prime fields with nearly prime order that do not admit many efficiently computable isogenies. Assuming the Bateman–Horn conjecture, we prove that elliptic curves produced this way almost always have a large embedding degree, and thus are resistant to the MOV attack on the ECDLP
Nowadays the generation of cryptosystems requires two main aspects. First the security, and then th...
Nowadays the generation of cryptosystems requires two main aspects. First the security, and then the...
Elliptic curve cryptography has received more and more attention from the security industry over the...
We present a variation on the CM method that produces elliptic curves over prime fields with nearly ...
Thesis (Ph.D.)--University of Washington, 2018An elliptic curve $E$ over a finite field $\FF_q$ is c...
Thesis (Ph.D.)--University of Washington, 2018An elliptic curve $E$ over a finite field $\FF_q$ is c...
We give an upper bound on the number of finite fields over which elliptic curves of cryptographic in...
Given an elliptic curve E over ℚ we estimate the number of primes p≤T for which the number of points...
Miyaji, Nakabayashi and Takano have recently suggested a construction of the so-called MNT elliptic ...
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...
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...
Abstract. In their seminal paper, Miyaji, Nakabayashi and Takano [12] describe a simple method for t...
The purpose of this paper is to generate cryptographically strong elliptic curves over prime fields ...
Nowadays the generation of cryptosystems requires two main aspects. First the security, and then th...
Nowadays the generation of cryptosystems requires two main aspects. First the security, and then the...
Elliptic curve cryptography has received more and more attention from the security industry over the...
We present a variation on the CM method that produces elliptic curves over prime fields with nearly ...
Thesis (Ph.D.)--University of Washington, 2018An elliptic curve $E$ over a finite field $\FF_q$ is c...
Thesis (Ph.D.)--University of Washington, 2018An elliptic curve $E$ over a finite field $\FF_q$ is c...
We give an upper bound on the number of finite fields over which elliptic curves of cryptographic in...
Given an elliptic curve E over ℚ we estimate the number of primes p≤T for which the number of points...
Miyaji, Nakabayashi and Takano have recently suggested a construction of the so-called MNT elliptic ...
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...
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...
Abstract. In their seminal paper, Miyaji, Nakabayashi and Takano [12] describe a simple method for t...
The purpose of this paper is to generate cryptographically strong elliptic curves over prime fields ...
Nowadays the generation of cryptosystems requires two main aspects. First the security, and then th...
Nowadays the generation of cryptosystems requires two main aspects. First the security, and then the...
Elliptic curve cryptography has received more and more attention from the security industry over the...
DOI
Add to ORKG