Implementation of a new primality test
From MaRDI portal
Publication:3748326
DOI10.1090/S0025-5718-1987-0866102-2zbMath0608.10001OpenAlexW2032521550MaRDI QIDQ3748326
Publication date: 1987
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-1987-0866102-2
prime numberscomputational number theorylarge integersAdleman-Pomerance-Rumely primality testimplementation of Cohen-Lenstra version
Software, source code, etc. for problems pertaining to number theory (11-04) Factorization; primality (11A51) Primality (11Y11)
Related Items
Fast generation of prime numbers and secure public-key cryptographic parameters., A RECURSIVE FORMULA CONCERNING THE GREATEST PRIME NUMBER LESS THAN OR EQUAL TO AN ODD NUMBER n, Algorithms in Algebraic Number Theory, The generation of random numbers that are probably prime, Computational Number Theory, Past, Present, and Future, Primality test for numbers \(M\) with a large power of 5 dividing \(M^{4}-1\)., Some uses of microcomputers in number theory research, Finding strong pseudoprimes to several bases, The Factorization of the Ninth Fermat Number, Elliptic Curves and Primality Proving, Speeding up the computations on an elliptic curve using addition-subtraction chains, Factoring with the quadratic sieve on large vector computers, A one-parameter quadratic-base version of the Baillie-PSW probable prime test
