The Probability that a Random Probable Prime is Composite

DOI10.2307/2008733zbMath0687.10001OpenAlexW4239726834MaRDI QIDQ4205482

Su Hee Kim, Carl B. Pomerance

Publication date: 1989

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

zbMATH Keywords

primality testcomputational number theoryCarmichael numberprobable prime

Mathematics Subject Classification ID

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

Related Items (4)

Improved error bounds for the Fermat primality test on random inputs ⋮ Fast generation of prime numbers and secure public-key cryptographic parameters. ⋮ The reciprocal sum of the amicable numbers ⋮ Prime-number algorithm for public-key systems

Cites Work

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

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