On Strong Pseudoprimes to Several Bases

DOI10.2307/2153262zbMath0802.11001OpenAlexW4249883179WikidataQ56144950 ScholiaQ56144950MaRDI QIDQ4274406

G. Jaeschke

Publication date: 15 December 1994

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

zbMATH Keywords

upper boundsprimality testsexact valuesstrong pseudoprime

Mathematics Subject Classification ID

Factorization; primality (11A51) Power residues, reciprocity (11A15) Primality (11Y11)

Related Items

Compositeness test with nodal curves ⋮ Fast generation of prime numbers and secure public-key cryptographic parameters. ⋮ Strong pseudoprimes to the first eight prime bases ⋮ On a modification of the Lucas primality test ⋮ Strong pseudoprimes to twelve prime bases ⋮ Fast tabulation of challenge pseudoprimes ⋮ Finding strong pseudoprimes to several bases ⋮ Verifying the Goldbach conjecture up to 4⋅10¹⁴ ⋮ A complete Vinogradov 3-primes theorem under the Riemann hypothesis ⋮ Notes on some new kinds of pseudoprimes ⋮ The error probability of the Miller-Rabin primality test ⋮ Finding 𝐶₃-strong pseudoprimes ⋮ On the effectiveness of a generalization of Miller's primality theorem ⋮ Two kinds of strong pseudoprimes up to $10^{36}$ ⋮ SYLOW p-PSEUDOPRIMES TO SEVERAL BASES FOR SEVERAL PRIMES p ⋮ Finding strong pseudoprimes to several bases. II ⋮ Rabin-Miller Primality Test: Composite Numbers Which Pass It ⋮ Some new kinds of pseudoprimes ⋮ Prime-number algorithm for public-key systems ⋮ The Rabin-Monier theorem for Lucas pseudoprimes ⋮ Strong pseudoprimes to base 2 ⋮ Short effective intervals containing primes

Uses Software

• AXIOM

Cites Work

• The Pseudoprimes to 25 ⋅10 9
• Unnamed Item
• Unnamed Item