[12691] in cryptography@c2.net mail archive
Re: Proven Primes
daemon@ATHENA.MIT.EDU (Bill Stewart)
Fri Mar 7 15:39:58 2003
X-Original-To: cryptography@wasabisystems.com
X-Original-To: cryptography@wasabisystems.com
Date: Fri, 07 Mar 2003 10:40:37 -0800
To: Cryptography <cryptography@wasabisystems.com>
From: Bill Stewart <bill.stewart@pobox.com>
In-Reply-To: <3E686E90.1000500@algroup.co.uk>
>>>And the proof?
>>
>>Sorry, an exercise for the student. :-)
>>I thought that finding them was the hard part, and verifying one once found
>>was relatively easy. I used the probable prime test in the Java BigInteger
>>package. It sounds like, from some of the list traffic, that there are
>>better tests.
Well, it's harder in that to find a prime or SG prime,
you need to try the probable prime test on bunch of candidates until one
passes.
With the Java BigInteger probable prime package, can you specify what
probability
it uses for primality (i.e. the probability is 2**-N or 4**-N, what's N?)
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@wasabisystems.com
