Finding strong pseudoprimes to several bases

Author:
Zhenxiang Zhang

Journal:
Math. Comp. **70** (2001), 863-872

MSC (2000):
Primary 11Y11, 11A15, 11A51

DOI:
https://doi.org/10.1090/S0025-5718-00-01215-1

Published electronically:
February 17, 2000

MathSciNet review:
1697654

Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: Define to be the smallest strong pseudoprime to all the first prime bases. If we know the exact value of , we will have, for integers , a deterministic primality testing algorithm which is not only easier to implement but also faster than either the Jacobi sum test or the elliptic curve test. Thanks to Pomerance et al. and Jaeschke, are known for . Upper bounds for were given by Jaeschke.

In this paper we tabulate all strong pseudoprimes (spsp's) to the first ten prime bases which have the form with odd primes and There are in total 44 such numbers, six of which are also spsp(31), and three numbers are spsp's to both bases 31 and 37. As a result the upper bounds for and are lowered from 28- and 29-decimal-digit numbers to 22-decimal-digit numbers, and a 24-decimal-digit upper bound for is obtained. The main tools used in our methods are the biquadratic residue characters and cubic residue characters. We propose necessary conditions for to be a strong pseudoprime to one or to several prime bases. Comparisons of effectiveness with both Jaeschke's and Arnault's methods are given.

**1.**L.M.Adleman, C.Pomerance and R.S.Rumely,*On distinguishing prime numbers from composite numbers.*, Annals of Math.,**117**(1983), 173-206. MR**84e:10008****2.**W.R.Alford, A.Granville and C.Pomerance,*There are infinitely many Carmichael numbers*, Annals of Math.,**140**(1994), 703-722. MR**95k:11114****3.**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****4.**F.Arnault,*Rabin-Miller primality test: Composite numbers which pass it*, Math. Comp.,**64**(1995), 355-361. MR**95c:11152****5.**A.O.L.Atkin and F.Morain,*Elliptic curves and primality proving*, Math. Comp.,**61**(1993), 29-68. MR**93m:11136****6.**W.Bosma and M.P. van der Hulst,*Primality proving with cyclotomy*, thesis, Univ. of Amsterdam, 1990.**7.**H.Cohen and A.K.Lenstra,*Implementation of a new primality test*, Math. Comp.,**48**(1987), 103-121. MR**88c:11080****8.**H.Cohen and H.W.Lenstra,Jr.,*Primality testing and Jacobi sums*, Math. Comp.,**42**(1984), 297-330. MR**86g:11078****9.**D.A.Cox,*Primes of the form*, Interscience, New York, 1989. MR**90m:11016****10.**K.Ireland and M.Rosen,*A classical introduction to modern number theory*, Springer-Verlag, New York, 1982. MR**83g:12001****11.**G.Jaeschke,*On strong pseudoprimes to several bases*, Math. Comp.,**61**(1993),915-926. MR**94d:11004****12.**G.Miller,*Riemann's hypothesis and tests for primality*, J.Comput. and System Sc.,**13**(1976),300-317. MR**58:470a****13.**Louis Monier,*Evaluation and comparison of two efficient probabilistic primality testing algorithms*, Theoretical Computer Science,**12**(1980), 97-108. MR**82a:68078****14.**C.Pomerance, J.L.Selfridge and Samuel S.Wagstaff,Jr.,*The pseudoprimes to*, Math. Comp.,**35**(1980), 1003-1026. MR**82g:10030****15.**M.O.Rabin,*Probabilistic algorithms for testing primality*, J.Number Theory,**12**(1980), 128-138. MR**81f:10003**

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, P. R. China;
State Key Laboratory of Information Security, Graduate School USTC, 100039 Beijing, P. R. China

Email:
zhangzhx@mail.ahwhptt.net.cn

DOI:
https://doi.org/10.1090/S0025-5718-00-01215-1

Keywords:
Strong pseudoprimes,
Rabin-Miller test,
biquadratic residue characters,
cubic residue characters,
Chinese remainder theorem

Received by editor(s):
August 1, 1997

Received by editor(s) in revised form:
June 22, 1998, and May 24, 1999

Published electronically:
February 17, 2000

Additional Notes:
Supported by the China State Educational Commission Science Foundation and by NSF of China Grant 10071001.

Dedicated:
Dedicated to the memory of P. Erdős (1913–1996)

Article copyright:
© Copyright 2000
American Mathematical Society