]>
Commit | Line | Data |
---|---|---|
aeb9ccfa DSH |
1 | /* crypto/rsa/rsa_gen.c */ |
2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) | |
3 | * All rights reserved. | |
4 | * | |
5 | * This package is an SSL implementation written | |
6 | * by Eric Young (eay@cryptsoft.com). | |
7 | * The implementation was written so as to conform with Netscapes SSL. | |
8 | * | |
9 | * This library is free for commercial and non-commercial use as long as | |
10 | * the following conditions are aheared to. The following conditions | |
11 | * apply to all code found in this distribution, be it the RC4, RSA, | |
12 | * lhash, DES, etc., code; not just the SSL code. The SSL documentation | |
13 | * included with this distribution is covered by the same copyright terms | |
14 | * except that the holder is Tim Hudson (tjh@cryptsoft.com). | |
15 | * | |
16 | * Copyright remains Eric Young's, and as such any Copyright notices in | |
17 | * the code are not to be removed. | |
18 | * If this package is used in a product, Eric Young should be given attribution | |
19 | * as the author of the parts of the library used. | |
20 | * This can be in the form of a textual message at program startup or | |
21 | * in documentation (online or textual) provided with the package. | |
22 | * | |
23 | * Redistribution and use in source and binary forms, with or without | |
24 | * modification, are permitted provided that the following conditions | |
25 | * are met: | |
26 | * 1. Redistributions of source code must retain the copyright | |
27 | * notice, this list of conditions and the following disclaimer. | |
28 | * 2. Redistributions in binary form must reproduce the above copyright | |
29 | * notice, this list of conditions and the following disclaimer in the | |
30 | * documentation and/or other materials provided with the distribution. | |
31 | * 3. All advertising materials mentioning features or use of this software | |
32 | * must display the following acknowledgement: | |
33 | * "This product includes cryptographic software written by | |
34 | * Eric Young (eay@cryptsoft.com)" | |
35 | * The word 'cryptographic' can be left out if the rouines from the library | |
36 | * being used are not cryptographic related :-). | |
37 | * 4. If you include any Windows specific code (or a derivative thereof) from | |
38 | * the apps directory (application code) you must include an acknowledgement: | |
39 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" | |
40 | * | |
41 | * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND | |
42 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
43 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
44 | * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE | |
45 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
46 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
47 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
48 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
49 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
50 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
51 | * SUCH DAMAGE. | |
52 | * | |
53 | * The licence and distribution terms for any publically available version or | |
54 | * derivative of this code cannot be changed. i.e. this code cannot simply be | |
55 | * copied and put under another distribution licence | |
56 | * [including the GNU Public Licence.] | |
57 | */ | |
58 | ||
59 | ||
60 | /* NB: these functions have been "upgraded", the deprecated versions (which are | |
61 | * compatibility wrappers using these functions) are in rsa_depr.c. | |
62 | * - Geoff | |
63 | */ | |
64 | ||
65 | #include <stdio.h> | |
66 | #include <time.h> | |
67 | #include <string.h> | |
a81f3373 | 68 | #include <openssl/crypto.h> |
aeb9ccfa DSH |
69 | #include <openssl/bn.h> |
70 | #include <openssl/rsa.h> | |
71 | #include <openssl/err.h> | |
a81f3373 | 72 | #include <openssl/evp.h> |
aeb9ccfa | 73 | #include <openssl/fips.h> |
2ac86959 | 74 | #include "fips_locl.h" |
aeb9ccfa DSH |
75 | |
76 | #ifdef OPENSSL_FIPS | |
77 | ||
78 | int fips_check_rsa(RSA *rsa) | |
aeb9ccfa | 79 | { |
a81f3373 | 80 | const unsigned char tbs[] = "RSA Pairwise Check Data"; |
2ac86959 DSH |
81 | unsigned char *ctbuf = NULL, *ptbuf = NULL; |
82 | int len, ret = 0; | |
a81f3373 DSH |
83 | EVP_PKEY pk; |
84 | pk.type = EVP_PKEY_RSA; | |
85 | pk.pkey.rsa = rsa; | |
86 | ||
2ac86959 | 87 | /* Perform pairwise consistency signature test */ |
a81f3373 DSH |
88 | if (!fips_pkey_signature_test(&pk, tbs, -1, |
89 | NULL, 0, EVP_sha1(), EVP_MD_CTX_FLAG_PAD_PKCS1, NULL) | |
90 | || !fips_pkey_signature_test(&pk, tbs, -1, | |
91 | NULL, 0, EVP_sha1(), EVP_MD_CTX_FLAG_PAD_X931, NULL) | |
92 | || !fips_pkey_signature_test(&pk, tbs, -1, | |
93 | NULL, 0, EVP_sha1(), EVP_MD_CTX_FLAG_PAD_PSS, NULL)) | |
2ac86959 DSH |
94 | goto err; |
95 | /* Now perform pairwise consistency encrypt/decrypt test */ | |
96 | ctbuf = OPENSSL_malloc(RSA_size(rsa)); | |
97 | if (!ctbuf) | |
98 | goto err; | |
99 | ||
100 | len = RSA_public_encrypt(sizeof(tbs) - 1, tbs, ctbuf, rsa, RSA_PKCS1_PADDING); | |
101 | if (len <= 0) | |
102 | goto err; | |
103 | /* Check ciphertext doesn't match plaintext */ | |
104 | if ((len == (sizeof(tbs) - 1)) && !memcmp(tbs, ctbuf, len)) | |
105 | goto err; | |
106 | ptbuf = OPENSSL_malloc(RSA_size(rsa)); | |
107 | ||
108 | if (!ptbuf) | |
109 | goto err; | |
110 | len = RSA_private_decrypt(len, ctbuf, ptbuf, rsa, RSA_PKCS1_PADDING); | |
111 | if (len != (sizeof(tbs) - 1)) | |
112 | goto err; | |
113 | if (memcmp(ptbuf, tbs, len)) | |
114 | goto err; | |
115 | ||
116 | ret = 1; | |
117 | ||
118 | if (!ptbuf) | |
119 | goto err; | |
120 | ||
121 | err: | |
122 | if (ret == 0) | |
aeb9ccfa | 123 | { |
2ac86959 | 124 | fips_set_selftest_fail(); |
a81f3373 | 125 | FIPSerr(FIPS_F_FIPS_CHECK_RSA,FIPS_R_PAIRWISE_TEST_FAILED); |
aeb9ccfa | 126 | } |
2ac86959 DSH |
127 | |
128 | if (ctbuf) | |
129 | OPENSSL_free(ctbuf); | |
130 | if (ptbuf) | |
131 | OPENSSL_free(ptbuf); | |
132 | ||
133 | return ret; | |
aeb9ccfa | 134 | } |
aeb9ccfa DSH |
135 | |
136 | static int rsa_builtin_keygen(RSA *rsa, int bits, BIGNUM *e_value, BN_GENCB *cb); | |
137 | ||
138 | /* NB: this wrapper would normally be placed in rsa_lib.c and the static | |
139 | * implementation would probably be in rsa_eay.c. Nonetheless, is kept here so | |
140 | * that we don't introduce a new linker dependency. Eg. any application that | |
141 | * wasn't previously linking object code related to key-generation won't have to | |
142 | * now just because key-generation is part of RSA_METHOD. */ | |
143 | int RSA_generate_key_ex(RSA *rsa, int bits, BIGNUM *e_value, BN_GENCB *cb) | |
144 | { | |
145 | if(rsa->meth->rsa_keygen) | |
146 | return rsa->meth->rsa_keygen(rsa, bits, e_value, cb); | |
147 | return rsa_builtin_keygen(rsa, bits, e_value, cb); | |
148 | } | |
149 | ||
150 | static int rsa_builtin_keygen(RSA *rsa, int bits, BIGNUM *e_value, BN_GENCB *cb) | |
151 | { | |
152 | BIGNUM *r0=NULL,*r1=NULL,*r2=NULL,*r3=NULL,*tmp; | |
8c3b5d5f DSH |
153 | BIGNUM local_r0,local_d,local_p; |
154 | BIGNUM *pr0,*d,*p; | |
aeb9ccfa DSH |
155 | int bitsp,bitsq,ok= -1,n=0; |
156 | BN_CTX *ctx=NULL; | |
157 | ||
7f1288da | 158 | if(FIPS_selftest_failed()) |
aeb9ccfa | 159 | { |
1a58139a | 160 | FIPSerr(FIPS_F_RSA_BUILTIN_KEYGEN,FIPS_R_FIPS_SELFTEST_FAILED); |
aeb9ccfa DSH |
161 | return 0; |
162 | } | |
163 | ||
7f1288da | 164 | if (FIPS_mode() && (bits < OPENSSL_RSA_FIPS_MIN_MODULUS_BITS)) |
aeb9ccfa | 165 | { |
1a58139a | 166 | FIPSerr(FIPS_F_RSA_BUILTIN_KEYGEN,FIPS_R_KEY_TOO_SHORT); |
aeb9ccfa DSH |
167 | return 0; |
168 | } | |
169 | ||
170 | ctx=BN_CTX_new(); | |
171 | if (ctx == NULL) goto err; | |
172 | BN_CTX_start(ctx); | |
173 | r0 = BN_CTX_get(ctx); | |
174 | r1 = BN_CTX_get(ctx); | |
175 | r2 = BN_CTX_get(ctx); | |
176 | r3 = BN_CTX_get(ctx); | |
177 | if (r3 == NULL) goto err; | |
178 | ||
179 | bitsp=(bits+1)/2; | |
180 | bitsq=bits-bitsp; | |
181 | ||
182 | /* We need the RSA components non-NULL */ | |
183 | if(!rsa->n && ((rsa->n=BN_new()) == NULL)) goto err; | |
184 | if(!rsa->d && ((rsa->d=BN_new()) == NULL)) goto err; | |
185 | if(!rsa->e && ((rsa->e=BN_new()) == NULL)) goto err; | |
186 | if(!rsa->p && ((rsa->p=BN_new()) == NULL)) goto err; | |
187 | if(!rsa->q && ((rsa->q=BN_new()) == NULL)) goto err; | |
188 | if(!rsa->dmp1 && ((rsa->dmp1=BN_new()) == NULL)) goto err; | |
189 | if(!rsa->dmq1 && ((rsa->dmq1=BN_new()) == NULL)) goto err; | |
190 | if(!rsa->iqmp && ((rsa->iqmp=BN_new()) == NULL)) goto err; | |
191 | ||
192 | BN_copy(rsa->e, e_value); | |
193 | ||
194 | /* generate p and q */ | |
195 | for (;;) | |
196 | { | |
197 | if(!BN_generate_prime_ex(rsa->p, bitsp, 0, NULL, NULL, cb)) | |
198 | goto err; | |
199 | if (!BN_sub(r2,rsa->p,BN_value_one())) goto err; | |
200 | if (!BN_gcd(r1,r2,rsa->e,ctx)) goto err; | |
201 | if (BN_is_one(r1)) break; | |
202 | if(!BN_GENCB_call(cb, 2, n++)) | |
203 | goto err; | |
204 | } | |
205 | if(!BN_GENCB_call(cb, 3, 0)) | |
206 | goto err; | |
207 | for (;;) | |
208 | { | |
209 | /* When generating ridiculously small keys, we can get stuck | |
210 | * continually regenerating the same prime values. Check for | |
211 | * this and bail if it happens 3 times. */ | |
212 | unsigned int degenerate = 0; | |
213 | do | |
214 | { | |
215 | if(!BN_generate_prime_ex(rsa->q, bitsq, 0, NULL, NULL, cb)) | |
216 | goto err; | |
217 | } while((BN_cmp(rsa->p, rsa->q) == 0) && (++degenerate < 3)); | |
218 | if(degenerate == 3) | |
219 | { | |
220 | ok = 0; /* we set our own err */ | |
221 | RSAerr(RSA_F_RSA_BUILTIN_KEYGEN,RSA_R_KEY_SIZE_TOO_SMALL); | |
222 | goto err; | |
223 | } | |
224 | if (!BN_sub(r2,rsa->q,BN_value_one())) goto err; | |
225 | if (!BN_gcd(r1,r2,rsa->e,ctx)) goto err; | |
226 | if (BN_is_one(r1)) | |
227 | break; | |
228 | if(!BN_GENCB_call(cb, 2, n++)) | |
229 | goto err; | |
230 | } | |
231 | if(!BN_GENCB_call(cb, 3, 1)) | |
232 | goto err; | |
233 | if (BN_cmp(rsa->p,rsa->q) < 0) | |
234 | { | |
235 | tmp=rsa->p; | |
236 | rsa->p=rsa->q; | |
237 | rsa->q=tmp; | |
238 | } | |
239 | ||
240 | /* calculate n */ | |
241 | if (!BN_mul(rsa->n,rsa->p,rsa->q,ctx)) goto err; | |
242 | ||
243 | /* calculate d */ | |
244 | if (!BN_sub(r1,rsa->p,BN_value_one())) goto err; /* p-1 */ | |
245 | if (!BN_sub(r2,rsa->q,BN_value_one())) goto err; /* q-1 */ | |
246 | if (!BN_mul(r0,r1,r2,ctx)) goto err; /* (p-1)(q-1) */ | |
8c3b5d5f DSH |
247 | if (!(rsa->flags & RSA_FLAG_NO_CONSTTIME)) |
248 | { | |
249 | pr0 = &local_r0; | |
250 | BN_with_flags(pr0, r0, BN_FLG_CONSTTIME); | |
251 | } | |
252 | else | |
253 | pr0 = r0; | |
254 | if (!BN_mod_inverse(rsa->d,rsa->e,pr0,ctx)) goto err; /* d */ | |
255 | ||
256 | /* set up d for correct BN_FLG_CONSTTIME flag */ | |
257 | if (!(rsa->flags & RSA_FLAG_NO_CONSTTIME)) | |
258 | { | |
259 | d = &local_d; | |
260 | BN_with_flags(d, rsa->d, BN_FLG_CONSTTIME); | |
261 | } | |
262 | else | |
263 | d = rsa->d; | |
aeb9ccfa DSH |
264 | |
265 | /* calculate d mod (p-1) */ | |
8c3b5d5f | 266 | if (!BN_mod(rsa->dmp1,d,r1,ctx)) goto err; |
aeb9ccfa DSH |
267 | |
268 | /* calculate d mod (q-1) */ | |
8c3b5d5f | 269 | if (!BN_mod(rsa->dmq1,d,r2,ctx)) goto err; |
aeb9ccfa DSH |
270 | |
271 | /* calculate inverse of q mod p */ | |
8c3b5d5f DSH |
272 | if (!(rsa->flags & RSA_FLAG_NO_CONSTTIME)) |
273 | { | |
274 | p = &local_p; | |
275 | BN_with_flags(p, rsa->p, BN_FLG_CONSTTIME); | |
276 | } | |
277 | else | |
278 | p = rsa->p; | |
279 | if (!BN_mod_inverse(rsa->iqmp,rsa->q,p,ctx)) goto err; | |
aeb9ccfa DSH |
280 | |
281 | if(!fips_check_rsa(rsa)) | |
282 | goto err; | |
283 | ||
284 | ok=1; | |
285 | err: | |
286 | if (ok == -1) | |
287 | { | |
288 | RSAerr(RSA_F_RSA_BUILTIN_KEYGEN,ERR_LIB_BN); | |
289 | ok=0; | |
290 | } | |
291 | if (ctx != NULL) | |
292 | { | |
293 | BN_CTX_end(ctx); | |
294 | BN_CTX_free(ctx); | |
295 | } | |
296 | ||
297 | return ok; | |
298 | } | |
299 | ||
300 | #endif |