[1503] in cryptography@c2.net mail archive
Re: Speeding up DH
daemon@ATHENA.MIT.EDU (Adept)
Tue Sep 16 14:56:04 1997
Date: Tue, 16 Sep 1997 04:48:26 -0400 (EDT)
From: Adept <adept@cep.yale.edu>
To: Bill Frantz <frantz@netcom.com>
cc: Phil Karn <karn@qualcomm.com>, colin@nyx.net, cryptography@c2.net,
stewarts@ix.netcom.com
In-Reply-To: <v03007837b042649b8d7c@[207.94.249.39]>
> >The DH moduli I generated for Photuris a while back used random() to
> >generate a random starting point, and then searched forward from that
> >point using an overlaid sieve to find the first prime p for which
> >(p-1)/2 was also prime. I suppose it would have been better to pick an
> >"open" starting point, but I didn't know that it was possible to pick
> >a "devious" DH moduli -- is it?
I'm sure someone has already noted this, but, with this sort of search you
will have certain primes that are more likely--such as those that fall at
the end of a long sequence of composite numbers.
Ben.
