🚀 go-pugleaf

I am concerned about the primeness of the prime numbers
that PGP generates. This is how they are done:
	- first throw away numbers that are divisible
	  by small primes
	- then use Fermat's theorem 4 times
	  (Fermat's theorem:  if  b**(n-1) != 1 (mod n), then
	  'n' cannot be a prime. This requires that 'b' and 'n'
	  are relatively prime.)

My concern is the number of rounds of the Fermat test. It's only 4.
I would not trust this level of primeness. Also, the resulting
number might be a Carmichael number. (So it would pass any number
of such tests.) 
--
...............................................................................
Ari Huttunen   			       Any similarity to other alien life forms
				          is purely coincidental.
					      <Alien 3 misquote>