The Probability that a Random Probable Prime is Composite

DOI10.2307/2008733zbMATH Open0687.10001OpenAlexW4239726834MaRDI QIDQ4205482FDOQ4205482

Carl Pomerance, Su Hee Kim

Publication date: 1989

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

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

zbMATH Keywords

primality testCarmichael numbercomputational number theoryprobable prime

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• Fast generation of prime numbers and secure public-key cryptographic parameters.
• Title not available (Why is that?)
• The reciprocal sum of the amicable numbers
• Improved error bounds for the Fermat primality test on random inputs
• Average Case Error Estimates for the Strong Probable Prime Test
• Pseudoprime Statistics to 1019
• Prime-number algorithm for public-key systems

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)