论文信息 - Faster Primality Testing (Extended Abstract)

Faster Primality Testing (Extended Abstract)

Several major improvements to the Jacobi sum primality testing algorithm will speed it up in such a way that proving primality of primes of up to 500 digits will be a matter of routine. Primes of about 800 digits will take at most one night on a Cray.

Wieb Bosma | Marc-Paul van der Hulst

[1] H. Lenstra,et al. Primalitv Testing and Jacobi Sums , 2010 .

[2] M. Rabin. Probabilistic algorithm for testing primality , 1980 .

[3] Faculteit der Wiskunde en Natuurwetenschappen,et al. Divisors in residue classes , 1983 .

[4] Gary L. Miller. Riemann's Hypothesis and Tests for Primality , 1976, J. Comput. Syst. Sci..

[5] Joe Kilian,et al. Almost all primes can be quickly certified , 1986, STOC '86.

[6] Harvey Dubner,et al. The primality of R1031 , 1986 .

[7] E. Bach. Analytic methods in the analysis and design of number-theoretic algorithms , 1985 .

[8] Leonard M. Adleman,et al. Recognizing primes in random polynomial time , 1987, STOC.

[9] A. K. Lenstra,et al. Implementation of a New Primality Test , 1985 .

[10] Gary L. Miller,et al. Riemann's Hypothesis and tests for primality , 1975, STOC.

[11] D. Bernstein. DISTINGUISHING PRIME NUMBERS FROM COMPOSITE NUMBERS , 2022 .