[GNU Crypto] FYI: Prime

[Casey Marshall]

-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1

I've checked in some changes to Prime and some other classes to avoid
the problem with pseudo-primes posted by Daniel Bleichenbacher. The
summary of changes are:

   * The Miller-Rabin test is no longer optional. Miller-Rabin is a
     good test of primality (AFAIK), and is not particularly slow.

   * The Euclid criterion test (is this Solovay-Strassen?) is
     unchanged, and still used in isProbablePrime (since M-R is always
     used, this shouldn't be a problem).

   * The test with Fermat's little theorem takes an integer argument,
     and runs that many iterations with random bases.

   * The Miller-Rabin test takes an integer argument, which
     corresponds to the number of rounds. This method is also
     reimplemented after the version in the Handbook of Applied
     Cryptography.

   * There is an isProbablePrime version that takes a `certainty'
     integer argument, which corresponds to the number of iterations
     in the Fermat and Miller-Rabin tests.

   * The default value for this certainty parameter is 20. This is
     totally arbitrary and I don't know if this is a good default or
     not.

I've forked off a new branch for the stable 2.0.x series. This will
become 2.0.0 soon, and I might put up some pre-releases for people to
beat to death in the next day or two.

Cheers.

- -- 
Casey Marshall || address@hidden
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.2.3 (GNU/Linux)
Comment: Processed by Mailcrypt 3.5.7 <http://mailcrypt.sourceforge.net/>

iD8DBQFABhcvgAuWMgRGsWsRAiHdAJ9wnosyCsZy40CLOyTZ7daNvHbQiACeLVts
4Yjf3yiXeNIJP9MkBgdwDSw=
=BhQW
-----END PGP SIGNATURE-----