1 .\" $NetBSD: libcrypto.pl,v 1.3 2007/11/27 22:16:03 christos Exp $
3 .\" Automatically generated by Pod::Man 2.16 (Pod::Simple 3.05)
6 .\" ========================================================================
7 .de Sh \" Subsection heading
15 .de Sp \" Vertical space (when we can't use .PP)
19 .de Vb \" Begin verbatim text
24 .de Ve \" End verbatim text
28 .\" Set up some character translations and predefined strings. \*(-- will
29 .\" give an unbreakable dash, \*(PI will give pi, \*(L" will give a left
30 .\" double quote, and \*(R" will give a right double quote. \*(C+ will
31 .\" give a nicer C++. Capital omega is used to do unbreakable dashes and
32 .\" therefore won't be available. \*(C` and \*(C' expand to `' in nroff,
33 .\" nothing in troff, for use with C<>.
35 .ds C+ C\v'-.1v'\h'-1p'\s-2+\h'-1p'+\s0\v'.1v'\h'-1p'
39 . if (\n(.H=4u)&(1m=24u) .ds -- \(*W\h'-12u'\(*W\h'-12u'-\" diablo 10 pitch
40 . if (\n(.H=4u)&(1m=20u) .ds -- \(*W\h'-12u'\(*W\h'-8u'-\" diablo 12 pitch
53 .\" Escape single quotes in literal strings from groff's Unicode transform.
57 .\" If the F register is turned on, we'll generate index entries on stderr for
58 .\" titles (.TH), headers (.SH), subsections (.Sh), items (.Ip), and index
59 .\" entries marked with X<> in POD. Of course, you'll have to process the
60 .\" output yourself in some meaningful fashion.
63 . tm Index:\\$1\t\\n%\t"\\$2"
73 .\" Accent mark definitions (@(#)ms.acc 1.5 88/02/08 SMI; from UCB 4.2).
74 .\" Fear. Run. Save yourself. No user-serviceable parts.
75 . \" fudge factors for nroff and troff
84 . ds #H ((1u-(\\\\n(.fu%2u))*.13m)
90 . \" simple accents for nroff and troff
100 . ds ' \\k:\h'-(\\n(.wu*8/10-\*(#H)'\'\h"|\\n:u"
101 . ds ` \\k:\h'-(\\n(.wu*8/10-\*(#H)'\`\h'|\\n:u'
102 . ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'^\h'|\\n:u'
103 . ds , \\k:\h'-(\\n(.wu*8/10)',\h'|\\n:u'
104 . ds ~ \\k:\h'-(\\n(.wu-\*(#H-.1m)'~\h'|\\n:u'
105 . ds / \\k:\h'-(\\n(.wu*8/10-\*(#H)'\z\(sl\h'|\\n:u'
107 . \" troff and (daisy-wheel) nroff accents
108 .ds : \\k:\h'-(\\n(.wu*8/10-\*(#H+.1m+\*(#F)'\v'-\*(#V'\z.\h'.2m+\*(#F'.\h'|\\n:u'\v'\*(#V'
109 .ds 8 \h'\*(#H'\(*b\h'-\*(#H'
110 .ds o \\k:\h'-(\\n(.wu+\w'\(de'u-\*(#H)/2u'\v'-.3n'\*(#[\z\(de\v'.3n'\h'|\\n:u'\*(#]
111 .ds d- \h'\*(#H'\(pd\h'-\w'~'u'\v'-.25m'\f2\(hy\fP\v'.25m'\h'-\*(#H'
112 .ds D- D\\k:\h'-\w'D'u'\v'-.11m'\z\(hy\v'.11m'\h'|\\n:u'
113 .ds th \*(#[\v'.3m'\s+1I\s-1\v'-.3m'\h'-(\w'I'u*2/3)'\s-1o\s+1\*(#]
114 .ds Th \*(#[\s+2I\s-2\h'-\w'I'u*3/5'\v'-.3m'o\v'.3m'\*(#]
115 .ds ae a\h'-(\w'a'u*4/10)'e
116 .ds Ae A\h'-(\w'A'u*4/10)'E
117 . \" corrections for vroff
118 .if v .ds ~ \\k:\h'-(\\n(.wu*9/10-\*(#H)'\s-2\u~\d\s+2\h'|\\n:u'
119 .if v .ds ^ \\k:\h'-(\\n(.wu*10/11-\*(#H)'\v'-.4m'^\v'.4m'\h'|\\n:u'
120 . \" for low resolution devices (crt and lpr)
121 .if \n(.H>23 .if \n(.V>19 \
134 .\" ========================================================================
136 .IX Title "RSA_generate_key 3"
137 .TH RSA_generate_key 3 "2002-09-25" "1.1.0-dev" "OpenSSL"
138 .\" For nroff, turn off justification. Always turn off hyphenation; it makes
139 .\" way too many mistakes in technical documents.
143 RSA_generate_key \- generate RSA key pair
147 .IX Header "SYNOPSIS"
149 \& #include <openssl/rsa.h>
151 \& RSA *RSA_generate_key(int num, unsigned long e,
152 \& void (*callback)(int,int,void *), void *cb_arg);
155 .IX Header "DESCRIPTION"
156 \&\fIRSA_generate_key()\fR generates a key pair and returns it in a newly
157 allocated \fB\s-1RSA\s0\fR structure. The pseudo-random number generator must
158 be seeded prior to calling \fIRSA_generate_key()\fR.
160 The modulus size will be \fBnum\fR bits, and the public exponent will be
161 \&\fBe\fR. Key sizes with \fBnum\fR < 1024 should be considered insecure.
162 The exponent is an odd number, typically 3, 17 or 65537.
164 A callback function may be used to provide feedback about the
165 progress of the key generation. If \fBcallback\fR is not \fB\s-1NULL\s0\fR, it
166 will be called as follows:
168 While a random prime number is generated, it is called as
169 described in \fIBN_generate_prime\fR\|(3).
171 When the n\-th randomly generated prime is rejected as not
172 suitable for the key, \fBcallback(2, n, cb_arg)\fR is called.
174 When a random p has been found with p\-1 relatively prime to \fBe\fR,
175 it is called as \fBcallback(3, 0, cb_arg)\fR.
177 The process is then repeated for prime q with \fBcallback(3, 1, cb_arg)\fR.
179 .IX Header "RETURN VALUE"
180 If key generation fails, \fIRSA_generate_key()\fR returns \fB\s-1NULL\s0\fR; the
181 error codes can be obtained by \fIERR_get_error\fR\|(3).
184 \&\fBcallback(2, x, cb_arg)\fR is used with two different meanings.
186 \&\fIRSA_generate_key()\fR goes into an infinite loop for illegal input values.
188 .IX Header "SEE ALSO"
189 \&\fIERR_get_error\fR\|(3), \fIopenssl_rand\fR\|(3), \fIopenssl_rsa\fR\|(3),
190 \&\fIRSA_free\fR\|(3)
193 The \fBcb_arg\fR argument was added in SSLeay 0.9.0.