Primality testing and Jacobi sums-Reference-Cited by-同舟云学术

Primality testing and Jacobi sums

Published:1984 Issue:165 Volume:42 Page:297-330
ISSN:0025-5718
Container-title:Mathematics of Computation
language:en
Short-container-title:Math. Comp.

Author:

Cohen H.,Lenstra H. W.

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.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,Computational Mathematics,Algebra and Number Theory

Link

http://www.ams.org/mcom/1984-42-165/S0025-5718-1984-0726006-X/S0025-5718-1984-0726006-X.pdf

Reference26 articles.

1. On distinguishing prime numbers from composite numbers;Adleman, Leonard M.;Ann. of Math. (2),1983

2. New primality criteria and factorizations of 2^{𝑚}±1;Brillhart, John;Math. Comp.,1975

3. On the quadratic character of a polynomial;Burgess, D. A.;J. London Math. Soc.,1967

Cited by 68 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Intelligent Choice of Witnesses in the Miller–Rabin Primality Test. Reinforcement Learning Approach;Lobachevskii Journal of Mathematics;2022-12

2. Computational Number Theory, Past, Present, and Future;Lecture Notes in Mathematics;2022-08-03

3. Prime Test;Financial Mathematics and Fintech;2022

4. Primality Testing;Computational Number Theory and Modern Cryptography;2017-03-17

5. Primality test for numbers of the form Apn+wn;Journal of Discrete Algorithms;2015-07