scholarly journals Finding elliptic curves with a subgroup of prescribed size

2016 ◽  
Vol 13 (01) ◽  
pp. 133-152
Author(s):  
Igor E. Shparlinski ◽  
Andrew V. Sutherland
Keyword(s):  
Positive Integer ◽  
Finite Field ◽  
Elliptic Curve ◽  
Elliptic Curves ◽  
Riemann Hypothesis ◽  
Time Complexity ◽  
Rational Functions ◽  
Deterministic Algorithm ◽  
Probabilistic Algorithm ◽  
Almost All

Assuming the Generalized Riemann Hypothesis, we design a deterministic algorithm that, given a prime [Formula: see text] and positive integer [Formula: see text], outputs an elliptic curve [Formula: see text] over the finite field [Formula: see text] for which the cardinality of [Formula: see text] is divisible by [Formula: see text]. The running time of the algorithm is [Formula: see text], and this leads to more efficient constructions of rational functions over [Formula: see text] whose image is small relative to [Formula: see text]. We also give an unconditional version of the algorithm that works for almost all primes [Formula: see text], and give a probabilistic algorithm with subexponential time complexity.

scholarly journals On the distribution of Atkin and Elkies primes for reductions of elliptic curves on average

2015 ◽  
Vol 18 (1) ◽  
pp. 308-322 ◽  
Author(s):  
Igor E. Shparlinski ◽  
Andrew V. Sutherland
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curves ◽  
Riemann Hypothesis ◽  
Complex Multiplication ◽  
Log P ◽  
Point Counting ◽  
Generalized Riemann Hypothesis ◽  
Expected Time ◽  
Almost All ◽  
Counting Algorithm

For an elliptic curve$E/\mathbb{Q}$without complex multiplication we study the distribution of Atkin and Elkies primes$\ell$, on average, over all good reductions of$E$modulo primes$p$. We show that, under the generalized Riemann hypothesis, for almost all primes$p$there are enough small Elkies primes$\ell$to ensure that the Schoof–Elkies–Atkin point-counting algorithm runs in$(\log p)^{4+o(1)}$expected time.

scholarly journals The Frequency of Elliptic Curve Groups over Prime Finite Fields

2016 ◽  
Vol 68 (4) ◽  
pp. 721-761 ◽  
Author(s):  
Vorrapan Chandee ◽  
Chantal David ◽  
Dimitris Koukoulopoulos ◽  
Ethan Smith
Keyword(s):  
Asymptotic Formula ◽  
Finite Field ◽  
Elliptic Curve ◽  
Elliptic Curves ◽  
Finite Fields ◽  
Arithmetic Progressions ◽  
Constant Multiple ◽  
Group Order ◽  
Almost All ◽  
Candidate Group

AbstractLetting p vary over all primes and E vary over all elliptic curves over the finite field 𝔽p, we study the frequency to which a given group G arises as a group of points E(𝔽p). It is well known that the only permissible groups are of the form Gm,k:=ℤ/mℤ×ℤ/mkℤ. Given such a candidate group, we let M(Gm,k) be the frequency to which the group Gm,karises in this way. Previously, C.David and E. Smith determined an asymptotic formula for M(Gm,k) assuming a conjecture about primes in short arithmetic progressions. In this paper, we prove several unconditional bounds for M(Gm,k), pointwise and on average. In particular, we show thatM(Gm,k) is bounded above by a constant multiple of the expected quantity when m ≤ kA and that the conjectured asymptotic for M(Gm,k) holds for almost all groups Gm,k when m ≤ k1/4-∈. We also apply our methods to study the frequency to which a given integer N arises as a group order #E(𝔽p).

scholarly journals Average normalisations of elliptic curves

2002 ◽  
Vol 66 (3) ◽  
pp. 353-358 ◽  
Author(s):  
William D. Banks ◽  
Igor E. Shparlinski
Keyword(s):  
Finite Field ◽  
Elliptic Curve ◽  
Elliptic Curves ◽  
Almost All

Ciet, Quisquater, and Sica have recently shown that every elliptic curve E over a finite field 𝔽p is isomorphic to a curve y2 = x3 + ax + b with a and b of size O (p¾). In this paper, we show that almost all elliptic curves satisfy the stronger bound O (p⅔). The problem is motivated by cryptographic considerations.

scholarly journals Moments of the Rank of Elliptic Curves

2012 ◽  
Vol 64 (1) ◽  
pp. 151-182 ◽  
Author(s):  
Steven J. Miller ◽  
Siman Wong
Keyword(s):  
Elliptic Curve ◽  
Elliptic Curves ◽  
Explicit Formula ◽  
Upper Bound ◽  
Riemann Hypothesis ◽  
Integral Points ◽  
Quadratic Twist ◽  
Almost All ◽  
Increasing Function ◽  
Asymptotic Upper Bound

Abstract Fix an elliptic curve E/Qand assume the Riemann Hypothesis for the L-function L(ED, s) for every quadratic twist ED of E by D ϵ Z. We combine Weil's explicit formula with techniques of Heath-Brown to derive an asymptotic upper bound for the weighted moments of the analytic rank of ED. We derive from this an upper bound for the density of low-lying zeros of L(ED, s) that is compatible with the randommatrixmodels of Katz and Sarnak. We also show that for any unbounded increasing function f on R, the analytic rank and (assuming in addition the Birch and Swinnerton-Dyer conjecture) the number of integral points of ED are less than f (D) for almost all D.

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.

On the Surjectivity of the Galois Representations Associated to Non-CM Elliptic Curves

2005 ◽  
Vol 48 (1) ◽  
pp. 16-31 ◽  
Author(s):  
Alina Carmen Cojocaru ◽  
Ernst Kani
Keyword(s):  
Positive Integer ◽  
Elliptic Curve ◽  
Elliptic Curves ◽  
Galois Representations ◽  
Complex Multiplication ◽  
Galois Representation ◽  
Upper Bounds

AbstractLet E be an elliptic curve defined over ℚ, of conductor N and without complex multiplication. For any positive integer l, let ϕl be the Galois representation associated to the l-division points of E. From a celebrated 1972 result of Serre we know that ϕl is surjective for any sufficiently large prime l. In this paper we find conditional and unconditional upper bounds in terms of N for the primes l for which ϕl is not surjective.

Generalized Artin'S Conjecture for Primitive Roots and Cyclicity Mod of Elliptic Curves Over Function Fields

1995 ◽  
Vol 38 (2) ◽  
pp. 167-173 ◽  
Author(s):  
David A. Clark ◽  
Masato Kuwata
Keyword(s):  
Finite Field ◽  
Prime Ideal ◽  
Elliptic Curve ◽  
Elliptic Curves ◽  
Function Field ◽  
Function Fields ◽  
Artin's Conjecture ◽  
Primitive Roots

AbstractLet k = Fq be a finite field of characteristic p with q elements and let K be a function field of one variable over k. Consider an elliptic curve E defined over K. We determine how often the reduction of this elliptic curve to a prime ideal is cyclic. This is done by generalizing a result of Bilharz to a more general form of Artin's primitive roots problem formulated by R. Murty.

Bilinear character sums and sum-product problems on elliptic curves

2010 ◽  
Vol 53 (1) ◽  
pp. 1-12 ◽  
Author(s):  
Omran Ahmadi ◽  
Igor Shparlinski
Keyword(s):  
Finite Field ◽  
Elliptic Curve ◽  
Elliptic Curves ◽  
Character Sums ◽  
Multiplicative Character ◽  
Additive Character ◽  
Product Problem ◽  
Multiplicative Character Sums

AbstractLet E be an ordinary elliptic curve over a finite field q of q elements. We improve a bound on bilinear additive character sums over points on E, and obtain its analogue for bilinear multiplicative character sums. We apply these bounds to some variants of the sum-product problem on E.

scholarly journals Elliptic curves with a given number of points over finite fields

2012 ◽  
Vol 149 (2) ◽  
pp. 175-203 ◽  
Author(s):  
Chantal David ◽  
Ethan Smith
Keyword(s):  
Positive Integer ◽  
Asymptotic Formula ◽  
Elliptic Curve ◽  
Elliptic Curves ◽  
Finite Fields ◽  
Short Interval ◽  
Distribution Of Primes ◽  
Primes In Arithmetic Progressions ◽  
Interval Distribution ◽  
Better Than

AbstractGiven an elliptic curve E and a positive integer N, we consider the problem of counting the number of primes p for which the reduction of E modulo p possesses exactly N points over 𝔽p. On average (over a family of elliptic curves), we show bounds that are significantly better than what is trivially obtained by the Hasse bound. Under some additional hypotheses, including a conjecture concerning the short-interval distribution of primes in arithmetic progressions, we obtain an asymptotic formula for the average.

Sign in / Sign up

Export Citation Format

Share Document