Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



Finding strong pseudoprimes to several bases. II

Authors: Zhenxiang Zhang and Min Tang
Journal: Math. Comp. 72 (2003), 2085-2097
MSC (2000): Primary 11Y11, 11A15, 11A51
Published electronically: May 30, 2003
MathSciNet review: 1986825
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: Define $\psi_m$ to be the smallest strong pseudoprime to all the first $m$ prime bases. If we know the exact value of $\psi_m$, we will have, for integers $n<\psi_m$, a deterministic efficient primality testing algorithm which is easy to implement. Thanks to Pomerance et al. and Jaeschke, the $\psi_m$ are known for $1 \leq m \leq 8$. Upper bounds for $\psi_9,\psi_{10} \text{ and } \psi_{11}$ were first given by Jaeschke, and those for $\psi_{10} \text{ and } \psi_{11}$ were then sharpened by the first author in his previous paper (Math. Comp. 70 (2001), 863-872).

In this paper, we first follow the first author's previous work to use biquadratic residue characters and cubic residue characters as main tools to tabulate all strong pseudoprimes (spsp's) $n<10^{24}$ to the first five or six prime bases, which have the form $n=p\,q$ with $p, q$ odd primes and $q-1=k(p-1), k=4/3,\,5/2,\,3/2,\,6$; then we tabulate all Carmichael numbers $<10^{20}$, to the first six prime bases up to 13, which have the form $n=q_1q_2q_3$ with each prime factor $q_i\equiv 3\mod 4$. There are in total 36 such Carmichael numbers, 12 numbers of which are also spsp's to base 17; 5 numbers are spsp's to bases 17 and 19; one number is an spsp to the first 11 prime bases up to 31. As a result the upper bounds for $\psi_{9}, \psi_{10}$ and $\psi_{11}$ are lowered from 20- and 22-decimal-digit numbers to a 19-decimal-digit number:

\begin{displaymath}\begin{split} \psi_{9}\leq \psi_{10}\leq \psi_{11}\leq Q_{11}... ...(19 digits)}\\ &= 149491\cdot 747451\cdot 34233211. \end{split}\end{displaymath}

We conjecture that

\begin{displaymath}\psi_{9}= \psi_{10}= \psi_{11}=3825\;12305\;65464\;13051,\end{displaymath}

and give reasons to support this conjecture. The main idea for finding these Carmichael numbers is that we loop on the largest prime factor $q_3$ and propose necessary conditions on $n$ to be a strong pseudoprime to the first $5$ prime bases. Comparisons of effectiveness with Arnault's, Bleichenbacher's, Jaeschke's, and Pinch's methods for finding (Carmichael) numbers with three prime factors, which are strong pseudoprimes to the first several prime bases, are given.

References [Enhancements On Off] (What's this?)

  • 1. W. R. Alford, A. Granville and C. Pomerance, On the difficulty of finding reliable witnesses, Algorithmic Number Theory, pp. 1-16, Lecture Notes in Computer Science, vol. 877, Springer-Verlag, Berlin, 1994. MR 96d:11136
  • 2. F. Arnault, Constructing Carmichael numbers which are strong pseudoprimes to several bases, J. Symbolic Computation 20 (1995), 151-161. MR 96k:11153
  • 3. D. Bleichenbacher, Efficiency and Security of Cryptosystems Based on Number Theory, ETH Ph.D. dissertation 11404, Swiss Federal Institute of Technology, Zurich (1996).
  • 4. I. Damgård, P. Landrock, and C. Pomerance, Average case estimates for the strong probable prime test, Math. Comp. 61 (1993), 177-194. MR 94b:11124
  • 5. K. Ireland and M. Rosen, A classical introduction to modern number theory, Springer-Verlag, New York, 1982. MR 83g:12001
  • 6. G. Jaeschke, On strong pseudoprimes to several bases, Math. Comp. 61 (1993), 915-926. MR 94d:11004
  • 7. G. Miller, Riemann's hypothesis and tests for primality, J. Comput. and System Sci. 13 (1976), 300-317. MR 58:470a
  • 8. Louis Monier, Evaluation and comparison of two efficient probabilistic primality testing algorithms, Theoretical Computer Science 12 (1980), 97-108. MR 82a:68078
  • 9. R. G. E. Pinch, The Carmichael numbers up to $10^{15}$, Math. Comp. 61 (1993), 381-389. MR 93m:11137
  • 10. -, All Carmichael numbers with three prime factors up to $10^{18}$,
  • 11. J. M. Pollard, A Monte-Carlo method for factorization, BIT 15 (1975), 331-334. MR 52:13611
  • 12. C. Pomerance, J. L. Selfridge and Samuel S. Wagstaff, Jr., The pseudoprimes to $25\cdot10^9$, Math. Comp. 35 (1980), 1003-1026. MR 82g:10030
  • 13. M. O. Rabin, Probabilistic algorithms for testing primality, J. Number Theory 12 (1980), 128-138. MR 81f:10003
  • 14. Zhenxiang Zhang, Finding strong pseudoprimes to several bases, Math. Comp. 70 (2001), 863-872. MR 2001g:11009
  • 15. -, Using Lucas Sequences to Factor Large Integers Near Group Orders, The Fibonacci Quarterly 39 (2001), 228-237. MR 2002c:11173
  • 16. -, A one-parameter quadratic-base version of the Baillie-PSW probable prime test, Math. Comp. 71 (2002), 1699-1734. MR 2003f:11191

Similar Articles

Retrieve articles in Mathematics of Computation with MSC (2000): 11Y11, 11A15, 11A51

Retrieve articles in all journals with MSC (2000): 11Y11, 11A15, 11A51

Additional Information

Zhenxiang Zhang
Affiliation: Department of Mathematics, Anhui Normal University, 241000 Wuhu, Anhui, Peoples Republic of China

Min Tang
Affiliation: Department of Mathematics, Anhui Normal University, 241000 Wuhu, Anhui, Peoples Republic of China

Keywords: Strong pseudoprimes, Carmichael numbers, Rabin-Miller test, biquadratic residue characters, cubic residue characters, Chinese remainder theorem
Received by editor(s): July 9, 2001
Published electronically: May 30, 2003
Additional Notes: Supported by the NSF of China Grant 10071001, the SF of Anhui Province Grant 01046103, and the SF of the Education Department of Anhui Province Grant 2002KJ131.
Article copyright: © Copyright 2003 American Mathematical Society

American Mathematical Society