The probability that a random probable prime is composite

No abstract is available for this paper.

• Publication year

  1989

• Venue

  Mathematics of Computation

• Publication date

  1989-01-13

• Fields of study

  Not labeled

• Identifiers
  DOI 10.1090/S0025-5718-1989-0982368-4
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• On the number of false witnesses for a composite number

  1986cited by this paper
• Evaluation and Comparison of Two Efficient Probabilistic Primality Testing Algorithms

  1980cited by this paper
• Probabilistic algorithm for testing primality

  1980cited by this paper
• Approximate formulas for some functions of prime numbers

  1962cited by this paper

• Average case error estimates of the strong Lucas test

  2024influential citation
• THE RECIPROCAL SUM OF THE AMICABLE NUMBERS 3 Lemma 2

  2018cites this paper
• Handbook of Applied Cryptography

  2018cites this paper
• Some primality testing algorithms ∗†

  2018cites this paper
• The reciprocal sum of the amicable numbers

  2018cites this paper
• Novel Cryptosystems Based on Two Different Mod Values

  2017cites this paper
• Post-quantum RSA

  2017cites this paper
• Quadratic Frobenius probable prime tests costing two selfridges

  2017cites this paper
• Improved error bounds for the Fermat primality test on random inputs

  2016influential citation
• The Efficient Calculation of a Combined Fermat PRP and Lucas PRP Test

  2014cites this paper
• The Recognition of Primes

  2011cites this paper
• A Computational Introduction to Number Theory and Algebra: Quadratic reciprocity and computing modular square roots

  2008influential citation
• ABSOLUTE QUADRATIC PSEUDOPRIMES

  2007cites this paper
• An Extended Quadratic Frobenius Primality Test with Average- and Worst-Case Error Estimate

  2006cites this paper
• about the Internet and Networking : 2010 – 2019

  2003cites this paper
• Lectures on Data Security

  2003influential citation
• Algorithmics for Hard Problems

  2002cites this paper
• Primality Tests on Commutator Curves

  2001cites this paper
• On Assessing the Performance of Randomized Algorithms

  2000cites this paper
• Signature schemes based on the strong RSA assumption

  1999cites this paper
• Primality Tests and Use of Primes in Public-Key Systems

  1998cites this paper
• Fast Generation Of Random, Strong RSA Primes

  1997cites this paper
• Proactive Security : Long-term Protection Against Break

  1997cites this paper
• Prime-number algorithm for public-key systems

  1995cites this paper
• Fast generation of prime numbers and secure public-key cryptographic parameters

  1995influential citation
• Average case error estimates for the strong probable prime test

  1993influential citation
• Speeding up Prime Number Generation

  1991cites this paper
• Finding Four Million Large Random Primes

  1990cites this paper