scientific article; zbMATH DE number 708818

MaRDI QIDQ4318709zbMATH OpenFDO

Authors Jørgen Brandt, Ivan B. Damgård

Publication date 14 September 1995

zbMATH Keywords

algorithmbound on the error probabilityexplicit upper boundsgaps between consecutive primesgeneration of probable primesHardy and Littlewood prime \(r\)-tuple conjectureprimality tests

Mathematics Subject Classification ID

Primality (11Y11) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• The Probability that a Random Probable Prime is Composite
• scientific article; zbMATH DE number 697832
• scientific article; zbMATH DE number 721898
• Average Case Error Estimates for the Strong Probable Prime Test
• scientific article; zbMATH DE number 4049704

Cited in

(10)

• The generation of random numbers that are probably prime
• Analyzing Standards for RSA Integers
• The Probability that a Random Probable Prime is Composite
• scientific article; zbMATH DE number 721898 (Why is no real title available?)
• Dirichlet’s proof of the three-square theorem: An algorithmic perspective
• Finding large primes
• Finding large primes
• Close to uniform prime number generation with fewer random bits
• Information Security Practice and Experience
• From worst to average case to incremental search bounds of the strong Lucas test

This page was built for publication:

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