A Probable Prime Test with High Confidence

Journal of Number Theory

Volumn 72, Issue 1, 1998, Pages 32-47

  Grantham, Jon ^a  

^a INSTITUTE FOR DEFENSE ANALYSES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001899857     PISSN: 0022314X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jnth.1998.2247     Document Type: Article

References (13)

1. Adams W. W., Shanks D. Strong primality tests that are not sufficient. Math. Comp. 39:1982;255-300.
2. Arnault F. The Rabin-Monier theorem for Lucas pseudoprimes. Math. Comp. 66:1997;869-881.
3. Atkin A. O. L. Intelligent primality test offer. Computational Perspectives on Number Theory. Proceedings of a Conference in Honor of A. O. L. Atkin. 1998;International Press. p. 1-11.
4. Beauchemin P., Brassard G., Crépeau C., Goutier C., Pomerance C. The generation of random numbers that are probably prime. Journal of Cryptography. 1:1988;53-64.
5. J. Grantham, Frobenius Pseudoprimes.
6. Guy R. K. Unsolved Problems in Number Theory, Second Edition. 1994;Springer-Verlag, New York. p. 28.
7. Knuth Donald E. The Art of Computer Programming, Seminumerical Algorithms, Second Edition. 1981;Addison-Wesley. p. 444-451.
8. Zheiyu, Mo, James. P. Jones, A new primality test using Lucas sequences.
9. Monier Louis. Evaluation and comparison of two efficient probabilistic primality testing algorithms. Theoretical Computer Science. 12:1980;97-108.
10. mn) via Lucas chains.
11. Pomerance Carl. Are there counter-examples to the Baillie - PSW primality test? Lenstra H. W. Jr., Lenstra J. K., Van Emde Boas P. Dopo Le Parole aangeboden aan Dr. A. K. Lenstra. 1984.
12. 9. Math. Comp. 35:1980;1003-1026.
13. Rabin Michael O. Probabilistic algorithm for testing primality. J. Number Theory. 12:1980;128-138.