A one-parameter quadratic-base version of the Baillie–PSW probable prime test

by Zhenxiang Zhang
Venue:Math. Comp
Citations:2 - 0 self

Documents Related by Co-Citation

5 A New Lower Bound for the Pseudoprime Counting Function – Carl Pomerance - 1982
3 Evaluation and Comparison of two e cient probabilistic primality testing algorithms – Louis Monier - 1980
2 The pseudoprimes below 2 64 – William F. Galway
2 A Probable Prime Test with High Con dence. Journal of Number Theory 72 – Jon Grantham - 1998
2 On the Converse of Fermat's Theorem – Paul Erd®s - 1949
2 Tables of pseudoprimes and related data – William F Galway - 2002
2 On Pseudoprimes which are Products of Distinct Primes – Kazimierz Szymiczek - 1967
20 On the distribution of pseudoprimes – C Pomerance - 1981
12 Two contradictory conjectures concerning Carmichael numbers – Andrew Granville, Carl Pomerance
855 An Introduction to the Theory of Numbers – G H Hardy, E M Wright - 1979
137 Prime Numbers: A Computational Perspective – Richard Crandall, Carl Pomerance - 2005
222 Introduction to analytic and probabilistic number theory, Cambridge Studies – Gérald Tenenbaum - 1995
9 The distribution of Lucas and elliptic pseudoprimes – Daniel M. Gordon, et al. - 2001
4 Fast Exponentiation Using Data Compression – Yacov Yacobi - 1998
3 Factoring integers before computers – H C Williams, J O Shallit - 1994
4 Fast Algorithms for Matrix Multiplication Using Pseudo-Number-Theoretic Transforms – A E Yagle - 1995
1 Private communication – P Wellin - 1998
1 Factorization of the numbers of the form m 3 – REFERENCES - 1998
4 Multiplicative, congruential random-number generators with multiplier +- 2^k1 +-2^k2 and modulus 2^p-1 – P Wu - 1997