Add to ORKGWe prove the analog of Koblitz conjecture when replacing primes by almost prime numbers and considering elliptic curves with complex multiplication. In other words for infinitely many primes $p$, (given in a quantitative way describe in the paper), the reduction of an elliptic curve $E$ with complex multiplication has order of size an almost prime number
Given an elliptic curve E over ℚ we estimate the number of primes p≤T for which the number of points...
In most algorithms involving elliptic curves, the most expensive part consists in computing multiple...
AbstractWe give explicit formulas for the number of points on reductions of elliptic curves with com...
We prove the analog of Koblitz conjecture when replacing primes by almost prime numbers and conside...
International audienceLet E be an elliptic curve over Q without complex multiplication. For each pri...
Abstract. Let E be an elliptic curve over Q without complex multiplication, and which is not isogeno...
Abstract. A variation of the Complex Multiplication (CM) method for generating elliptic curves of kn...
Abstract. Let E be an elliptic curve over the rationals. In 1988, Koblitz conjectured an asymp-totic...
AbstractWe consider curves defined over small finite fields with points of large prime order over an...
The orders of the reductions of a point in the Mordell–Weil group of an elliptic curve by J. Cheon a...
We consider elliptic curves without complex multiplication defined over the rationals or with comple...
We give bounds on the primes of geometric bad reduction for curves of genus 3 of primitive complex m...
Abstract. We consider the generation of prime-order elliptic curves (ECs) over a prime field Fp usin...
Given an elliptic curve E and a positive integer N, we consider the problem of counting the number o...
We study and improve the CM-method for the creation of elliptic curves with specified group order ov...
Given an elliptic curve E over ℚ we estimate the number of primes p≤T for which the number of points...
In most algorithms involving elliptic curves, the most expensive part consists in computing multiple...
AbstractWe give explicit formulas for the number of points on reductions of elliptic curves with com...
We prove the analog of Koblitz conjecture when replacing primes by almost prime numbers and conside...
International audienceLet E be an elliptic curve over Q without complex multiplication. For each pri...
Abstract. Let E be an elliptic curve over Q without complex multiplication, and which is not isogeno...
Abstract. A variation of the Complex Multiplication (CM) method for generating elliptic curves of kn...
Abstract. Let E be an elliptic curve over the rationals. In 1988, Koblitz conjectured an asymp-totic...
AbstractWe consider curves defined over small finite fields with points of large prime order over an...
The orders of the reductions of a point in the Mordell–Weil group of an elliptic curve by J. Cheon a...
We consider elliptic curves without complex multiplication defined over the rationals or with comple...
We give bounds on the primes of geometric bad reduction for curves of genus 3 of primitive complex m...
Abstract. We consider the generation of prime-order elliptic curves (ECs) over a prime field Fp usin...
Given an elliptic curve E and a positive integer N, we consider the problem of counting the number o...
We study and improve the CM-method for the creation of elliptic curves with specified group order ov...
Given an elliptic curve E over ℚ we estimate the number of primes p≤T for which the number of points...
In most algorithms involving elliptic curves, the most expensive part consists in computing multiple...
AbstractWe give explicit formulas for the number of points on reductions of elliptic curves with com...