From: Nathan Zook <nzook@bga.com>
To: aba@atlas.ex.ac.uk
Message Hash: dc3cec1c6b6a18f48ebfd4d0bb9aca68a69385bdc211476dc75d0553d0a6a327
Message ID: <Pine.3.89.9508082313.C4312-0100000@lia.bga.com>
Reply To: <15295.9508081711@exe.dcs.exeter.ac.uk>
UTC Datetime: 1995-08-09 04:40:35 UTC
Raw Date: Tue, 8 Aug 95 21:40:35 PDT
From: Nathan Zook <nzook@bga.com>
Date: Tue, 8 Aug 95 21:40:35 PDT
To: aba@atlas.ex.ac.uk
Subject: Re: Prime Number Gen's.
In-Reply-To: <15295.9508081711@exe.dcs.exeter.ac.uk>
Message-ID: <Pine.3.89.9508082313.C4312-0100000@lia.bga.com>
MIME-Version: 1.0
Content-Type: text/plain
On Tue, 8 Aug 1995 aba@atlas.ex.ac.uk wrote:
>
> "Rev. Ben" <samman@cs.yale.edu> writes on cpunks:
> > Does anyone know of where I could get source, royalty free, in the US for
> > a good Prime Number Generator?
>
> GNU code sounds like it would fit the royalty free bill.
>
> Try the GNU multi-precision library: gmp-1.3.2.tar.gz from all good
> GNU sources. I get my stuff from ftp://src.doc.ic.ac.uk/gnu/ if you
> don't have a GNU ftp site to hand.
>
> There's a function
>
> int mpz_probab_prime_p(mpnum, SURETY)
>
> which returns true if the prime passes SURETY probablistic prime tests.
>
> I think if it passes say 25 tests, then there will be less than a
> 1/2^25 chance that it is not prime.
>
> Also, on:
>
> http://dcs.ex.ac.uk/~aba/rsa-keygen.html
>
The proper thing to do is to then search for a number which demonstrates
p is prime....
Nathan
Return to August 1995
Return to “Ray Cromwell <rjc@clark.net>”