home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.crypt
- Path: sparky!uunet!math.fu-berlin.de!unidui!rrz.uni-koeln.de!Germany.EU.net!mcsun!fuug!funic!news.cs.hut.fi!cs.hut.fi!Ari.Huttunen
- From: Ari.Huttunen@hut.fi (Ari Huttunen)
- Subject: Re: Prime generation, a possible weakness in PGP?
- In-Reply-To: ahaley@eo17's message of Fri, 9 Oct 1992 16:01:50 GMT
- Message-ID: <ARI.HUTTUNEN.92Oct11211134@cardhu.cs.hut.fi>
- Lines: 25
- Sender: usenet@cs.hut.fi (Uutis Ankka)
- Organization: Helsinki University of Technology, Finland
- References: <ARI.HUTTUNEN.92Sep27174550@laphroaig.cs.hut.fi>
- <1992Oct9.160150.13377@eoc.com>
- Distribution: alt
- Date: Sun, 11 Oct 1992 19:11:37 GMT
-
- 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>
-