Abstract
Although the Miller-Rabin test is very fast in practice, there exist composite integers n for which this test fails for 1/4 of all bases coprime to n. In 1998 Grantham developed a probable prime test with failure probability of only 1/7710 and asymptotic running time 3 times that of the Miller-Rabin test. For the case that n ≡ 1 mod 4, by S. Müller a test with failure rate of 1/8190 and comparable running time as for the Grantham test was established. Very recently, with running time always at most 3 Miller-Rabin tests, this was improved to 1/131040, for the other case, n ≡ 3 mod 4. Unfortunately the underlying techniques cannot be generalized to n ≡ 1 mod 4. Also, the main ideas for proving this result do not extend to n ≡ 1 mod 4.
Here, we explicitly deal with n ≡ 1 mod 4 and propose a newprobable prime test that is extremely efficient. For the first round, our test has average running time (4 + o(1)) log2 n multiplications or squarings mod n, which is about 4 times as many as for the Miller-Rabin test. But the failure rate is much smaller than 1/44 = 1/256. Indeed, for our test we prove a worst case failure probability less than 1/1048350. Moreover, each iteration of the test runs in time equivalent to only 3 Miller-Rabin tests. But for each iteration, the error is less than 1/131040.
Research supported by the Austrian Science Fund (FWF), FWF-Project no. P 14472-MAT
Chapter PDF
Similar content being viewed by others
Keywords
References
Adams, W., Shanks, D., Strong primality tests that are not sufficient. Math. Comp. 39, 255–300 (1982).
Alford, W.R., Granville, A., Pomerance, C., On the difficulty of finding reliable witnesses. Algorithmic Number Theory, LNCS 877, 1–16 (1994).
Arnault, F., Rabin-Miller primality test: Composite numbers which pass it. Math. Comp. 64, no. 209, 355–361 (1995).
Arnault, F., The Rabin-Monier theorem for Lucas pseudoprimes. Math. Comp. 66, 869–881 (1997).
Atkin, A.O.L., Probabilistic Primality Testing. INRIA Res. Rep. 1779, 159–163 (1992).
Atkin, A.O.L., Intelligent primality test offer. Computational Perspectives on Number Theory (D. A. Buell, J.T. Teitelbaum, eds.), Proceedings of a Conference in Honor of A.O.L. Atkin, International Press, 1–11 (1998).
Atkin, A.O.L., Morain, F., Elliptic curves and primality proving. Math. Comp. 61, 29–68 (1993).
Baillie, R., Wagsta., S.S., Lucas pseudoprimes. Math. Comp. 35, 1391–1417 (1980).
Bleichenbacher, D., Efficiency and Security of Cryptosystems based on Number Theory. Dissertation ETH Zürich (1996).
Bosma, W., Van der Hulst, M.-P., Faster primality testing. EUROCRYPT’ 89, LNCS 434, 652–656 (1990).
Carmichael R.D., On sequences of integers defined by recurrence relations. Quart. J. Pure Appl. Math. 48, 343–372 (1920).
Cohen, H., Lenstra H. W., Primality testing and Jacobi sums. Math. Comp. 42, 297–330 (1984).
Crandall, R., Pomerance, C., Prime Numbers. A Computational Perspective. Springer-Verlag (2001).
Damgård, I., Landrock, P., Pomerance, C., Average case error estimates for the strong probable prime test. Math. Comp. 61, no. 203, 177–194 (1993).
Damgård, I., Frandsen, G. S., An extended quadratic Frobenius primality test with average case error estimates. Draft, University of Aarhus, Denmark, August 31 (2001).
Grantham, J., A probable prime test with high confidence. J. Number Theory 72, 32–47 (1998).
Jaeschke, G., On strong pseudoprimes to several bases. Math. Comp. 61, 915–926, (1993).
Knuth, D., The Art of Computer Programming. Vol. 2/Seminumerical Algorithms. Addison-Wesley, 1997.
Kurtz G., Shanks, D., Williams, H.C., Fast primality tests for numbers less than 50. 109. Math. Comp. 46, 691–701 (1986).
A. K. Lenstra, H. W. Lenstra Jr., The Development of the Number Field Sieve. Springer-Verlag, Berlin, 1993.
Lindhurst, S., An analysis of Shank’s Algorithm for computing square roots in finite fields. CRM Proceedings and Lecture Notes, Vol. 19, 231–242 (1999).
Menezes, A., van Oorschot, P.C., Vanstone, S., Handbook of Applied Cryptography. CRC (1997).
Montgomery, P., Evaluating recurrences of form Xm+n = f(Xm,Xn,Xm-n) via Lucas chains. Preprint.
More, W., The LD probable prime test. Contemporary Mathematics, 225, 185–191 (1999).
Müller, S., On the combined Fermat/Lucas probable prime test. In: Walker, M. (ed.) Cryptography and Coding, LNCS 1746, Springer-Verlag, 222–235 (1999).
Müller, S., On probable prime testing and the computation of square roots mod n. Algorithmic Number Thory, ANTS IV, Proceedings, Wieb Bosma (ed.), LNCS 1838, 423–437 (2000).
Müller, S., On the rank of appearance and the number of zeros of the Lucas sequences over F q . Finite Fields and Applications, H. Niederreiter, A. Enge (eds.), 390–408, Springer (2001).
Müller, S., A probable prime test with very high con.dence for n ⩸ 3 mod 4. Submitted.
Müller, S., On probable prime testing and Shanks’ root finding algorithm. Preprint, University of Klagenfurt 2001.
Pinch, R. G. E., Some primality testing algorithms. Preprint (1993).
Pomerance, C., Are there counter-examples to the Baillie-PSW primality test? In: Lenstra, A.K. (ed.) Dopo Le Parole aangeboden aan Dr. A. K. Lenstra. Privately published Amsterdam (1984).
C. Pomerance, The number field sieve. Proceedings of Symposia in Applied Mathematics, Vol. 48, pp. 465–480 (1994).
Pomerance, C., Selfridge, J. L., Wagsta., S.S., Jr., The pseudoprimes to 25 · 109. Math. Comp. 35, no. 151, 1003–1026 (1980).
Postl, H., Fast evaluation of Dickson Polynomials. Contrib. to General Algebra 6, 223–225 (1988).
Riesel, H., Prime Numbers and Computer Methods for Factorization. Birkhäuser (1994).
Ribenboim, P., The New Book of Prime Number Records. Berlin, Springer (1996).
Shoup, V., Primality testing with fewer random bits. Computational Complexity 3, 355–367 (1993).
Shanks, D., Five number-theoretic algorithms. Proc. of the second Manitoba Conf. on numerical mathematics, Thomas, R.S.D., Williams, H.C. (eds.), 51–70 (1972).
Somer, L., On Lucas d-Pseudoprimes. In: Applications of Fibonacci Numbers, Volume 7, Bergum G.E., Philippou, A.N., Horadam, A.F. (eds.), Kluwer, 369–375, (1998).
Williams, H.C., A p + 1 method of factoring. Math. Comp. 39, no. 159, 225–234 (1982).
Williams, H.C., Éduard Lucas and Primality Testing. John Wiley & Sons (1998).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Müller, S. (2001). A Probable Prime Test with Very High Confidence for n ≡ 1 mod 4. In: Boyd, C. (eds) Advances in Cryptology — ASIACRYPT 2001. ASIACRYPT 2001. Lecture Notes in Computer Science, vol 2248. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45682-1_6
Download citation
DOI: https://doi.org/10.1007/3-540-45682-1_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42987-6
Online ISBN: 978-3-540-45682-7
eBook Packages: Springer Book Archive