Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



Implementation of a new primality test

Authors: H. Cohen and A. K. Lenstra
Journal: Math. Comp. 48 (1987), 103-121, S1
MSC: Primary 11Y11; Secondary 11A51
MathSciNet review: 866102
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

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.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 11Y11, 11A51

Retrieve articles in all journals with MSC: 11Y11, 11A51

Additional Information

Keywords: Primality testing
Article copyright: © Copyright 1987 American Mathematical Society