Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes

DOI10.2307/2008371MaRDI QIDQ3828063zbMATH OpenOpenAlexFDO

Authors János Pintz, William Steiger, Endre Szemerédi

Publication date 1989

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

zbMATH Keywords

fast algorithmcomplexitycryptographycomputational number theoryrandom algorithmsfast primality testsquick generation of large primes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Primes (11A41) Software, source code, etc. for problems pertaining to number theory (11-04)

Recommendations

• scientific article; zbMATH DE number 697832
• Primality testing using elliptic curves
• Recent developments in primality testing
• Fast generation of prime numbers and secure public-key cryptographic parameters.
• scientific article; zbMATH DE number 16481

Cites work

• scientific article; zbMATH DE number 3630832 (Why is no real title available?)
• scientific article; zbMATH DE number 3799728 (Why is no real title available?)
• Fast multiplication of large numbers
• Large values of Dirichlet polynomials, IV
• New Primality Criteria and Factorizations of 2 m ± 1
• On distinguishing prime numbers from composite numbers
• On prime numbers in an arithmetic progression with a prime-power difference
• Probabilistic algorithm for testing primality
• Recognizing primes
• Riemann's hypothesis and tests for primality
• Topics in multiplicative number theory
• Very Short Primality Proofs

Cited in

(4)

• Statistical Evidence for Small Generating Sets
• Fast Primality Tests for Numbers Less Than 50 ⋅10 9
• Infiniteness sets of primes, admitting diophantine representations in eight variables
• A lower bound for primality

This page was built for publication: Infinite Sets of Primes with Fast Primality Tests and Quick Generation of Large Primes

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