fips_rsa_gen.c revision 193645
11573Srgrimes/* crypto/rsa/rsa_gen.c */
21573Srgrimes/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
31573Srgrimes * All rights reserved.
41573Srgrimes *
51573Srgrimes * This package is an SSL implementation written
61573Srgrimes * by Eric Young (eay@cryptsoft.com).
71573Srgrimes * The implementation was written so as to conform with Netscapes SSL.
81573Srgrimes *
91573Srgrimes * This library is free for commercial and non-commercial use as long as
101573Srgrimes * the following conditions are aheared to.  The following conditions
111573Srgrimes * apply to all code found in this distribution, be it the RC4, RSA,
121573Srgrimes * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
131573Srgrimes * included with this distribution is covered by the same copyright terms
141573Srgrimes * except that the holder is Tim Hudson (tjh@cryptsoft.com).
151573Srgrimes *
161573Srgrimes * Copyright remains Eric Young's, and as such any Copyright notices in
171573Srgrimes * the code are not to be removed.
181573Srgrimes * If this package is used in a product, Eric Young should be given attribution
191573Srgrimes * as the author of the parts of the library used.
201573Srgrimes * This can be in the form of a textual message at program startup or
211573Srgrimes * in documentation (online or textual) provided with the package.
221573Srgrimes *
231573Srgrimes * Redistribution and use in source and binary forms, with or without
241573Srgrimes * modification, are permitted provided that the following conditions
251573Srgrimes * are met:
261573Srgrimes * 1. Redistributions of source code must retain the copyright
271573Srgrimes *    notice, this list of conditions and the following disclaimer.
281573Srgrimes * 2. Redistributions in binary form must reproduce the above copyright
291573Srgrimes *    notice, this list of conditions and the following disclaimer in the
301573Srgrimes *    documentation and/or other materials provided with the distribution.
311573Srgrimes * 3. All advertising materials mentioning features or use of this software
321573Srgrimes *    must display the following acknowledgement:
3350476Speter *    "This product includes cryptographic software written by
341573Srgrimes *     Eric Young (eay@cryptsoft.com)"
35177710Sdas *    The word 'cryptographic' can be left out if the rouines from the library
361573Srgrimes *    being used are not cryptographic related :-).
371573Srgrimes * 4. If you include any Windows specific code (or a derivative thereof) from
381573Srgrimes *    the apps directory (application code) you must include an acknowledgement:
39177710Sdas *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
40177710Sdas *
41177710Sdas * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
421573Srgrimes * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
4359460Sphantom * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
44177710Sdas * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
451573Srgrimes * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
4684306Sru * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
471573Srgrimes * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
481573Srgrimes * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
49177710Sdas * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
50177710Sdas * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
51177710Sdas * SUCH DAMAGE.
52177710Sdas *
531573Srgrimes * The licence and distribution terms for any publically available version or
541573Srgrimes * derivative of this code cannot be changed.  i.e. this code cannot simply be
55177710Sdas * copied and put under another distribution licence
56177710Sdas * [including the GNU Public Licence.]
57177710Sdas */
58177710Sdas
59177710Sdas
601573Srgrimes/* NB: these functions have been "upgraded", the deprecated versions (which are
611573Srgrimes * compatibility wrappers using these functions) are in rsa_depr.c.
621573Srgrimes * - Geoff
6367967Sasmodai */
64177710Sdas
651573Srgrimes#include <stdio.h>
661573Srgrimes#include <time.h>
671573Srgrimes#include <string.h>
68177710Sdas#include <openssl/crypto.h>
691573Srgrimes#include <openssl/bn.h>
701573Srgrimes#include <openssl/rsa.h>
711573Srgrimes#include <openssl/err.h>
721573Srgrimes#include <openssl/evp.h>
731573Srgrimes#include <openssl/fips.h>
741573Srgrimes#include "fips_locl.h"
751573Srgrimes
76177710Sdas#ifdef OPENSSL_FIPS
77177710Sdas
78177710Sdasstatic int fips_rsa_pairwise_fail = 0;
79177710Sdas
80177710Sdasvoid FIPS_corrupt_rsa_keygen(void)
81177710Sdas	{
82	fips_rsa_pairwise_fail = 1;
83	}
84
85int fips_check_rsa(RSA *rsa)
86	{
87	const unsigned char tbs[] = "RSA Pairwise Check Data";
88	unsigned char *ctbuf = NULL, *ptbuf = NULL;
89	int len, ret = 0;
90	EVP_PKEY pk;
91    	pk.type = EVP_PKEY_RSA;
92    	pk.pkey.rsa = rsa;
93
94	/* Perform pairwise consistency signature test */
95	if (!fips_pkey_signature_test(&pk, tbs, -1,
96			NULL, 0, EVP_sha1(), EVP_MD_CTX_FLAG_PAD_PKCS1, NULL)
97		|| !fips_pkey_signature_test(&pk, tbs, -1,
98			NULL, 0, EVP_sha1(), EVP_MD_CTX_FLAG_PAD_X931, NULL)
99		|| !fips_pkey_signature_test(&pk, tbs, -1,
100			NULL, 0, EVP_sha1(), EVP_MD_CTX_FLAG_PAD_PSS, NULL))
101		goto err;
102	/* Now perform pairwise consistency encrypt/decrypt test */
103	ctbuf = OPENSSL_malloc(RSA_size(rsa));
104	if (!ctbuf)
105		goto err;
106
107	len = RSA_public_encrypt(sizeof(tbs) - 1, tbs, ctbuf, rsa, RSA_PKCS1_PADDING);
108	if (len <= 0)
109		goto err;
110	/* Check ciphertext doesn't match plaintext */
111	if ((len == (sizeof(tbs) - 1)) && !memcmp(tbs, ctbuf, len))
112		goto err;
113	ptbuf = OPENSSL_malloc(RSA_size(rsa));
114
115	if (!ptbuf)
116		goto err;
117	len = RSA_private_decrypt(len, ctbuf, ptbuf, rsa, RSA_PKCS1_PADDING);
118	if (len != (sizeof(tbs) - 1))
119		goto err;
120	if (memcmp(ptbuf, tbs, len))
121		goto err;
122
123	ret = 1;
124
125	if (!ptbuf)
126		goto err;
127
128	err:
129	if (ret == 0)
130		{
131		fips_set_selftest_fail();
132		FIPSerr(FIPS_F_FIPS_CHECK_RSA,FIPS_R_PAIRWISE_TEST_FAILED);
133		}
134
135	if (ctbuf)
136		OPENSSL_free(ctbuf);
137	if (ptbuf)
138		OPENSSL_free(ptbuf);
139
140	return ret;
141	}
142
143static int rsa_builtin_keygen(RSA *rsa, int bits, BIGNUM *e_value, BN_GENCB *cb);
144
145/* NB: this wrapper would normally be placed in rsa_lib.c and the static
146 * implementation would probably be in rsa_eay.c. Nonetheless, is kept here so
147 * that we don't introduce a new linker dependency. Eg. any application that
148 * wasn't previously linking object code related to key-generation won't have to
149 * now just because key-generation is part of RSA_METHOD. */
150int RSA_generate_key_ex(RSA *rsa, int bits, BIGNUM *e_value, BN_GENCB *cb)
151	{
152	if(rsa->meth->rsa_keygen)
153		return rsa->meth->rsa_keygen(rsa, bits, e_value, cb);
154	return rsa_builtin_keygen(rsa, bits, e_value, cb);
155	}
156
157static int rsa_builtin_keygen(RSA *rsa, int bits, BIGNUM *e_value, BN_GENCB *cb)
158	{
159	BIGNUM *r0=NULL,*r1=NULL,*r2=NULL,*r3=NULL,*tmp;
160	BIGNUM local_r0,local_d,local_p;
161	BIGNUM *pr0,*d,*p;
162	int bitsp,bitsq,ok= -1,n=0;
163	BN_CTX *ctx=NULL;
164
165	if(FIPS_selftest_failed())
166	    {
167	    FIPSerr(FIPS_F_RSA_BUILTIN_KEYGEN,FIPS_R_FIPS_SELFTEST_FAILED);
168	    return 0;
169	    }
170
171	if (FIPS_mode() && (bits < OPENSSL_RSA_FIPS_MIN_MODULUS_BITS))
172	    {
173	    FIPSerr(FIPS_F_RSA_BUILTIN_KEYGEN,FIPS_R_KEY_TOO_SHORT);
174	    return 0;
175	    }
176
177	ctx=BN_CTX_new();
178	if (ctx == NULL) goto err;
179	BN_CTX_start(ctx);
180	r0 = BN_CTX_get(ctx);
181	r1 = BN_CTX_get(ctx);
182	r2 = BN_CTX_get(ctx);
183	r3 = BN_CTX_get(ctx);
184	if (r3 == NULL) goto err;
185
186	bitsp=(bits+1)/2;
187	bitsq=bits-bitsp;
188
189	/* We need the RSA components non-NULL */
190	if(!rsa->n && ((rsa->n=BN_new()) == NULL)) goto err;
191	if(!rsa->d && ((rsa->d=BN_new()) == NULL)) goto err;
192	if(!rsa->e && ((rsa->e=BN_new()) == NULL)) goto err;
193	if(!rsa->p && ((rsa->p=BN_new()) == NULL)) goto err;
194	if(!rsa->q && ((rsa->q=BN_new()) == NULL)) goto err;
195	if(!rsa->dmp1 && ((rsa->dmp1=BN_new()) == NULL)) goto err;
196	if(!rsa->dmq1 && ((rsa->dmq1=BN_new()) == NULL)) goto err;
197	if(!rsa->iqmp && ((rsa->iqmp=BN_new()) == NULL)) goto err;
198
199	BN_copy(rsa->e, e_value);
200
201	/* generate p and q */
202	for (;;)
203		{
204		if(!BN_generate_prime_ex(rsa->p, bitsp, 0, NULL, NULL, cb))
205			goto err;
206		if (!BN_sub(r2,rsa->p,BN_value_one())) goto err;
207		if (!BN_gcd(r1,r2,rsa->e,ctx)) goto err;
208		if (BN_is_one(r1)) break;
209		if(!BN_GENCB_call(cb, 2, n++))
210			goto err;
211		}
212	if(!BN_GENCB_call(cb, 3, 0))
213		goto err;
214	for (;;)
215		{
216		/* When generating ridiculously small keys, we can get stuck
217		 * continually regenerating the same prime values. Check for
218		 * this and bail if it happens 3 times. */
219		unsigned int degenerate = 0;
220		do
221			{
222			if(!BN_generate_prime_ex(rsa->q, bitsq, 0, NULL, NULL, cb))
223				goto err;
224			} while((BN_cmp(rsa->p, rsa->q) == 0) && (++degenerate < 3));
225		if(degenerate == 3)
226			{
227			ok = 0; /* we set our own err */
228			RSAerr(RSA_F_RSA_BUILTIN_KEYGEN,RSA_R_KEY_SIZE_TOO_SMALL);
229			goto err;
230			}
231		if (!BN_sub(r2,rsa->q,BN_value_one())) goto err;
232		if (!BN_gcd(r1,r2,rsa->e,ctx)) goto err;
233		if (BN_is_one(r1))
234			break;
235		if(!BN_GENCB_call(cb, 2, n++))
236			goto err;
237		}
238	if(!BN_GENCB_call(cb, 3, 1))
239		goto err;
240	if (BN_cmp(rsa->p,rsa->q) < 0)
241		{
242		tmp=rsa->p;
243		rsa->p=rsa->q;
244		rsa->q=tmp;
245		}
246
247	/* calculate n */
248	if (!BN_mul(rsa->n,rsa->p,rsa->q,ctx)) goto err;
249
250	/* calculate d */
251	if (!BN_sub(r1,rsa->p,BN_value_one())) goto err;	/* p-1 */
252	if (!BN_sub(r2,rsa->q,BN_value_one())) goto err;	/* q-1 */
253	if (!BN_mul(r0,r1,r2,ctx)) goto err;	/* (p-1)(q-1) */
254	if (!(rsa->flags & RSA_FLAG_NO_CONSTTIME))
255		{
256		  pr0 = &local_r0;
257		  BN_with_flags(pr0, r0, BN_FLG_CONSTTIME);
258		}
259	else
260	  pr0 = r0;
261	if (!BN_mod_inverse(rsa->d,rsa->e,pr0,ctx)) goto err;	/* d */
262
263	/* set up d for correct BN_FLG_CONSTTIME flag */
264	if (!(rsa->flags & RSA_FLAG_NO_CONSTTIME))
265		{
266		d = &local_d;
267		BN_with_flags(d, rsa->d, BN_FLG_CONSTTIME);
268		}
269	else
270		d = rsa->d;
271
272	/* calculate d mod (p-1) */
273	if (!BN_mod(rsa->dmp1,d,r1,ctx)) goto err;
274
275	/* calculate d mod (q-1) */
276	if (!BN_mod(rsa->dmq1,d,r2,ctx)) goto err;
277
278	/* calculate inverse of q mod p */
279	if (!(rsa->flags & RSA_FLAG_NO_CONSTTIME))
280		{
281		p = &local_p;
282		BN_with_flags(p, rsa->p, BN_FLG_CONSTTIME);
283		}
284	else
285		p = rsa->p;
286	if (!BN_mod_inverse(rsa->iqmp,rsa->q,p,ctx)) goto err;
287
288	if (fips_rsa_pairwise_fail)
289		BN_add_word(rsa->n, 1);
290
291	if(!fips_check_rsa(rsa))
292	    goto err;
293
294	ok=1;
295err:
296	if (ok == -1)
297		{
298		RSAerr(RSA_F_RSA_BUILTIN_KEYGEN,ERR_LIB_BN);
299		ok=0;
300		}
301	if (ctx != NULL)
302		{
303		BN_CTX_end(ctx);
304		BN_CTX_free(ctx);
305		}
306
307	return ok;
308	}
309
310#endif
311