scholarly journals THE AVERAGE NUMBER OF SUBGROUPS OF ELLIPTIC CURVES OVER FINITE FIELDS

2020 ◽  
Vol 71 (3) ◽  
pp. 781-822
Author(s):  
Corentin Perret-Gentil
Keyword(s):  
Finite Field ◽  
Elliptic Curves ◽  
Finite Fields ◽  
Short Interval ◽  
Divisor Function ◽  
Finite Abelian Groups ◽  
Cyclic Subgroups ◽  
Number Of Divisors ◽  
Curves Over Finite Fields ◽  
Euler Products

Abstract By adapting the technique of David, Koukoulopoulos and Smith for computing sums of Euler products, and using their interpretation of results of Schoof à la Gekeler, we determine the average number of subgroups (or cyclic subgroups) of an elliptic curve over a fixed finite field of prime size. This is in line with previous works computing the average number of (cyclic) subgroups of finite abelian groups of rank at most $2$. A required input is a good estimate for the divisor function in both short interval and arithmetic progressions, that we obtain by combining ideas of Ivić–Zhai and Blomer. With the same tools, an asymptotic for the average of the number of divisors of the number of rational points could also be given.

scholarly journals Constructing Isogenies between Elliptic Curves Over Finite Fields

1999 ◽  
Vol 2 ◽  
pp. 118-138 ◽  
Author(s):  
Steven D. Galbraith
Keyword(s):  
Finite Field ◽  
Elliptic Curves ◽  
Finite Fields ◽  
Endomorphism Ring ◽  
Elliptic Curve Cryptography ◽  
Class Number ◽  
Probabilistic Algorithm ◽  
Worst Case ◽  
Curves Over Finite Fields ◽  
Exponential Complexity

AbstractLet E1 and E2 be ordinary elliptic curves over a finite field Fp such that #E1(Fp) = #E2(Fp). Tate's isogeny theorem states that there is an isogeny from E1 to E2 which is defined over Fp. The goal of this paper is to describe a probabilistic algorithm for constructing such an isogeny.The algorithm proposed in this paper has exponential complexity in the worst case. Nevertheless, it is efficient in certain situations (that is, when the class number of the endomorphism ring is small). The significance of these results to elliptic curve cryptography is discussed.

QUOTIENTS OF ELLIPTIC CURVES OVER FINITE FIELDS

2013 ◽  
Vol 09 (06) ◽  
pp. 1395-1412
Author(s):  
JEFFREY D. ACHTER ◽  
SIMAN WONG
Keyword(s):  
Finite Field ◽  
Elliptic Curves ◽  
Finite Fields ◽  
Rational Point ◽  
Asymptotic Density ◽  
Curves Over Finite Fields

Fix a prime ℓ, and let 𝔽q be a finite field with q ≡ 1 (mod ℓ) elements. If ℓ > 2 and q ≫ℓ 1, we show that asymptotically (ℓ - 1)2/2ℓ2 of the elliptic curves E/𝔽q with complete rational ℓ-torsion are such that E/〈P〉 does not have complete rational ℓ-torsion for any point P ∈ E(𝔽q) of order ℓ. For ℓ = 2 the asymptotic density is 0 or 1/4, depending whether q ≡ 1 (mod 4) or 3 (mod 4). We also show that for any ℓ, if E/𝔽q has an 𝔽q-rational point R of order ℓ2, then E/〈ℓR〉 always has complete rational ℓ-torsion.

scholarly journals ON THE MERTENS CONJECTURE FOR ELLIPTIC CURVES OVER FINITE FIELDS

2013 ◽  
Vol 89 (1) ◽  
pp. 19-32
Author(s):  
PETER HUMPHRIES
Keyword(s):  
Finite Field ◽  
Elliptic Curves ◽  
Finite Fields ◽  
Frobenius Endomorphism ◽  
Curves Over Finite Fields

AbstractWe introduce an analogue of the Mertens conjecture for elliptic curves over finite fields. Using a result of Waterhouse, we classify the isogeny classes of elliptic curves for which this conjecture holds in terms of the size of the finite field and the trace of the Frobenius endomorphism acting on the curve.

scholarly journals Finding the group structure of elliptic curves over finite fields

2005 ◽  
Vol 72 (2) ◽  
pp. 251-263 ◽  
Author(s):  
John B. Friedlander ◽  
Carl Pomerance ◽  
Igor E. Shparlinski
Keyword(s):  
Finite Field ◽  
Elliptic Curve ◽  
Elliptic Curves ◽  
Finite Fields ◽  
Polynomial Time ◽  
Group Structure ◽  
Curves Over Finite Fields ◽  
Divisor Sums ◽  
Almost All ◽  
Probabilistic Polynomial Time

We show that an algorithm of V. Miller to compute the group structure of an elliptic curve over a prime finite field runs in probabilistic polynomial time for almost all curves over the field. Important to our proof are estimates for some divisor sums.

scholarly journals On a density problem for elliptic curves over finite fields

2000 ◽  
Vol 4 (4) ◽  
pp. 737-756 ◽  
Author(s):  
Yen-Mei J. Chen ◽  
Jing Yu
Keyword(s):  
Elliptic Curves ◽  
Finite Fields ◽  
Curves Over Finite Fields ◽  
Density Problem

scholarly journals The characterization of elliptic curves over finite fields

1988 ◽  
Vol 45 (2) ◽  
pp. 275-286 ◽  
Author(s):  
J. W. P. Hirschfeld ◽  
J. F. Voloch
Keyword(s):  
Elliptic Curves ◽  
Finite Fields ◽  
Sufficient Conditions ◽  
Maximum Size ◽  
Desarguesian Plane ◽  
Cubic Curve ◽  
Odd Order ◽  
Even Order ◽  
Curves Over Finite Fields

AbstractIn a finite Desarguesian plane of odd order, it was shown by Segre thirty years ago that a set of maximum size with at most two points on a line is a conic. Here, in a plane of odd or even order, sufficient conditions are given for a set with at most three points on a line to be a cubic curve. The case of an elliptic curve is of particular interest.

Sign in / Sign up

Export Citation Format

Share Document