The Probability that a Random Probable Prime is Composite

DOI10.2307/2008733MaRDI QIDQ4205482zbMATHOpenAlexFDO

Authors Su Hee Kim, Carl Pomerance

Publication date 1989

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

zbMATH Keywords

primality testCarmichael numbercomputational number theoryprobable prime

Mathematics Subject Classification ID

Factorization; primality (11A51) Primality (11Y11)

Recommendations

• Average Case Error Estimates for the Strong Probable Prime Test
• Recent developments in primality testing
• scientific article; zbMATH DE number 708818
• Improved error bounds for the Fermat primality test on random inputs
• scientific article; zbMATH DE number 721898

Cites work

• Approximate formulas for some functions of prime numbers
• Evaluation and comparison of two efficient probabilistic primality testing algorithms
• On the Number of False Witnesses for a Composite Number
• Probabilistic algorithm for testing primality
• The generation of random numbers that are probably prime

Cited in

(8)

• scientific article; zbMATH DE number 708818 (Why is no real title available?)
• Pseudoprime Statistics to 1019
• Fast generation of prime numbers and secure public-key cryptographic parameters.
• Improved error bounds for the Fermat primality test on random inputs
• The reciprocal sum of the amicable numbers
• Prime-number algorithm for public-key systems
• Finding large primes
• Average Case Error Estimates for the Strong Probable Prime Test

This page was built for publication: The Probability that a Random Probable Prime is Composite

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