Primality Testing and Jacobi Sums
- 1 January 1984
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 42 (165), 297-330
- https://doi.org/10.2307/2007581
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.Keywords
This publication has 13 references indexed in Scilit:
- Divisors in Residue ClassesMathematics of Computation, 1984
- On Distinguishing Prime Numbers from Composite NumbersAnnals of Mathematics, 1983
- Primality testing algorithms [after Adleman, Rumely and Williams]Published by Springer Science and Business Media LLC ,1981
- On Fermat's Quotient, Base TwoMathematics of Computation, 1981
- Probabilistic algorithm for testing primalityJournal of Number Theory, 1980
- A bound for the least prime ideal in the Chebotarev Density TheoremInventiones Mathematicae, 1979
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977
- Riemann's hypothesis and tests for primalityJournal of Computer and System Sciences, 1976
- Strong Carmichael numbersJournal of the Australian Mathematical Society, 1976
- On the Quadratic Character of a PolynomialJournal of the London Mathematical Society, 1967