Average case error estimates for the strong probable prime test

  • Damgård I
  • Landrock P
  • Pomerance C
59Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

Abstract

Consider a procedure that chooses k -bit odd numbers independently and from the uniform distribution, subjects each number to t independent iterations of the strong probable prime test (Miller-Rabin test) with randomly chosen bases, and outputs the first number found that passes all t tests. Let p k , t {p_{k,t}} denote the probability that this procedure returns a composite number. We obtain numerical upper bounds for p k , t {p_{k,t}} for various choices of k, t and obtain clean explicit functions that bound p k , t {p_{k,t}} for certain infinite classes of k, t . For example, we show p 100 , 10 ≤ 2 − 44 , p 300 , 5 ≤ 2 − 60 , p 600 , 1 ≤ 2 − 75 {p_{100,10}} \leq {2^{ - 44}},{p_{300,5}} \leq {2^{ - 60}},{p_{600,1}} \leq {2^{ - 75}} , and p k , 1 ≤ k 2 4 2 − k {p_{k,1}} \leq {k^2}{4^{2 - \sqrt k }} for all k ≥ 2 k \geq 2 . In addition, we characterize the worst-case numbers with unusually many "false witnesses" and give an upper bound on their distribution that is probably close to best possible.

Cite

CITATION STYLE

APA

Damgård, I., Landrock, P., & Pomerance, C. (1993). Average case error estimates for the strong probable prime test. Mathematics of Computation, 61(203), 177–194. https://doi.org/10.1090/s0025-5718-1993-1189518-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free