1 /* crypto/rsa/rsa_gen.c */
2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
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.
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).
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.
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
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)"
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
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.]
60 /* NB: these functions have been "upgraded", the deprecated versions (which are
61 * compatibility wrappers using these functions) are in rsa_depr.c.
68 #include <openssl/bn.h>
69 #include <openssl/rsa.h>
70 #include <openssl/err.h>
71 #include <openssl/fips.h>
75 int fips_check_rsa(RSA *rsa)
78 unsigned char tctext[256], *ctext = tctext;
79 unsigned char tptext[256], *ptext = tptext;
80 /* The longest we can have with PKCS#1 v1.5 padding and a 512 bit key,
81 * namely 512/8-11-1 = 52 bytes */
82 static const unsigned char original_ptext[] =
83 "\x01\x23\x45\x67\x89\xab\xcd\xef\x01\x23\x45\x67\x89\xab\xcd\xef"
84 "\x01\x23\x45\x67\x89\xab\xcd\xef\x01\x23\x45\x67\x89\xab\xcd\xef"
85 "\x01\x23\x45\x67\x89\xab\xcd\xef\x01\x23\x45\x67\x89\xab\xcd\xef"
88 if (RSA_size(rsa) > sizeof(tctext))
90 ctext = OPENSSL_malloc(RSA_size(rsa));
91 ptext = OPENSSL_malloc(RSA_size(rsa));
94 FIPSerr(FIPS_F_FIPS_CHECK_RSA,ERR_R_MALLOC_FAILURE);
100 /* this will fail for keys shorter than 512 bits */
101 n=RSA_private_encrypt(sizeof(original_ptext)-1,original_ptext,ctext,rsa,
105 FIPSerr(FIPS_F_FIPS_CHECK_RSA,FIPS_R_RSA_ENCRYPT_ERROR);
108 if(!memcmp(ctext,original_ptext,n))
110 FIPSerr(FIPS_F_FIPS_CHECK_RSA,FIPS_R_PAIRWISE_TEST_FAILED);
113 n=RSA_public_decrypt(n,ctext,ptext,rsa,RSA_PKCS1_PADDING);
116 FIPSerr(FIPS_F_FIPS_CHECK_RSA,FIPS_R_RSA_DECRYPT_ERROR);
119 if(n != sizeof(original_ptext)-1 || memcmp(ptext,original_ptext,n))
121 FIPSerr(FIPS_F_FIPS_CHECK_RSA,FIPS_R_PAIRWISE_TEST_FAILED);
129 if (RSA_size(rsa) > sizeof(tctext))
138 static int rsa_builtin_keygen(RSA *rsa, int bits, BIGNUM *e_value, BN_GENCB *cb);
140 /* NB: this wrapper would normally be placed in rsa_lib.c and the static
141 * implementation would probably be in rsa_eay.c. Nonetheless, is kept here so
142 * that we don't introduce a new linker dependency. Eg. any application that
143 * wasn't previously linking object code related to key-generation won't have to
144 * now just because key-generation is part of RSA_METHOD. */
145 int RSA_generate_key_ex(RSA *rsa, int bits, BIGNUM *e_value, BN_GENCB *cb)
147 if(rsa->meth->rsa_keygen)
148 return rsa->meth->rsa_keygen(rsa, bits, e_value, cb);
149 return rsa_builtin_keygen(rsa, bits, e_value, cb);
152 static int rsa_builtin_keygen(RSA *rsa, int bits, BIGNUM *e_value, BN_GENCB *cb)
154 BIGNUM *r0=NULL,*r1=NULL,*r2=NULL,*r3=NULL,*tmp;
155 int bitsp,bitsq,ok= -1,n=0;
160 FIPSerr(FIPS_F_RSA_GENERATE_KEY,FIPS_R_KEY_TOO_SHORT);
164 if(FIPS_selftest_failed())
166 FIPSerr(FIPS_F_RSA_GENERATE_KEY,FIPS_R_FIPS_SELFTEST_FAILED);
171 if (ctx == NULL) goto err;
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;
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;
192 BN_copy(rsa->e, e_value);
194 /* generate p and q */
197 if(!BN_generate_prime_ex(rsa->p, bitsp, 0, NULL, NULL, cb))
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++))
205 if(!BN_GENCB_call(cb, 3, 0))
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;
215 if(!BN_generate_prime_ex(rsa->q, bitsq, 0, NULL, NULL, cb))
217 } while((BN_cmp(rsa->p, rsa->q) == 0) && (++degenerate < 3));
220 ok = 0; /* we set our own err */
221 RSAerr(RSA_F_RSA_BUILTIN_KEYGEN,RSA_R_KEY_SIZE_TOO_SMALL);
224 if (!BN_sub(r2,rsa->q,BN_value_one())) goto err;
225 if (!BN_gcd(r1,r2,rsa->e,ctx)) goto err;
228 if(!BN_GENCB_call(cb, 2, n++))
231 if(!BN_GENCB_call(cb, 3, 1))
233 if (BN_cmp(rsa->p,rsa->q) < 0)
241 if (!BN_mul(rsa->n,rsa->p,rsa->q,ctx)) goto err;
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) */
247 if (!BN_mod_inverse(rsa->d,rsa->e,r0,ctx)) goto err; /* d */
249 /* calculate d mod (p-1) */
250 if (!BN_mod(rsa->dmp1,rsa->d,r1,ctx)) goto err;
252 /* calculate d mod (q-1) */
253 if (!BN_mod(rsa->dmq1,rsa->d,r2,ctx)) goto err;
255 /* calculate inverse of q mod p */
256 if (!BN_mod_inverse(rsa->iqmp,rsa->q,rsa->p,ctx)) goto err;
258 if(!fips_check_rsa(rsa))
265 RSAerr(RSA_F_RSA_BUILTIN_KEYGEN,ERR_LIB_BN);