Joppe Bos wrote:
Hello everyone,
I am fairly new with openssl and am trying to write a function which can
make a public / private key pair with GMP (an open source big number
library). I am doing this to compare the running time with openssl. I have
a few questions regarding the openssl genrsa command:
- What kind of random initialisation is being performed to be sure no-one
can predict the output of the random generator?
- Does openssl use "normal" primes of a certain number of bits or is
it generating the so-called strong primes? And if it is generating strong
primes what kinds of algortithm for this generating process is used
(Gordon's algorithm or something else)?
I don't know if recent research has changed this, but last time I
looked, there was no such thing as a 'strong prime' -- according to
the paper on file in the tech library at rsalabs.com the idea of
strong primes was with respect to a certain factoring algorithm,
but newer factoring algorithms now make the idea of 'strong prime'
technically obsolete.
You might take a look at the actual source code for openssl rsa -- I
found it quite interesting, and this should answer your question.
--
Charles B (Ben) Cranston
mailto: [EMAIL PROTECTED]
http://www.wam.umd.edu/~zben
______________________________________________________________________
OpenSSL Project http://www.openssl.org
User Support Mailing List [EMAIL PROTECTED]
Automated List Manager [EMAIL PROTECTED]
