On Sun, 24 Jun 2001, Pavel Kankovsky wrote:
> Using a prime number for k eliminates this risk for a very small price.
> After all the set of primes is quite dense for reasonable values (<1000)
> and you can always find a prime close to the number you want to use.
If course I assume the prime number used is high enough to be different
from 2, 3, or perhaps 5, because these small primes are likely to have
gcd(k, p) > 1.
--Pavel Kankovsky aka Peak [ Boycott Microsoft--http://www.vcnet.com/bms ]
"Resistance is futile. Open your source code and prepare for assimilation."
