[19108] in cryptography@c2.net mail archive
RE: Fermat's primality test vs. Miller-Rabin
daemon@ATHENA.MIT.EDU (Anton Stiglic)
Mon Dec 5 10:12:56 2005
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
From: "Anton Stiglic" <astiglic@okiok.com>
To: "'Joseph Ashwood'" <ashwood@msn.com>, <cryptography@metzdowd.com>
Date: Mon, 5 Dec 2005 08:13:28 -0500
In-Reply-To: <BAY0-SMTP07FE569D399BC04F2B0C42AC4E0@phx.gbl>
>Ok after making that change, and a few others. Selecting only odd numbers
>(which acts as a small seive) I'm not getting much useful information. It
>appears to be such that at 512 bits if it passes once it passes 128 times,
>and it appears to fail on average about 120-130 times, so the sieve
>amplifies the values more than expected. Granted this is only a test of the
>generation of 128 numbers, but I got 128 primes (based on 128 MR rounds).
O.k., so if I read this right, your new results concord with the analysis of
Pomerance et al. That would make much more sense.
When you say "on average about 120-130 times the test fails", out of how
many is that?
--Anton
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
