Implementation of a New Primality Test
- 1 January 1987
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 48 (177), 103-121, S1
- https://doi.org/10.2307/2007877
Abstract
An implementation of the Cohen-Lenstra version of the Adleman-Pomerance-Rumely primality test is presented. Primality of prime numbers of up to 213 decimal digits can now routinely be proved within approximately ten minutes.Keywords
This publication has 7 references indexed in Scilit:
- Factorizations of 𝑏ⁿ±1, 𝑏=2, 3, 5, 6, 7, 10, 11, 12 Up to High PowersContemporary Mathematics, 1988
- Divisors in Residue ClassesMathematics of Computation, 1984
- Primality Testing and Jacobi SumsMathematics of Computation, 1984
- On Distinguishing Prime Numbers from Composite NumbersAnnals of Mathematics, 1983
- Primality testing algorithms [after Adleman, Rumely and Williams]Published by Springer Nature ,1981
- Probabilistic algorithm for testing primalityJournal of Number Theory, 1980
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977