Primality Testing and Jacobi Sums

DOI10.2307/2007581zbMath0578.10004OpenAlexW4214850390WikidataQ62397497 ScholiaQ62397497MaRDI QIDQ3699757

Henri Cohen, Hendrik W. jun. Lenstra

Publication date: 1984

Full work available at URL: https://doi.org/10.2307/2007581

zbMATH Keywords

efficiencyJacobi sumscomputational number theoryprimality testingversion of Adleman-Pomerance-Rumely algorithm

Mathematics Subject Classification ID

Other character sums and Gauss sums (11T24) Factorization; primality (11A51) Primality (11Y11)

Related Items

Explicit factorization of \(x^{2^ k}+1\) over \(F_ p\) with prime \(p\equiv 3\bmod 4\), Sharpening ``Primes is in P for a large family of numbers, Algorithms in Algebraic Number Theory, Computational Number Theory, Past, Present, and Future, Tables of Fibonacci and Lucas factorizations, Primality test for numbers \(M\) with a large power of 5 dividing \(M^{4}-1\)., Some uses of microcomputers in number theory research, An intelligent choice of witnesses in the Miller-Rabin primality test. Reinforcement learning approach, Finding strong pseudoprimes to several bases, Primality test for numbers of the form \(A p^n + w_n\), The Factorization of the Ninth Fermat Number, Elliptic Curves and Primality Proving, Primality testing, A faster pseudo-primality test, Explicit Bounds for Primality Testing and Related Problems, An 𝑂̃(log²(𝑁)) time primality test for generalized Cullen numbers, Implementing the asymptotically fast version of the elliptic curve primality proving algorithm, Recent developments in primality proving, Factoring on a computer, A one-parameter quadratic-base version of the Baillie-PSW probable prime test