slow. If the user is willing to tolerate an arbitrarily small chance that the number found is not a prime number but a pseudoprime, it is possible to use the much faster and simpler Fermat primality test. References External links W. F. Galway and Jan Feitsma, Tables of pseudoprimes to base 2 and related data (comprehensive list of all pseudoprimes to base 2 below 264, including factorization, strong pseudoprimes, and Carmichael numbers) A research for pseudoprime Pseudoprimes Asymmetric-key algorithms