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

DOI10.2307/2008371zbMATH Open0674.10001OpenAlexW4238477868MaRDI QIDQ3828063FDOQ3828063

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

Publication date: 1989

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

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

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)

Cites Work

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

Cited In (4)

• Fast Primality Tests for Numbers Less Than 50 ⋅10 9
• Statistical Evidence for Small Generating Sets
• 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)