On the number of elliptic pseudoprimes

For an elliptic curve E with complex multiplication by an order in K = Q(V\/d), a point P of infinite order on E, and any prime p with (-d I p) = -1, we have that (p + 1) * P = O(mod p), where 0 is the point at infinity and calculations are done using the addition law for E. Any composite number which satisfies these conditions is called an elliptic pseudoprime. In this paper it is shown that, assuming the Generalized Riemann Hypothesis, elliptic pseudoprimes are less numerous than primes. In particular, on the GRH, the number of elliptic pseudoprimes less than x is O(x log log x/log2 x). For certain curves it is shown that infinitely many elliptic pseudoprimes exist.

[1]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[2]  Morgan Ward,et al.  Memoir on Elliptic Divisibility Sequences , 1948 .

[3]  M. Ward.  The law of repetition of primes in an elliptic divisibility sequence , 1948 .

[4]  M. Ward.  THE INTRINSIC DIVISORS OF LEHMER NUMBERS , 1955 .

[5]  H. M. Stark,et al.  A complete determination of the complex quadratic fields of class-number one. , 1967 .

[6]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[7]  Carl Pomerance,et al.  The pseudoprimes to 25⋅10⁹ , 1980 .

[8]  M. Rabin.  Probabilistic algorithm for testing primality , 1980 .

[9]  Donald E. Knuth,et al.  The Art of Computer Programming, Vol. 2 , 1981 .

[10]  Daniel Shanks,et al.  Strong primality tests that are not sufficient , 1982 .

[11]  Michael Rosen,et al.  A classical introduction to modern number theory , 1982, Graduate texts in mathematics.

[12]  R. Schoof.  Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p , 1985 .

[13]  Hugh C. Williams,et al.  Fast primality tests for numbers less than 50 · 10 9 , 1986 .

[14]  H. W. Lenstra,et al.  Factoring integers with elliptic curves , 1987 .

[15]  Joe Kilian,et al.  Almost all primes can be quickly certified , 1986, STOC '86.

[16]  Joseph H. Silverman,et al.  The arithmetic of elliptic curves , 1986, Graduate texts in mathematics.

[17]  D. Chudnovsky,et al.  Sequences of numbers generated by addition in formal groups and new primality and factorization tests , 1986 .

[18]  M. V. Ramana Murty,et al.  Primitive points on elliptic curves , 1986 .

[19]  J. Cassels,et al.  Review: Joseph H. Silverman, The arithmetic of elliptic curves , 1987 .

[20]  P. L. Montgomery.  Speeding the Pollard and elliptic curve methods of factorization , 1987 .

[21]  Don Zagier,et al.  Large Integral Points on Elliptic Curves , 1987 .

[22]  Daniel M. Gordon,et al.  Pseudoprimes on elliptic curves , 1989 .

[23]  W. H..  Elliptic Curves and Number-theoretic Algorithms , 2022 .