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

DOI10.2307/2008371zbMath0674.10001OpenAlexW4238477868MaRDI QIDQ3828063

William Steiger, János Pintz

Publication date: 1989

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

zbMATH Keywords

complexitycryptographyfast algorithmcomputational number theoryrandom algorithmsfast primality testsquick generation of large primes

Mathematics Subject Classification ID

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

Related Items (2)

A lower bound for primality ⋮ Infiniteness sets of primes, admitting diophantine representations in eight variables

Cites Work

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

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