A probable prime test with very high confidence for n = 3 mod 4

Journal of Cryptology

Volumn 16, Issue 2, 2003, Pages 117-139

  Müller, Siguna ^a  

^a UNIVERSITY OF CALGARY   (Canada)

Author keywords

Combined test; Efficiency; Failure probability; Probable prime testing; Quadratic fields; Running time

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; PROBABILITY;

MILLER-RABIN TEST; PRECOMPUTATION; PRIME TEST; ROOT TESTING;

CRYPTOGRAPHY;

EID: 23944467987     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00145-002-0107-y     Document Type: Article

References (36)

1. W. Adams and D. Shanks. Strong primality tests that are not sufficient. Math. Comp., 39(159):255-300, 1982.
2. W. R. Alford, A. Granville, and C. Pomerance. On the difficulty of finding reliable witnesses. In Algorithmic Number Theory (Ithaca, NY, 1994), pages 1-16. Springer-Verlag, Berlin, 1994.
3. F. Arnault. Rabin-Miller primality test: composite numbers which pass it. Math. Comp., 64(209): 355-361, 1995.
4. A. O. L. Atkin. Intelligent primality test offer. In Computational Perspectives on Number Theory (Chicago, IL, 1995), pages 1-11. American Mathematical Society, Providence, RI, 1998.
5. A. O. L. Atkin and F. Morain. Elliptic curves and primality proving. Math. Comp., 61(203):29-68, 1993.
6. R. Baillie and S. S. Wagstaff, Jr. Lucas pseudoprimes. Math. Comp., 35(152):1391-1417, 1980.
7. P. Berrizbeitia and B. Iskra. Deterministic primality test for numbers of the form A2 · 3n + 1, n ≥ 3 odd. Proc. Amer. Math. Soc., 130(2):363-365 (electronic), 2002.
8. D. Bleichenbacher. Efficiency and Security of Cryptosystems Based on Number Theory. Ph.D. thesis, ETH Zürich, 1996.
9. W. Bosma and M.-P. Van der Hulst. Faster primality testing. In Advances in Cryptology - EUROCRYPT '89, pages 652-656. Springer-Verlag, Berlin, 1990.
10. H. Cohen and H. W. Lenstra, Jr. Primality testing and Jacobi sums. Math. Comp., 42(165):297-330, 1984.
11. R. Crandall and C. Pomerance. Prime Numbers. Springer-Verlag, New York, 2001.
12. I. Damgård and G. S. Frandsen. An extended quadratic frobenius primality test with average case error estimates. Manuscript, University of Aarhus, 2001.
13. I. Damgård, P. Landrock, and C. Pomerance. Average case error estimates for the strong probable prime test. Math. Comp., 61(203):177-194, 1993.
14. J. Grantham. A probable prime test with high confidence. J. Number Theory, 72(1):32-47, 1998.
15. L. K. Hua. Introduction to Number Theory. Springer-Verlag, Berlin, 1982. Translated from the Chinese by Peter Shiu.
16. G. Jaeschke. On strong pseudoprimes to several bases. Math. Comp., 61(204):915-926, 1993.
17. D. E. Knuth. The Art of Computer Programming, Vol. 2, second edition. Addison-Wesley, Reading, MA, 1981. Addison-Wesley Series in Computer Science and Information Processing.
18. G. C. Kurtz, D. Shanks, and H. C. Williams. Fast primality tests for numbers less than 50 · 109. Math. Comp., 46(174):691-701, 1986.
19. R. Lidl, G. L. Mullen, and G. Turnwald. Dickson Polynomials. Longman Scientific & Technical, Harlow, 1993.
20. A. J. Menezes, P. C. van Oorschot, and S. A. Vanstone. Handbook of Applied Cryptography. CRC Press, Boca Raton, FL, 1997.
21. P. L. Montgomery. Modular multiplication without trial division. Math. Comp., 44(170):519-521, 1985.
22. S. Müller. On strong Lucas pseudoprimes. In Contributions to General Algebra, 10 (Klagenfurt, 1997), pages 237-249. Heyn, Klagenfurt, 1998.
23. S. Müller. On the combined Fermat/Lucas probable prime test. In Cryptography and Coding, pages 222-235. Springer-Verlag, Berlin, 1999.
24. S. Müller. On probable prime testing and the computation of square roots mod n. In Algorithmic Number Theory (Leiden, 2000), pages 423-437. Springer-Verlag, Berlin, 2000.
25. S. Müller. On probable prime testing and the Tonelli-Shanks' root finding algorithm. Manuscript, University of Klagenfurt, 2001.
26. q. In Finite Fields and Applications, pages 390-408. Springer-Verlag, Berlin, 2001.
27. S. Müller. A probable prime test with very high confidence for n = 1 mod 4. In Advances in Cryptology - ASIACRYPT '01. Springer-Verlag, Berlin, 2001.
28. S. Müller. Some remarks on primality testing based on Lucas functions. In Number Theory for the Millennium, Vol. 3, pages 1-22. A K Peters, Boston, MA, 2001.
29. R. Pinch. Some primality testing algorithms. Preprint, Queens' College, Cambridge, 1993.
30. C. Pomerance. Are there counter-examples to the Baillie-PSW primality test? Dopo Le Parole aangeboden aan Dr. A. K. Lenstra. Privately published Amsterdam, 1984.
31. C. Pomerance, J. L. Selfridge, and S. S. Wagstaff, Jr. The pseudoprimes to 25 · 109. Math. Comp., 35(151):1003-1026, 1980.
32. H. Postl. Fast evaluation of Dickson polynomials. In Contributions to General Algebra, 6, pages 223-225. Hölder-Pichler-Tempsky, Vienna, 1988.
33. P. Ribenboim. The New Book of Prime Number Records. Springer-Verlag, New York, 1996.
34. A. Schönhage and V. Strassen. Schnelle Multiplikation grosser Zahlen. Computing (Arch. Elektron. Rechnen), 7:281-292, 1971.
35. L. Somer. On Lucas d-pseudoprimes. In Applications of Fibonacci Numbers, Vol. 7 (Graz, 1996), pages 369-375. Kluwer, Dordrecht, 1998.
36. H. C. Williams. Édouard Lucas and Primality Testing. Wiley, New York, 1998.