* Charlie Kaufman:
> The probability of a single run of Miller-Rabin or Fermat not
> detecting that a randomly chosen number is composite is almost
> vanishingly small.
How do you chose a random integer, that this, based on which
probability distribution? 8-)
Anyway, one can show that for some f
(resending after bounce)
-Original Message-
From: Charlie Kaufman
Sent: Tuesday, November 08, 2005 3:11 PM
To: 'Travis H.'; 'cryptography@metzdowd.com'
Subject: RE: Fermat's primality test vs. Miller-Rabin
>Is that the distinction that makes
>Miller-Rabin a stronger primality test?
Yes.
