Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

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

 

 

Primality testing and Jacobi sums


Authors: H. Cohen and H. W. Lenstra
Journal: Math. Comp. 42 (1984), 297-330
MSC: Primary 11Y11; Secondary 11A51
DOI: https://doi.org/10.1090/S0025-5718-1984-0726006-X
MathSciNet review: 726006
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: We present a theoretically and algorithmically simplified version of a primality testing algorithm that was recently invented by Adleman and Rumely. The new algorithm performs well in practice. It is the first primality test in existence that can routinely handle numbers of hundreds of decimal digits.


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

DOI: https://doi.org/10.1090/S0025-5718-1984-0726006-X
Keywords: Primality testing, Jacobi sum
Article copyright: © Copyright 1984 American Mathematical Society