Hal Finney wrote:
In contrast, finding "strong" primes p such that (p-1)/2 is also prime
does tend to be slow. I think there is a trick to do it using a double
sieve but it is still much slower than finding regular primes.
There is - Geoff Thorpe and I planned to implement it for OpenSSL, but
never got around to it.
--
http://www.apache-ssl.org/ben.html http://www.thebunker.net/
"There is no limit to what a man can do or how far he can go if he
doesn't mind who gets the credit." - Robert Woodruff