On the Number of Elliptic Pseudoprimes

DOI10.2307/2008667zbMath0658.10005OpenAlexW4246080233MaRDI QIDQ3807278

Daniel M. Gordon

Publication date: 1989

Full work available at URL: https://doi.org/10.2307/2008667

zbMATH Keywords

existencedistributionfactorization algorithmscomputational number theoryprimality testingelliptic curve with complex multiplicationelliptic pseudoprime

Mathematics Subject Classification ID

Elliptic curves (14H52) Power residues, reciprocity (11A15) Primes (11A41)

Related Items

Anomalous primes and the elliptic Korselt criterion, Building pseudoprimes with a large number of prime factors, Elliptic Curves and Primality Proving, The Distribution of Lucas and Elliptic Pseudoprimes, On the existence and non-existence of elliptic pseudoprimes, Elliptic Pseudoprimes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring integers with elliptic curves
• Probabilistic algorithm for testing primality
• Sequences of numbers generated by addition in formal groups and new primality and factorization tests
• A complete determination of the complex quadratic fields of class-number one
• The law repetition of primes in an elliptic divisibility sequence
• The intrinsic divisors of Lehmer numbers
• Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
• Fast Primality Tests for Numbers Less Than 50 ⋅10 9
• Speeding the Pollard and Elliptic Curve Methods of Factorization
• Large Integral Points on Elliptic Curves
• The Pseudoprimes to 25 ⋅10 9
• Lucas Pseudoprimes
• Strong Primality Tests that are Not Sufficient
• On the Distribution of Pseudoprimes
• Memoir on Elliptic Divisibility Sequences