Algorithm used by BigInteger prime generator?

[Alexandre Oliva]

On Apr 20, 1999, Paul Fisher <rao at gnu.org> wrote:

> Alexandre Oliva <oliva at dcc.unicamp.br> writes:
>> Does anybody know what algorithm the constructor
>> java.math.BigInteger.BigInteger(int bitLength, int certainty, Random
>> rnd) is supposed to use?

> Sun's java.math implementation uses Colin Plumb's <colin at nyx.net>
> BigNum library <URL:ftp://skip.incog.com/pub/bnlib-1.1.tar.gz>.
> You'll find the prime number generation routines there.

Thanks for the pointer.  BTW, this is GPLed, did Sun get a special
license from Colin Plumb?

> Implementing the algorithm for Classpath is on my TODO list.
> Although, if you're interested in writing it, we'd love to include
> it. :)

Well, I'm currently writing it for Kaffe, but if it fits well into
Classpath, or requires a just little adaptation, I'd be glad to
contribute it to Classpath too.

-- 
Alexandre Oliva http://www.dcc.unicamp.br/~oliva IC-Unicamp, Brasil
{oliva,Alexandre.Oliva}@dcc.unicamp.br  aoliva@{acm.org,computer.org}
oliva@{gnu.org,kaffe.org,{egcs,sourceware}.cygnus.com,samba.org}
*** E-mail about software projects will be forwarded to mailing lists