The Pseudoprimes to 25 ⋅10 9
From MaRDI portal
Publication:3887519
DOI10.2307/2006210zbMath0444.10007OpenAlexW4234938468WikidataQ54275332 ScholiaQ54275332MaRDI QIDQ3887519
John L. Selfridge, Samuel S. jun. Wagstaff, Carl B. Pomerance
Publication date: 1980
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2006210
Software, source code, etc. for problems pertaining to number theory (11-04) Factorization; primality (11A51) Primality (11Y11)
Related Items
Improvements to RSA key generation and CRT on embedded devices, Hidden multiscale order in the primes, Compositeness test with nodal curves, Primitive abundant and weird numbers with many prime factors, A nonlinear public key cryptosystem, Primality testing of large numbers in Maple, Strong pseudoprimes to the first eight prime bases, Unnamed Item, On Carmichael and polygonal numbers, Bernoulli polynomials, and sums of base-$p$ digits, The generation of random numbers that are probably prime, Unnamed Item, Building pseudoprimes with a large number of prime factors, Lucas Pseudoprimes, On the Distribution of Pseudoprimes, Strong pseudoprimes to twelve prime bases, Certifying giant nonprimes, Unnamed Item, Fast tabulation of challenge pseudoprimes, Arithmetical progressions formed from three different Euler pseudoprimes for the odd base a, Recent developments in primality testing, Finding strong pseudoprimes to several bases, Frobenius pseudoprimes, The influence of computers in the development of number theory, Carmichael numbers with \(p+1\mid n+1\), Primality test for numbers of the form \(A p^n + w_n\), On Strong Pseudoprimes to Several Bases, Density of Carmichael numbers with three prime factors, The structure factor of primes, Notes on some new kinds of pseudoprimes, The error probability of the Miller-Rabin primality test, Finding 𝐶₃-strong pseudoprimes, ON CARMICHAEL NUMBERS IN ARITHMETIC PROGRESSIONS, On the effectiveness of a generalization of Miller's primality theorem, Two kinds of strong pseudoprimes up to $10^{36}$, Two contradictory conjectures concerning Carmichael numbers, SYLOW p-PSEUDOPRIMES TO SEVERAL BASES FOR SEVERAL PRIMES p, Finding strong pseudoprimes to several bases. II, Rabin-Miller Primality Test: Composite Numbers Which Pass It, Explicit Bounds for Primality Testing and Related Problems, An unconditional improvement to the running time of the quadratic Frobenius test, Some new kinds of pseudoprimes, Prime-number algorithm for public-key systems, A probable prime test with high confidence, Some thoughts on pseudoprimes, Average liar count for degree-$2$ Frobenius pseudoprimes, Primality tests, linear recurrent sequences and the Pell equation, Strengthening the Baillie-PSW primality test, On the Number of Elliptic Pseudoprimes, The Rabin-Monier theorem for Lucas pseudoprimes, Strong pseudoprimes to base 2, An Overview of Factoring, Constructing Carmichael numbers through improved subset-product algorithms, Carmichael's ``Empirical Theorem, A one-parameter quadratic-base version of the Baillie-PSW probable prime test, Short effective intervals containing primes
