🚀 go-pugleaf

In article <1992Oct9.160150.13377@eoc.com> ahaley@eo17 (Andrew Haley) writes:

! Large pseudoprimes (of any base) are very rare indeed. 

Are pseudoprimes to base X, where X is large more rare than
pseudoprimes to base Y, where Y is small.

! wrong.)  In any case, it is likely that a composite p or q would cause
! messages to not decrypt correctly, a fact that you'd soon notice.

Perhaps, but I wouldn't bet on it, unless I got some proof.

! It might be worth using the Miller-Rabin test, in which no analogues
! of Carmichael numbers exist, as a backup.  This would be easy to add
! to the search procedure, but I don't think that it's really necessary.

I have some code that does exactly that (uses the Miller test). The 
reason I became worried was that Kenneth Rosen incorrectly states
in his book that "If n is composite the probability that n passes
all k tests is less than (1/4)^k." This is incorrect as was pointed out.
--
...............................................................................
Ari Huttunen   			       Any similarity to other alien life forms
				          is purely coincidental.
					      <Alien 3 misquote>