[thirdparty/openssl.git] / crypto / rsa / rsa_chk.c

/* crypto/rsa/rsa_chk.c  -*- Mode: C; c-file-style: "eay" -*- */
/* ====================================================================
 * Copyright (c) 1999 The OpenSSL Project.  All rights reserved.
 *
 * 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 above 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 acknowledgment:
 *    "This product includes software developed by the OpenSSL Project
 *    for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
 *
 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
 *    endorse or promote products derived from this software without
 *    prior written permission. For written permission, please contact
 *    openssl-core@OpenSSL.org.
 *
 * 5. Products derived from this software may not be called "OpenSSL"
 *    nor may "OpenSSL" appear in their names without prior written
 *    permission of the OpenSSL Project.
 *
 * 6. Redistributions of any form whatsoever must retain the following
 *    acknowledgment:
 *    "This product includes software developed by the OpenSSL Project
 *    for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
 *
 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
 * EXPRESSED 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 OpenSSL PROJECT OR
 * ITS 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.
 * ====================================================================
 */

#include <openssl/bn.h>
#include <openssl/err.h>
#include <openssl/rsa.h>


int RSA_check_key(RSA *key)
	{
	BIGNUM *i, *j, *k, *l, *m;
	BN_CTX *ctx;
	int r;
	int ret=1;
	
	i = BN_new();
	j = BN_new();
	k = BN_new();
	l = BN_new();
	m = BN_new();
	ctx = BN_CTX_new();
	if (i == NULL || j == NULL || k == NULL || l == NULL ||
		m == NULL || ctx == NULL)
		{
		ret = -1;
		RSAerr(RSA_F_RSA_CHECK_KEY, ERR_R_MALLOC_FAILURE);
		goto err;
		}
	
	/* p prime? */
	r = BN_is_prime(key->p, BN_prime_checks, NULL, NULL, NULL);
	if (r != 1)
		{
		ret = r;
		if (r != 0)
			goto err;
		RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_P_NOT_PRIME);
		}
	
	/* q prime? */
	r = BN_is_prime(key->q, BN_prime_checks, NULL, NULL, NULL);
	if (r != 1)
		{
		ret = r;
		if (r != 0)
			goto err;
		RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_Q_NOT_PRIME);
		}
	
	/* n = p*q? */
	r = BN_mul(i, key->p, key->q, ctx);
	if (!r) { ret = -1; goto err; }
	
	if (BN_cmp(i, key->n) != 0)
		{
		ret = 0;
		RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_N_DOES_NOT_EQUAL_P_Q);
		}
	
	/* dmp1 = d mod (p-1)? */
	r = BN_sub(i, key->p, BN_value_one());
	if (!r) { ret = -1; goto err; }

	r = BN_mod(j, key->d, i, ctx);
	if (!r) { ret = -1; goto err; }

	if (BN_cmp(j, key->dmp1) != 0)
		{
		ret = 0;
		RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_DMP1_NOT_CONGRUENT_TO_D);
		}
	
	/* dmq1 = d mod (q-1)? */    
	r = BN_sub(i, key->q, BN_value_one());
	if (!r) { ret = -1; goto err; }
	
	r = BN_mod(j, key->d, i, ctx);
	if (!r) { ret = -1; goto err; }

	if (BN_cmp(j, key->dmq1) != 0)
		{
		ret = 0;
		RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_DMQ1_NOT_CONGRUENT_TO_D);
		}
	
	/* iqmp = q^-1 mod p? */
	if(!BN_mod_inverse(i, key->q, key->p, ctx)) { ret = -1; goto err; }

	if (BN_cmp(i, key->iqmp) != 0)
		{
		ret = 0;
		RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_IQMP_NOT_INVERSE_OF_Q);
		}
	
	/* d*e = 1  mod lcm(p-1,q-1)? */

	r = BN_sub(i, key->p, BN_value_one());
	if (!r) { ret = -1; goto err; }
	r = BN_sub(j, key->q, BN_value_one());
	if (!r) { ret = -1; goto err; }

	/* now compute k = lcm(i,j) */
	r = BN_mul(l, i, j, ctx);
	if (!r) { ret = -1; goto err; }
	r = BN_gcd(m, i, j, ctx);
	if (!r) { ret = -1; goto err; }
	r = BN_div(k, NULL, l, m, ctx); /* remainder is 0 */
	if (!r) { ret = -1; goto err; }

	r = BN_mod_mul(i, key->d, key->e, k, ctx);
	if (!r) { ret = -1; goto err; }

	if (!BN_is_one(i))
		{
		ret = 0;
		RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_D_E_NOT_CONGRUENT_TO_1);
		}
	
 err:
	if (i != NULL) BN_free(i);
	if (j != NULL) BN_free(j);
	if (k != NULL) BN_free(k);
	if (l != NULL) BN_free(l);
	if (m != NULL) BN_free(m);
	if (ctx != NULL) BN_CTX_free(ctx);
	return (ret);
	}
Commit	Line	Data
8735ee6f	1	/* crypto/rsa/rsa_chk.c -- Mode: C; c-file-style: "eay" -- */
6519b2cb BM	2	/* ====================================================================
	3	* Copyright (c) 1999 The OpenSSL Project. All rights reserved.
	4	*
	5	* Redistribution and use in source and binary forms, with or without
	6	* modification, are permitted provided that the following conditions
	7	* are met:
	8	*
	9	* 1. Redistributions of source code must retain the above copyright
	10	* notice, this list of conditions and the following disclaimer.
	11	*
	12	* 2. Redistributions in binary form must reproduce the above copyright
	13	* notice, this list of conditions and the following disclaimer in
	14	* the documentation and/or other materials provided with the
	15	* distribution.
	16	*
	17	* 3. All advertising materials mentioning features or use of this
	18	* software must display the following acknowledgment:
	19	* "This product includes software developed by the OpenSSL Project
	20	* for use in the OpenSSL Toolkit. (http://www.OpenSSL.org/)"
	21	*
	22	* 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
	23	* endorse or promote products derived from this software without
	24	* prior written permission. For written permission, please contact
	25	* openssl-core@OpenSSL.org.
	26	*
	27	* 5. Products derived from this software may not be called "OpenSSL"
	28	* nor may "OpenSSL" appear in their names without prior written
	29	* permission of the OpenSSL Project.
	30	*
	31	* 6. Redistributions of any form whatsoever must retain the following
	32	* acknowledgment:
	33	* "This product includes software developed by the OpenSSL Project
	34	* for use in the OpenSSL Toolkit (http://www.OpenSSL.org/)"
	35	*
	36	* THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
	37	* EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
	38	* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
	39	* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
	40	* ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
	41	* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
	42	* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
	43	* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
	44	* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
	45	* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
	46	* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
	47	* OF THE POSSIBILITY OF SUCH DAMAGE.
	48	* ====================================================================
	49	*/
	50
	51	#include <openssl/bn.h>
	52	#include <openssl/err.h>
	53	#include <openssl/rsa.h>
	54
	55
	56	int RSA_check_key(RSA *key)
	57	{
	58	BIGNUM i, j, k, l, *m;
	59	BN_CTX *ctx;
3a55fc1a	60	int r;
6519b2cb BM	61	int ret=1;
	62
	63	i = BN_new();
	64	j = BN_new();
	65	k = BN_new();
	66	l = BN_new();
	67	m = BN_new();
	68	ctx = BN_CTX_new();
	69	if (i == NULL \|\| j == NULL \|\| k == NULL \|\| l == NULL \|\|
	70	m == NULL \|\| ctx == NULL)
	71	{
3a55fc1a	72	ret = -1;
6519b2cb BM	73	RSAerr(RSA_F_RSA_CHECK_KEY, ERR_R_MALLOC_FAILURE);
	74	goto err;
	75	}
	76
	77	/* p prime? */
3a55fc1a BM	78	r = BN_is_prime(key->p, BN_prime_checks, NULL, NULL, NULL);
3a55fc1a BM	79	if (r != 1)
6519b2cb	80	{
3a55fc1a BM	81	ret = r;
3a55fc1a BM	82	if (r != 0)
6519b2cb BM	83	goto err;
	84	RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_P_NOT_PRIME);
	85	}
	86
	87	/* q prime? */
3a55fc1a BM	88	r = BN_is_prime(key->q, BN_prime_checks, NULL, NULL, NULL);
3a55fc1a BM	89	if (r != 1)
6519b2cb	90	{
3a55fc1a BM	91	ret = r;
3a55fc1a BM	92	if (r != 0)
6519b2cb BM	93	goto err;
	94	RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_Q_NOT_PRIME);
	95	}
	96
	97	/* n = pq? /
3a55fc1a BM	98	r = BN_mul(i, key->p, key->q, ctx);
	99	if (!r) { ret = -1; goto err; }
	100
6519b2cb BM	101	if (BN_cmp(i, key->n) != 0)
	102	{
	103	ret = 0;
3a55fc1a	104	RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_N_DOES_NOT_EQUAL_P_Q);
6519b2cb BM	105	}
	106
	107	/* dmp1 = d mod (p-1)? */
3a55fc1a BM	108	r = BN_sub(i, key->p, BN_value_one());
	109	if (!r) { ret = -1; goto err; }
	110
	111	r = BN_mod(j, key->d, i, ctx);
	112	if (!r) { ret = -1; goto err; }
	113
6519b2cb BM	114	if (BN_cmp(j, key->dmp1) != 0)
	115	{
	116	ret = 0;
6519b2cb BM	117	RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_DMP1_NOT_CONGRUENT_TO_D);
	118	}
	119
	120	/* dmq1 = d mod (q-1)? */
3a55fc1a BM	121	r = BN_sub(i, key->q, BN_value_one());
	122	if (!r) { ret = -1; goto err; }
	123
	124	r = BN_mod(j, key->d, i, ctx);
	125	if (!r) { ret = -1; goto err; }
	126
6519b2cb BM	127	if (BN_cmp(j, key->dmq1) != 0)
	128	{
	129	ret = 0;
6519b2cb BM	130	RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_DMQ1_NOT_CONGRUENT_TO_D);
	131	}
	132
	133	/* iqmp = q^-1 mod p? */
924154d9	134	if(!BN_mod_inverse(i, key->q, key->p, ctx)) { ret = -1; goto err; }
3a55fc1a	135
6519b2cb BM	136	if (BN_cmp(i, key->iqmp) != 0)
	137	{
	138	ret = 0;
6519b2cb BM	139	RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_IQMP_NOT_INVERSE_OF_Q);
	140	}
	141
	142	/* de = 1 mod lcm(p-1,q-1)? /
3a55fc1a BM	143
	144	r = BN_sub(i, key->p, BN_value_one());
	145	if (!r) { ret = -1; goto err; }
	146	r = BN_sub(j, key->q, BN_value_one());
	147	if (!r) { ret = -1; goto err; }
	148
6519b2cb	149	/* now compute k = lcm(i,j) */
3a55fc1a BM	150	r = BN_mul(l, i, j, ctx);
	151	if (!r) { ret = -1; goto err; }
	152	r = BN_gcd(m, i, j, ctx);
	153	if (!r) { ret = -1; goto err; }
	154	r = BN_div(k, NULL, l, m, ctx); /* remainder is 0 */
	155	if (!r) { ret = -1; goto err; }
	156
	157	r = BN_mod_mul(i, key->d, key->e, k, ctx);
	158	if (!r) { ret = -1; goto err; }
	159
6519b2cb BM	160	if (!BN_is_one(i))
	161	{
	162	ret = 0;
3a55fc1a	163	RSAerr(RSA_F_RSA_CHECK_KEY, RSA_R_D_E_NOT_CONGRUENT_TO_1);
6519b2cb BM	164	}
	165
	166	err:
	167	if (i != NULL) BN_free(i);
	168	if (j != NULL) BN_free(j);
	169	if (k != NULL) BN_free(k);
	170	if (l != NULL) BN_free(l);
	171	if (m != NULL) BN_free(m);
	172	if (ctx != NULL) BN_CTX_free(ctx);
	173	return (ret);
	174	}