Primality of the number of points on an elliptic curve over a finite field

DOI10.2140/pjm.1988.131.157zbMath0608.10010OpenAlexW2047645975WikidataQ56341919 ScholiaQ56341919MaRDI QIDQ1086273

Neal Koblitz

Publication date: 1988

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.pjm/1102690074

zbMATH Keywords

finite fieldelliptic curvecomplex multiplicationprimalityasymptotic formulascomputational number theorynon-CM curve

Mathematics Subject Classification ID

Elliptic curves over global fields (11G05) Finite ground fields in algebraic geometry (14G15) Algebraic number theory computations (11Y40)

Related Items

Constructing hyperelliptic curves of genus 2 suitable for cryptography ⋮ SQUARE-FREE DISCRIMINANTS OF FROBENIUS RINGS ⋮ Averages of elliptic curve constants ⋮ Fast generation of prime numbers and secure public-key cryptographic parameters. ⋮ Koblitz’s Conjecture for Abelian Varieties ⋮ The square sieve and a Lang-Trotter question for generic abelian varieties ⋮ Corrigendum: Elliptic curves with a given number of points over finite fields ⋮ Message recovery for signature schemes based on the discrete logarithm problem ⋮ On the order of CM abelian varieties over finite prime fields ⋮ Hyperelliptic cryptosystems ⋮ Amicable pairs and aliquot cycles on average ⋮ Koblitz's conjecture on average for elliptic curves over abelian number fields of square-free conductor ⋮ Remarks on the Fourier coefficients of modular forms ⋮ Non-CM elliptic curves with infinitely many almost prime Frobenius traces ⋮ Divisors of Fourier coefficients of two newforms ⋮ Primes, elliptic curves and cyclic groups ⋮ Elliptic curve implementation of zero-knowledge blobs ⋮ A REFINEMENT OF KOBLITZ'S CONJECTURE ⋮ Square-free orders for CM elliptic curves modulo \(p\) ⋮ Cyclicity of elliptic curves modulo \(p\) and elliptic curve analogues of Linnik's problem ⋮ Splitting of abelian varieties ⋮ The \(d\)-primary Brauer-Manin obstruction for curves ⋮ On invariants of elliptic curves on average ⋮ An algorithm to compute the number of points on elliptic curves of \(j\)-invariant 0 or 1728 over a finite field

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Galois properties of points of finite order of elliptic curves
• Some Primes of the Form (a n - 1)/(a - 1)
• The Complex Sum of Divisors
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Elliptic Curve Cryptosystems
• Primitive points on elliptic curves