1 files changed, 222 insertions, 0 deletions
diff --git a/src/lib/libcrypto/rsa/rsa_gen.c b/src/lib/libcrypto/rsa/rsa_gen.c
new file mode 100644
index 0000000000..41278f83c6
--- /dev/null
+++ b/src/lib/libcrypto/rsa/rsa_gen.c
@@ -0,0 +1,222 @@
+/* crypto/rsa/rsa_gen.c */
+/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
+ * All rights reserved.
+ *
+ * This package is an SSL implementation written
+ * by Eric Young (eay@cryptsoft.com).
+ * The implementation was written so as to conform with Netscapes SSL.
+ * 
+ * This library is free for commercial and non-commercial use as long as
+ * the following conditions are aheared to.  The following conditions
+ * apply to all code found in this distribution, be it the RC4, RSA,
+ * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
+ * included with this distribution is covered by the same copyright terms
+ * except that the holder is Tim Hudson (tjh@cryptsoft.com).
+ * 
+ * Copyright remains Eric Young's, and as such any Copyright notices in
+ * the code are not to be removed.
+ * If this package is used in a product, Eric Young should be given attribution
+ * as the author of the parts of the library used.
+ * This can be in the form of a textual message at program startup or
+ * in documentation (online or textual) provided with the package.
+ * 
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ * 3. All advertising materials mentioning features or use of this software
+ *    must display the following acknowledgement:
+ *    "This product includes cryptographic software written by
+ *     Eric Young (eay@cryptsoft.com)"
+ *    The word 'cryptographic' can be left out if the rouines from the library
+ *    being used are not cryptographic related :-).
+ * 4. If you include any Windows specific code (or a derivative thereof) from 
+ *    the apps directory (application code) you must include an acknowledgement:
+ *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
+ * 
+ * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
+ * 
+ * The licence and distribution terms for any publically available version or
+ * derivative of this code cannot be changed.  i.e. this code cannot simply be
+ * copied and put under another distribution licence
+ * [including the GNU Public Licence.]
+ */
+/* NB: these functions have been "upgraded", the deprecated versions (which are
+ * compatibility wrappers using these functions) are in rsa_depr.c.
+ * - Geoff
+ */
+#include <stdio.h>
+#include <time.h>
+#include "cryptlib.h"
+#include <openssl/bn.h>
+#include <openssl/rsa.h>
+#ifndef OPENSSL_FIPS
+static int rsa_builtin_keygen(RSA *rsa, int bits, BIGNUM *e_value, BN_GENCB *cb);
+/* NB: this wrapper would normally be placed in rsa_lib.c and the static
+ * implementation would probably be in rsa_eay.c. Nonetheless, is kept here so
+ * that we don't introduce a new linker dependency. Eg. any application that
+ * wasn't previously linking object code related to key-generation won't have to
+ * now just because key-generation is part of RSA_METHOD. */
+int RSA_generate_key_ex(RSA *rsa, int bits, BIGNUM *e_value, BN_GENCB *cb)
+        {
+        if(rsa->meth->rsa_keygen)
+                return rsa->meth->rsa_keygen(rsa, bits, e_value, cb);
+        return rsa_builtin_keygen(rsa, bits, e_value, cb);
+        }
+static int rsa_builtin_keygen(RSA *rsa, int bits, BIGNUM *e_value, BN_GENCB *cb)
+        {
+        BIGNUM *r0=NULL,*r1=NULL,*r2=NULL,*r3=NULL,*tmp;
+        BIGNUM local_r0,local_d,local_p;
+        BIGNUM *pr0,*d,*p;
+        int bitsp,bitsq,ok= -1,n=0;
+        BN_CTX *ctx=NULL;
+        ctx=BN_CTX_new();
+        if (ctx == NULL) goto err;
+        BN_CTX_start(ctx);
+        r0 = BN_CTX_get(ctx);
+        r1 = BN_CTX_get(ctx);
+        r2 = BN_CTX_get(ctx);
+        r3 = BN_CTX_get(ctx);
+        if (r3 == NULL) goto err;
+        bitsp=(bits+1)/2;
+        bitsq=bits-bitsp;
+        /* We need the RSA components non-NULL */
+        if(!rsa->n && ((rsa->n=BN_new()) == NULL)) goto err;
+        if(!rsa->d && ((rsa->d=BN_new()) == NULL)) goto err;
+        if(!rsa->e && ((rsa->e=BN_new()) == NULL)) goto err;
+        if(!rsa->p && ((rsa->p=BN_new()) == NULL)) goto err;
+        if(!rsa->q && ((rsa->q=BN_new()) == NULL)) goto err;
+        if(!rsa->dmp1 && ((rsa->dmp1=BN_new()) == NULL)) goto err;
+        if(!rsa->dmq1 && ((rsa->dmq1=BN_new()) == NULL)) goto err;
+        if(!rsa->iqmp && ((rsa->iqmp=BN_new()) == NULL)) goto err;
+        BN_copy(rsa->e, e_value);
+        /* generate p and q */
+        for (;;)
+                {
+                if(!BN_generate_prime_ex(rsa->p, bitsp, 0, NULL, NULL, cb))
+                        goto err;
+                if (!BN_sub(r2,rsa->p,BN_value_one())) goto err;
+                if (!BN_gcd(r1,r2,rsa->e,ctx)) goto err;
+                if (BN_is_one(r1)) break;
+                if(!BN_GENCB_call(cb, 2, n++))
+                        goto err;
+                }
+        if(!BN_GENCB_call(cb, 3, 0))
+                goto err;
+        for (;;)
+                {
+                /* When generating ridiculously small keys, we can get stuck
+                 * continually regenerating the same prime values. Check for
+                 * this and bail if it happens 3 times. */
+                unsigned int degenerate = 0;
+                do
+                        {
+                        if(!BN_generate_prime_ex(rsa->q, bitsq, 0, NULL, NULL, cb))
+                                goto err;
+                        } while((BN_cmp(rsa->p, rsa->q) == 0) && (++degenerate < 3));
+                if(degenerate == 3)
+                        {
+                        ok = 0; /* we set our own err */
+                        RSAerr(RSA_F_RSA_BUILTIN_KEYGEN,RSA_R_KEY_SIZE_TOO_SMALL);
+                        goto err;
+                        }
+                if (!BN_sub(r2,rsa->q,BN_value_one())) goto err;
+                if (!BN_gcd(r1,r2,rsa->e,ctx)) goto err;
+                if (BN_is_one(r1))
+                        break;
+                if(!BN_GENCB_call(cb, 2, n++))
+                        goto err;
+                }
+        if(!BN_GENCB_call(cb, 3, 1))
+                goto err;
+        if (BN_cmp(rsa->p,rsa->q) < 0)
+                {
+                tmp=rsa->p;
+                rsa->p=rsa->q;
+                rsa->q=tmp;
+                }
+        /* calculate n */
+        if (!BN_mul(rsa->n,rsa->p,rsa->q,ctx)) goto err;
+        /* calculate d */
+        if (!BN_sub(r1,rsa->p,BN_value_one())) goto err;        /* p-1 */
+        if (!BN_sub(r2,rsa->q,BN_value_one())) goto err;        /* q-1 */
+        if (!BN_mul(r0,r1,r2,ctx)) goto err;    /* (p-1)(q-1) */
+        if (!(rsa->flags & RSA_FLAG_NO_CONSTTIME))
+                {
+                  pr0 = &local_r0;
+                  BN_with_flags(pr0, r0, BN_FLG_CONSTTIME);
+                }
+        else
+          pr0 = r0;
+        if (!BN_mod_inverse(rsa->d,rsa->e,pr0,ctx)) goto err;   /* d */
+        /* set up d for correct BN_FLG_CONSTTIME flag */
+        if (!(rsa->flags & RSA_FLAG_NO_CONSTTIME))
+                {
+                d = &local_d;
+                BN_with_flags(d, rsa->d, BN_FLG_CONSTTIME);
+                }
+        else
+                d = rsa->d;
+        /* calculate d mod (p-1) */
+        if (!BN_mod(rsa->dmp1,d,r1,ctx)) goto err;
+        /* calculate d mod (q-1) */
+        if (!BN_mod(rsa->dmq1,d,r2,ctx)) goto err;
+        /* calculate inverse of q mod p */
+        if (!(rsa->flags & RSA_FLAG_NO_CONSTTIME))
+                {
+                p = &local_p;
+                BN_with_flags(p, rsa->p, BN_FLG_CONSTTIME);
+                }
+        else
+                p = rsa->p;
+        if (!BN_mod_inverse(rsa->iqmp,rsa->q,p,ctx)) goto err;
+        ok=1;
+err:
+        if (ok == -1)
+                {
+                RSAerr(RSA_F_RSA_BUILTIN_KEYGEN,ERR_LIB_BN);
+                ok=0;
+                }
+        if (ctx != NULL)
+                {
+                BN_CTX_end(ctx);
+                BN_CTX_free(ctx);
+                }
+        return ok;
+        }
+#endif

diff --git a/src/lib/libcrypto/rsa/rsa_gen.c b/src/lib/libcrypto/rsa/rsa_gen.c new file mode 100644 index 0000000000..41278f83c6 --- /dev/null +++ b/src/lib/libcrypto/rsa/rsa_gen.c
@@ -0,0 +1,222 @@
	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 "cryptlib.h"
	68	#include <openssl/bn.h>
	69	#include <openssl/rsa.h>
	70
	71	#ifndef OPENSSL_FIPS
	72
	73	static int rsa_builtin_keygen(RSA rsa, int bits, BIGNUM e_value, BN_GENCB *cb);
	74
	75	/* NB: this wrapper would normally be placed in rsa_lib.c and the static
	76	* implementation would probably be in rsa_eay.c. Nonetheless, is kept here so
	77	* that we don't introduce a new linker dependency. Eg. any application that
	78	* wasn't previously linking object code related to key-generation won't have to
	79	* now just because key-generation is part of RSA_METHOD. */
	80	int RSA_generate_key_ex(RSA rsa, int bits, BIGNUM e_value, BN_GENCB *cb)
	81	{
	82	if(rsa->meth->rsa_keygen)
	83	return rsa->meth->rsa_keygen(rsa, bits, e_value, cb);
	84	return rsa_builtin_keygen(rsa, bits, e_value, cb);
	85	}
	86
	87	static int rsa_builtin_keygen(RSA rsa, int bits, BIGNUM e_value, BN_GENCB *cb)
	88	{
	89	BIGNUM r0=NULL,r1=NULL,r2=NULL,r3=NULL,*tmp;
	90	BIGNUM local_r0,local_d,local_p;
	91	BIGNUM pr0,d,*p;
	92	int bitsp,bitsq,ok= -1,n=0;
	93	BN_CTX *ctx=NULL;
	94
	95	ctx=BN_CTX_new();
	96	if (ctx == NULL) goto err;
	97	BN_CTX_start(ctx);
	98	r0 = BN_CTX_get(ctx);
	99	r1 = BN_CTX_get(ctx);
	100	r2 = BN_CTX_get(ctx);
	101	r3 = BN_CTX_get(ctx);
	102	if (r3 == NULL) goto err;
	103
	104	bitsp=(bits+1)/2;
	105	bitsq=bits-bitsp;
	106
	107	/* We need the RSA components non-NULL */
	108	if(!rsa->n && ((rsa->n=BN_new()) == NULL)) goto err;
	109	if(!rsa->d && ((rsa->d=BN_new()) == NULL)) goto err;
	110	if(!rsa->e && ((rsa->e=BN_new()) == NULL)) goto err;
	111	if(!rsa->p && ((rsa->p=BN_new()) == NULL)) goto err;
	112	if(!rsa->q && ((rsa->q=BN_new()) == NULL)) goto err;
	113	if(!rsa->dmp1 && ((rsa->dmp1=BN_new()) == NULL)) goto err;
	114	if(!rsa->dmq1 && ((rsa->dmq1=BN_new()) == NULL)) goto err;
	115	if(!rsa->iqmp && ((rsa->iqmp=BN_new()) == NULL)) goto err;
	116
	117	BN_copy(rsa->e, e_value);
	118
	119	/* generate p and q */
	120	for (;;)
	121	{
	122	if(!BN_generate_prime_ex(rsa->p, bitsp, 0, NULL, NULL, cb))
	123	goto err;
	124	if (!BN_sub(r2,rsa->p,BN_value_one())) goto err;
	125	if (!BN_gcd(r1,r2,rsa->e,ctx)) goto err;
	126	if (BN_is_one(r1)) break;
	127	if(!BN_GENCB_call(cb, 2, n++))
	128	goto err;
	129	}
	130	if(!BN_GENCB_call(cb, 3, 0))
	131	goto err;
	132	for (;;)
	133	{
	134	/* When generating ridiculously small keys, we can get stuck
	135	* continually regenerating the same prime values. Check for
	136	* this and bail if it happens 3 times. */
	137	unsigned int degenerate = 0;
	138	do
	139	{
	140	if(!BN_generate_prime_ex(rsa->q, bitsq, 0, NULL, NULL, cb))
	141	goto err;
	142	} while((BN_cmp(rsa->p, rsa->q) == 0) && (++degenerate < 3));
	143	if(degenerate == 3)
	144	{
	145	ok = 0; /* we set our own err */
	146	RSAerr(RSA_F_RSA_BUILTIN_KEYGEN,RSA_R_KEY_SIZE_TOO_SMALL);
	147	goto err;
	148	}
	149	if (!BN_sub(r2,rsa->q,BN_value_one())) goto err;
	150	if (!BN_gcd(r1,r2,rsa->e,ctx)) goto err;
	151	if (BN_is_one(r1))
	152	break;
	153	if(!BN_GENCB_call(cb, 2, n++))
	154	goto err;
	155	}
	156	if(!BN_GENCB_call(cb, 3, 1))
	157	goto err;
	158	if (BN_cmp(rsa->p,rsa->q) < 0)
	159	{
	160	tmp=rsa->p;
	161	rsa->p=rsa->q;
	162	rsa->q=tmp;
	163	}
	164
	165	/* calculate n */
	166	if (!BN_mul(rsa->n,rsa->p,rsa->q,ctx)) goto err;
	167
	168	/* calculate d */
	169	if (!BN_sub(r1,rsa->p,BN_value_one())) goto err; /* p-1 */
	170	if (!BN_sub(r2,rsa->q,BN_value_one())) goto err; /* q-1 */
	171	if (!BN_mul(r0,r1,r2,ctx)) goto err; /* (p-1)(q-1) */
	172	if (!(rsa->flags & RSA_FLAG_NO_CONSTTIME))
	173	{
	174	pr0 = &local_r0;
	175	BN_with_flags(pr0, r0, BN_FLG_CONSTTIME);
	176	}
	177	else
	178	pr0 = r0;
	179	if (!BN_mod_inverse(rsa->d,rsa->e,pr0,ctx)) goto err; /* d */
	180
	181	/* set up d for correct BN_FLG_CONSTTIME flag */
	182	if (!(rsa->flags & RSA_FLAG_NO_CONSTTIME))
	183	{
	184	d = &local_d;
	185	BN_with_flags(d, rsa->d, BN_FLG_CONSTTIME);
	186	}
	187	else
	188	d = rsa->d;
	189
	190	/* calculate d mod (p-1) */
	191	if (!BN_mod(rsa->dmp1,d,r1,ctx)) goto err;
	192
	193	/* calculate d mod (q-1) */
	194	if (!BN_mod(rsa->dmq1,d,r2,ctx)) goto err;
	195
	196	/* calculate inverse of q mod p */
	197	if (!(rsa->flags & RSA_FLAG_NO_CONSTTIME))
	198	{
	199	p = &local_p;
	200	BN_with_flags(p, rsa->p, BN_FLG_CONSTTIME);
	201	}
	202	else
	203	p = rsa->p;
	204	if (!BN_mod_inverse(rsa->iqmp,rsa->q,p,ctx)) goto err;
	205
	206	ok=1;
	207	err:
	208	if (ok == -1)
	209	{
	210	RSAerr(RSA_F_RSA_BUILTIN_KEYGEN,ERR_LIB_BN);
	211	ok=0;
	212	}
	213	if (ctx != NULL)
	214	{
	215	BN_CTX_end(ctx);
	216	BN_CTX_free(ctx);
	217	}
	218
	219	return ok;
	220	}
	221
	222	#endif