Javascript must be enabled to continue!
Almost prime values of the order of elliptic curves over finite fields
View through CrossRef
Abstract.
Let
E
$E$
be an elliptic curve over
${\mathbb {Q}}$
without complex
multiplication. For each prime
p
$p$
of good reduction,
let
|
E
(
p
)
|
$|E({\mathbb {F}}_p)|$
be the order of the group of points of the reduced
curve over
p
${\mathbb {F}}_p$
. According to a conjecture of Koblitz, there
should be infinitely many such primes
p
$p$
such that
|
E
(
p
)
|
$|E({\mathbb {F}}_p)|$
is prime,
unless there are some local obstructions predicted by the conjecture.
Suppose that
E
$E$
is a curve without local obstructions (which is
the case for most elliptic curves over
${\mathbb {Q}}$
).
We prove in this paper that, under the GRH, there
are at least
2
.
778
C
E
twin
x
/
(
log
x
)
2
$2.778 C_E^{\rm twin} x / (\log x)^2$
primes
p
$p$
such
that
|
E
(
p
)
|
$|E({\mathbb {F}}_p)|$
has at most 8 prime factors, counted with
multiplicity. This improves previous results of Steuding & Weng
[20, 21] and Miri & Murty [15]. This is also the first
result where the dependence on the conjectural constant
C
E
twin
$C_E^{\rm twin}$
appearing in Koblitz's conjecture (also called the twin prime conjecture for elliptic curves) is made explicit. This is
achieved by sieving a slightly different sequence than the one of
[20] and [15]. By sieving the same sequence and using
Selberg's linear sieve, we can also improve the constant of Zywina [24]
appearing in the upper bound for the number of primes
p
$p$
such that
|
E
(
p
)
|
$|E({\mathbb {F}}_p)|$
is prime.
Finally, we remark that our results still hold
under an hypothesis weaker than the GRH.
Title: Almost prime values of the order of elliptic curves over finite fields
Description:
Abstract.
Let
E
$E$
be an elliptic curve over
${\mathbb {Q}}$
without complex
multiplication.
For each prime
p
$p$
of good reduction,
let
|
E
(
p
)
|
$|E({\mathbb {F}}_p)|$
be the order of the group of points of the reduced
curve over
p
${\mathbb {F}}_p$
.
According to a conjecture of Koblitz, there
should be infinitely many such primes
p
$p$
such that
|
E
(
p
)
|
$|E({\mathbb {F}}_p)|$
is prime,
unless there are some local obstructions predicted by the conjecture.
Suppose that
E
$E$
is a curve without local obstructions (which is
the case for most elliptic curves over
${\mathbb {Q}}$
).
We prove in this paper that, under the GRH, there
are at least
2
.
778
C
E
twin
x
/
(
log
x
)
2
$2.
778 C_E^{\rm twin} x / (\log x)^2$
primes
p
$p$
such
that
|
E
(
p
)
|
$|E({\mathbb {F}}_p)|$
has at most 8 prime factors, counted with
multiplicity.
This improves previous results of Steuding & Weng
[20, 21] and Miri & Murty [15].
This is also the first
result where the dependence on the conjectural constant
C
E
twin
$C_E^{\rm twin}$
appearing in Koblitz's conjecture (also called the twin prime conjecture for elliptic curves) is made explicit.
This is
achieved by sieving a slightly different sequence than the one of
[20] and [15].
By sieving the same sequence and using
Selberg's linear sieve, we can also improve the constant of Zywina [24]
appearing in the upper bound for the number of primes
p
$p$
such that
|
E
(
p
)
|
$|E({\mathbb {F}}_p)|$
is prime.
Finally, we remark that our results still hold
under an hypothesis weaker than the GRH.
Related Results
Large families of elliptic curves ordered by conductor
Large families of elliptic curves ordered by conductor
In this paper we study the family of elliptic curves $E/{{\mathbb {Q}}}$, having good reduction at $2$ and $3$, and whose $j$-invariants are small. Within this set of elliptic curv...
Enhanced Scalar Multiplication Algorithm over Prime Field Using Elliptic Net
Enhanced Scalar Multiplication Algorithm over Prime Field Using Elliptic Net
Scalar multiplication in elliptic curve cryptography is the most expensive and time-consuming operation. The elliptic curve cryptography attracted interest due to the development o...
The Canberra Bubble
The Canberra Bubble
According to the ABC television program Four Corners, “Parliament House in Canberra is a hotbed of political intrigue and high tension … . It’s known as the ‘Canberra Bubble’ and i...
Računalno potpomognuto usmjeravanje kod dvojezičnih govornika
Računalno potpomognuto usmjeravanje kod dvojezičnih govornika
This thesis investigates whether modern computer models can confirm how people encounter words and then use these findings in didactics. In recent years, computers have been used i...
Elliptic curves over a nonlocal ring ????2d[????],????2 = ????
Elliptic curves over a nonlocal ring ????2d[????],????2 = ????
In this work, we came to present the elliptic curves over a nonlocal ring [Formula: see text] where [Formula: see text] is a finite field of characteristic 2, and [Formula: see tex...
Supplementary Data from Targeted BiTE Expression by an Oncolytic Vector Augments Therapeutic Efficacy Against Solid Tumors
Supplementary Data from Targeted BiTE Expression by an Oncolytic Vector Augments Therapeutic Efficacy Against Solid Tumors
<p>Supplementary Methods, Supplementary Figures S1-S15 Fig. S1. Purification and binding specificity of MV-encoded BiTEs. (A) Purification of MV-expressed BiTEs. Vero cells w...
Type Curves For McKinley Analysis Of Drill-Stem Test Data
Type Curves For McKinley Analysis Of Drill-Stem Test Data
Abstract
McKinley-type curves that include the effects of short production times (i.e., less than 120 minutes) have been developed for pressure buildup test analy...
Elliptic curves with full 2-torsion and maximal adelic Galois representations
Elliptic curves with full 2-torsion and maximal adelic Galois representations
In 1972, Serre showed that the adelic Galois representation associated to a non-CM elliptic curve over a number field has open image in
G
...

