X-Git-Url: https://git.librecmc.org/?a=blobdiff_plain;f=doc%2Fcrypto%2FRSA_generate_key.pod;h=52dbb14a537debb5e727a5a03d520f6c60080f01;hb=ec14c80c7cd4949af0b2d85e4bd2952d22c1707f;hp=3cdc07f374d32f000482726f2c5abdf503e584ea;hpb=60b5245360a70f4b10a6c77aa0bf5ee04b2e7262;p=oweals%2Fopenssl.git diff --git a/doc/crypto/RSA_generate_key.pod b/doc/crypto/RSA_generate_key.pod index 3cdc07f374..52dbb14a53 100644 --- a/doc/crypto/RSA_generate_key.pod +++ b/doc/crypto/RSA_generate_key.pod @@ -2,7 +2,7 @@ =head1 NAME -RSA_generate_key - Generate RSA key pair +RSA_generate_key - generate RSA key pair =head1 SYNOPSIS @@ -19,7 +19,7 @@ be seeded prior to calling RSA_generate_key(). The modulus size will be B bits, and the public exponent will be B. Key sizes with B E 1024 should be considered insecure. -The exponent is an odd number, typically 3 or 65535. +The exponent is an odd number, typically 3, 17 or 65537. A callback function may be used to provide feedback about the progress of the key generation. If B is not B, it @@ -30,7 +30,7 @@ will be called as follows: =item * While a random prime number is generated, it is called as -described in L. +described in L. =item * @@ -49,7 +49,7 @@ The process is then repeated for prime q with B. =head1 RETURN VALUE If key generation fails, RSA_generate_key() returns B; the -error codes can be obtained by ERR_get_error(3). +error codes can be obtained by L. =head1 BUGS @@ -59,7 +59,8 @@ RSA_generate_key() goes into an infinite loop for illegal input values. =head1 SEE ALSO -err(3), rand(3), rsa(3), RSA_free(3) +L, L, L, +L =head1 HISTORY