Finding strong pseudoprimes to several bases. II

DOI10.1090/S0025-5718-03-01545-XzbMath1113.11007WikidataQ55895130 ScholiaQ55895130MaRDI QIDQ4417183

Min Tang, Zhenxiang Zhang

Publication date: 28 July 2003

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

zbMATH Keywords

Chinese remainder theoremCarmichael numbersbiquadratic residue characterscubic residue charactersRabin-Miller teststrong pseudoprimes

Mathematics Subject Classification ID

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

Related Items (9)

Compositeness test with nodal curves ⋮ Strong pseudoprimes to the first eight prime bases ⋮ An intelligent choice of witnesses in the Miller-Rabin primality test. Reinforcement learning approach ⋮ Notes on some new kinds of pseudoprimes ⋮ 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 ⋮ Strong pseudoprimes to base 2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic algorithm for testing primality
• Evaluation and comparison of two efficient probabilistic primality testing algorithms
• Riemann's hypothesis and tests for primality
• Constructing Carmichael numbers which are strong pseudoprimes to several bases
• Finding strong pseudoprimes to several bases
• Average Case Error Estimates for the Strong Probable Prime Test
• The Carmichael Numbers up to 10 15
• A one-parameter quadratic-base version of the Baillie-PSW probable prime test
• The Pseudoprimes to 25 ⋅10 9
• A monte carlo method for factorization
• On Strong Pseudoprimes to Several Bases

This page was built for publication: Finding strong pseudoprimes to several bases. II