Results 1  10
of
18
Cyclicity of elliptic curves modulo p and elliptic curve analogues of Linnik’s problem
, 2001
"... 1 Let E be an elliptic curve defined over Q and of conductor N. For a prime p ∤ N, we denote by E the reduction of E modulo p. We obtain an asymptotic formula for the number of primes p ≤ x for which E(Fp) is cyclic, assuming a certain generalized Riemann hypothesis. The error terms that we get are ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
1 Let E be an elliptic curve defined over Q and of conductor N. For a prime p ∤ N, we denote by E the reduction of E modulo p. We obtain an asymptotic formula for the number of primes p ≤ x for which E(Fp) is cyclic, assuming a certain generalized Riemann hypothesis. The error terms that we get are substantial improvements of earlier work of J.P. Serre and M. Ram Murty. We also consider the problem of finding the size of the smallest prime p = pE for which the group E(Fp) is cyclic and we show that, under the generalized Riemann hypothesis, pE = O � (log N) 4+ε � if E is without complex multiplication, and pE = O � (log N) 2+ε � if E is with complex multiplication, for any 0 < ε < 1. 1
Implementation Of The AtkinGoldwasserKilian Primality Testing Algorithm
 Rapport de Recherche 911, INRIA, Octobre
, 1988
"... . We describe a primality testing algorithm, due essentially to Atkin, that uses elliptic curves over finite fields and the theory of complex multiplication. In particular, we explain how the use of class fields and genus fields can speed up certain phases of the algorithm. We sketch the actual impl ..."
Abstract

Cited by 9 (7 self)
 Add to MetaCart
. We describe a primality testing algorithm, due essentially to Atkin, that uses elliptic curves over finite fields and the theory of complex multiplication. In particular, we explain how the use of class fields and genus fields can speed up certain phases of the algorithm. We sketch the actual implementation of this test and its use on testing large primes, the records being two numbers of more than 550 decimal digits. Finally, we give a precise answer to the question of the reliability of our computations, providing a certificate of primality for a prime number. IMPLEMENTATION DU TEST DE PRIMALITE D' ATKIN, GOLDWASSER, ET KILIAN R'esum'e. Nous d'ecrivons un algorithme de primalit'e, principalement du `a Atkin, qui utilise les propri'et'es des courbes elliptiques sur les corps finis et la th'eorie de la multiplication complexe. En particulier, nous expliquons comment l'utilisation du corps de classe et du corps de genre permet d'acc'el'erer les calculs. Nous esquissons l'impl'ementati...
On the rrank Artin Conjecture
 Math. Comp
, 1999
"... Abstract. We assume the generalized Riemann hypothesis and prove an asymptotic formula for the number of primes for which F ∗ p can be generated by r given multiplicatively independent numbers. In the case when the r given numbers are primes, we express the density as an Euler product and apply this ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Abstract. We assume the generalized Riemann hypothesis and prove an asymptotic formula for the number of primes for which F ∗ p can be generated by r given multiplicatively independent numbers. In the case when the r given numbers are primes, we express the density as an Euler product and apply this to a conjecture of Brown–Zassenhaus (J. Number Theory 3 (1971), 306–309). Finally, in some examples, we compare the densities approximated with the natural densities calculated with primes up to 9 · 10 4. 1.
Reductions of an elliptic curve with almost prime orders
"... 1 Let E be an elliptic curve over Q. For a prime p of good reduction, let Ep be the reduction of E modulo p. We investigate Koblitz’s Conjecture about the number of primes p for which Ep(Fp) has prime order. More precisely, our main result is that if E is with Complex Multiplication, then there exis ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
1 Let E be an elliptic curve over Q. For a prime p of good reduction, let Ep be the reduction of E modulo p. We investigate Koblitz’s Conjecture about the number of primes p for which Ep(Fp) has prime order. More precisely, our main result is that if E is with Complex Multiplication, then there exist infinitely many primes p for which #Ep(Fp) has at most 5 prime factors. We also obtain upper bounds for the number of primes p ≤ x for which #Ep(Fp) is a prime. 1
Reduction mod p of subgroups of the MordellWeil group of an elliptic curve, Int
 J. of Number Theory
"... Let E be an elliptic curve defined over Q. Let Γ be a free subgroup of rank r of E(Q). For any prime p of good reduction, let Γp be the reduction of Γ modulo p and Ep be the reduction of E modulo p. We prove that if E has CM then for all but o(x / log x) of primes p ≤ x, Γp  ≥ p r r+2 +ɛ(p), wher ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Let E be an elliptic curve defined over Q. Let Γ be a free subgroup of rank r of E(Q). For any prime p of good reduction, let Γp be the reduction of Γ modulo p and Ep be the reduction of E modulo p. We prove that if E has CM then for all but o(x / log x) of primes p ≤ x, Γp  ≥ p r r+2 +ɛ(p), where ɛ(p) is any function of p such that ɛ(p) → 0 as p → ∞. This is a consequence of two other results. Denote by Np the cardinality of Ep(Fp), where Fp is a finite field of p elements. Then for any δ> 0, the set of primes p for which Np has a divisor in the range (pδ−ɛ(p), pδ+ɛ(p) ) has density zero. Moreover, the set of primes p for which Γp  < p r r+2 −ɛ(p) has density zero. Keywords: Reduction mod p of elliptic curves, Elliptic curves over finite fields, BrunTitchmarsh inequality, Large sieve in number fields. 2000 Mathematics Subject Classification. Primary 11G20, Secondary 11N36. 1
On the greatest prime divisor of Np
 J. Ramanujan Math. Soc
"... Let E be an elliptic curve defined over Q. For any prime p of good reduction, let Ep be the reduction of E mod p. Denote by Np the cardinality of Ep(Fp), where Fp is the finite field of p elements. Let P (Np) be the greatest prime divisor of Np. We prove that if E has CM then for all but o(x / log x ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Let E be an elliptic curve defined over Q. For any prime p of good reduction, let Ep be the reduction of E mod p. Denote by Np the cardinality of Ep(Fp), where Fp is the finite field of p elements. Let P (Np) be the greatest prime divisor of Np. We prove that if E has CM then for all but o(x / log x) of primes p ≤ x, P (Np)> p ϑ(p), where ϑ(p) is any function of p such that ϑ(p) → 0 as p → ∞. Moreover we show that for such E there is a positive proportion of primes p ≤ x for which P (Np)> p ϑ, where ϑ is any number less than ϑ0 = 1 − 1 2 prove the following. Let Γ be a free subgroup of rank r ≥ 2 of the group of rational points E(Q), and Γp be the reduction of Γ mod p, then for a positive proportion of primes p ≤ x, we have where ɛ> 0. e− 1 4 = 0.6105 · · ·. As an application of this result we Γp > p ϑ0−ɛ Keywords: Reduction mod p of elliptic curves, Elliptic curves over finite fields, BrunTitchmarsh inequality in number fields, BombieriVinogradov theorem in number fields, Abelian extensions of imaginary quadratic number fields. 2000 Mathematics Subject Classification. Primary 11G20, Secondary 11N37. 1
Towards LangTrotter for Elliptic Curves over Function Fields
"... Introduction Let K be a global field of char p and let F q K denote the algebraic closure of F p in K. We fix an elliptic curve E/K with nonconstant jinvariant and a torsionfree subgroup E(K) of rank r > 0. We write V for the open set of places v of K such that the special fiber E v is an e ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Introduction Let K be a global field of char p and let F q K denote the algebraic closure of F p in K. We fix an elliptic curve E/K with nonconstant jinvariant and a torsionfree subgroup E(K) of rank r > 0. We write V for the open set of places v of K such that the special fiber E v is an elliptic curve and, for v in V , we let # v E v (k v ) be the image of # under reduction modulo v, where k v is the residue field of K at v. We fix a finite set of (rational) prime numbers S which is large enough to include the exceptional primes which we will define explicitly in section 2.4 and section 3), and we let G(#, S) denote the subset of v V such that # v contains the primetoS part of E v (k v ). For every n > 0, we write V n for the subset of v V such that deg(v) = n and let G n (#, S) = V n G(#, S). Theorem 1. Suppose r 6. There exists constants a, b satisfying 0 1 and depending only on r and S such that, for each n 1 there exists # n (#, S), depending on r, S an
PERIODS OF ORBITS MODULO PRIMES
"... Let S be a monoid of endomorphisms of a quasiprojective variety V defined over a global field K. We prove a lower bound for the size of the reduction modulo places of K of the orbit of any point α ∈ V (K) under the action of the endomorphisms from S. We also prove a similar result in the context of ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Let S be a monoid of endomorphisms of a quasiprojective variety V defined over a global field K. We prove a lower bound for the size of the reduction modulo places of K of the orbit of any point α ∈ V (K) under the action of the endomorphisms from S. We also prove a similar result in the context of Drinfeld modules. Our results may be considered as dynamical variants of Artin’s primitive root conjecture.
On Artin's Conjecture for Primitive Roots
, 1993
"... Various generalizations of the Artin's Conjecture for primitive roots are considered. It is proven that for at least half of the primes p, the first log p primes generate a primitive root. A uniform version of the Chebotarev Density Theorem for the field ) valid for the range l < log x is proven. ..."
Abstract
 Add to MetaCart
Various generalizations of the Artin's Conjecture for primitive roots are considered. It is proven that for at least half of the primes p, the first log p primes generate a primitive root. A uniform version of the Chebotarev Density Theorem for the field ) valid for the range l < log x is proven. A uniform asymptotic formula for the number of primes up to x for which there exists a primitive root less than s is established. Lower bounds for the exponent of the class group of imaginary quadratic fields valid for density one sets of discriminants are determined. RESUM E Nous considerons di#erentes generalisations de la conjecture d'Artin pour les racines primitives. Nous demontrons que pour au moins la moitie des nombres premiers p, les premiers log p nombres premiers engendrent une racine primitive. Nous demontrons une version uniforme du Theoreme de Densite de Chebotarev pour le corps Q(# l , 2 ) pour l'intervalle l < log x. On etablit une formule asymptotique uniforme pour les nombres de premiers plus petits que x tels qu' il existe une racine primitive plus petite que s. Nous determinons des minorants pour l'exposant du groupe de classe des corps quadratiques imaginaires valides pour ensembles de discriminants de densite 1. Contents