Primality testing with Gaussian periods

DOI10.4171/JEMS/861MaRDI QIDQ1737980zbMATH OpenWikidataFDO

Authors H. W. jun. Lenstra, Carl Pomerance

Publication date 24 April 2019

Published in Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4171/JEMS/861

zbMATH Keywords

primality testingconstructing finite fieldscontinuous Frobenius problemperiod systempseudo field

Mathematics Subject Classification ID

Primes in congruence classes (11N13) Primality (11Y11) Inverse problems of additive number theory, including sumsets (11P70)

Recommendations

• scientific article; zbMATH DE number 1954367
• A fast algorithm for Gaussian periods
• Orders of Gauss periods in finite fields
• Searching for Primitive Roots in Finite Fields
• scientific article; zbMATH DE number 2123628

Cites work

• scientific article; zbMATH DE number 1703931 (Why is no real title available?)
• scientific article; zbMATH DE number 3882549 (Why is no real title available?)
• scientific article; zbMATH DE number 3873430 (Why is no real title available?)
• scientific article; zbMATH DE number 3943939 (Why is no real title available?)
• scientific article; zbMATH DE number 3943948 (Why is no real title available?)
• scientific article; zbMATH DE number 3708485 (Why is no real title available?)
• scientific article; zbMATH DE number 4123827 (Why is no real title available?)
• scientific article; zbMATH DE number 2086896 (Why is no real title available?)
• scientific article; zbMATH DE number 3279238 (Why is no real title available?)
• scientific article; zbMATH DE number 3333393 (Why is no real title available?)
• scientific article; zbMATH DE number 3018543 (Why is no real title available?)
• scientific article; zbMATH DE number 3066012 (Why is no real title available?)
• Detecting perfect powers by factoring into coprimes
• Fast Multiple-Precision Evaluation of Elementary Functions
• Fast computation of special resultants
• Fast construction of irreducible polynomials over finite fields
• Fast multiplication and its applications
• Kloosterman sums and Fourier coefficients of cusp forms
• Modern computer algebra
• On the difference between consecutive primes
• PRIMES is in P
• Proving primality in essentially quartic random time
• Sharpening ``Primes is in P for a large family of numbers
• THE CONTINUOUS POSTAGE STAMP PROBLEM
• The large sieve
• When the sieve works

Cited in

(19)

• Generating random factored Gaussian integers, easily
• A logarithmic improvement in the Bombieri-Vinogradov theorem
• On Toric Orbits in the Affine Sieve
• The least primitive roots mod p
• The minimal polynomial of 2 ( /q) and Dickson polynomials
• There are infinitely many Perrin pseudoprimes
• scientific article; zbMATH DE number 1954367 (Why is no real title available?)
• A variant of the Bombieri-Vinogradov theorem with explicit constants and applications
• Primality proving using elliptic curves with complex multiplication by imaginary quadratic fields of class number three
• Fermat test with Gaussian base and Gaussian pseudoprimes.
• Improved space bounds for subset sum
• Polynomial formulations as a barrier for reduction-based hardness proofs
• On some subgroups of the multiplicative group of finite rings
• Algorithms for the Multiplication Table Problem
• A fast algorithm for Gaussian periods
• Two algorithms to find primes in patterns
• On some algebraic ways to calculate zeros of the Riemann zeta function
• On a modification of the Lucas primality test
• A framework for deterministic primality proving using elliptic curves with complex multiplication

This page was built for publication: Primality testing with Gaussian periods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1737980)