/src/openssl/crypto/rsa/rsa_chk.c

Source (jump to first uncovered line)
/*
 * Copyright 1999-2023 The OpenSSL Project Authors. All Rights Reserved.
 *
 * Licensed under the Apache License 2.0 (the "License").  You may not use
 * this file except in compliance with the License.  You can obtain a copy
 * in the file LICENSE in the source distribution or at
 * https://www.openssl.org/source/license.html
 */

/*
 * RSA low level APIs are deprecated for public use, but still ok for
 * internal use.
 */
#include "internal/deprecated.h"

#include <openssl/bn.h>
#include <openssl/err.h>
#include "crypto/rsa.h"
#include "rsa_local.h"

#ifndef FIPS_MODULE
static int rsa_validate_keypair_multiprime(const RSA *key, BN_GENCB *cb)
{
    BIGNUM *i, *j, *k, *l, *m;
    BN_CTX *ctx;
    int ret = 1, ex_primes = 0, idx;
    RSA_PRIME_INFO *pinfo;

    if (key->p == NULL || key->q == NULL || key->n == NULL
            || key->e == NULL || key->d == NULL) {
        ERR_raise(ERR_LIB_RSA, RSA_R_VALUE_MISSING);
        return 0;
    }

    /* multi-prime? */
    if (key->version == RSA_ASN1_VERSION_MULTI) {
        ex_primes = sk_RSA_PRIME_INFO_num(key->prime_infos);
        if (ex_primes <= 0
                || (ex_primes + 2) > ossl_rsa_multip_cap(BN_num_bits(key->n))) {
            ERR_raise(ERR_LIB_RSA, RSA_R_INVALID_MULTI_PRIME_KEY);
            return 0;
        }
    }

    i = BN_new();
    j = BN_new();
    k = BN_new();
    l = BN_new();
    m = BN_new();
    ctx = BN_CTX_new_ex(key->libctx);
    if (i == NULL || j == NULL || k == NULL || l == NULL
            || m == NULL || ctx == NULL) {
        ret = -1;
        ERR_raise(ERR_LIB_RSA, ERR_R_BN_LIB);
        goto err;
    }

    if (BN_is_one(key->e)) {
        ret = 0;
        ERR_raise(ERR_LIB_RSA, RSA_R_BAD_E_VALUE);
    }
    if (!BN_is_odd(key->e)) {
        ret = 0;
        ERR_raise(ERR_LIB_RSA, RSA_R_BAD_E_VALUE);
    }

    /* p prime? */
    if (BN_check_prime(key->p, ctx, cb) != 1) {
        ret = 0;
        ERR_raise(ERR_LIB_RSA, RSA_R_P_NOT_PRIME);
    }

    /* q prime? */
    if (BN_check_prime(key->q, ctx, cb) != 1) {
        ret = 0;
        ERR_raise(ERR_LIB_RSA, RSA_R_Q_NOT_PRIME);
    }

    /* r_i prime? */
    for (idx = 0; idx < ex_primes; idx++) {
        pinfo = sk_RSA_PRIME_INFO_value(key->prime_infos, idx);
        if (BN_check_prime(pinfo->r, ctx, cb) != 1) {
            ret = 0;
            ERR_raise(ERR_LIB_RSA, RSA_R_MP_R_NOT_PRIME);
        }
    }

    /* n = p*q * r_3...r_i? */
    if (!BN_mul(i, key->p, key->q, ctx)) {
        ret = -1;
        goto err;
    }
    for (idx = 0; idx < ex_primes; idx++) {
        pinfo = sk_RSA_PRIME_INFO_value(key->prime_infos, idx);
        if (!BN_mul(i, i, pinfo->r, ctx)) {
            ret = -1;
            goto err;
        }
    }
    if (BN_cmp(i, key->n) != 0) {
        ret = 0;
        if (ex_primes)
            ERR_raise(ERR_LIB_RSA, RSA_R_N_DOES_NOT_EQUAL_PRODUCT_OF_PRIMES);
        else
            ERR_raise(ERR_LIB_RSA, RSA_R_N_DOES_NOT_EQUAL_P_Q);
    }

    /* d*e = 1  mod \lambda(n)? */
    if (!BN_sub(i, key->p, BN_value_one())) {
        ret = -1;
        goto err;
    }
    if (!BN_sub(j, key->q, BN_value_one())) {
        ret = -1;
        goto err;
    }

    /* now compute k = \lambda(n) = LCM(i, j, r_3 - 1...) */
    if (!BN_mul(l, i, j, ctx)) {
        ret = -1;
        goto err;
    }
    if (!BN_gcd(m, i, j, ctx)) {
        ret = -1;
        goto err;
    }
    if (!BN_div(m, NULL, l, m, ctx)) { /* remainder is 0 */
        ret = -1;
        goto err;
    }
    for (idx = 0; idx < ex_primes; idx++) {
        pinfo = sk_RSA_PRIME_INFO_value(key->prime_infos, idx);
        if (!BN_sub(k, pinfo->r, BN_value_one())) {
            ret = -1;
            goto err;
        }
        if (!BN_mul(l, m, k, ctx)) {
            ret = -1;
            goto err;
        }
        if (!BN_gcd(m, m, k, ctx)) {
            ret = -1;
            goto err;
        }
        if (!BN_div(m, NULL, l, m, ctx)) { /* remainder is 0 */
            ret = -1;
            goto err;
        }
    }
    if (!BN_mod_mul(i, key->d, key->e, m, ctx)) {
        ret = -1;
        goto err;
    }

    if (!BN_is_one(i)) {
        ret = 0;
        ERR_raise(ERR_LIB_RSA, RSA_R_D_E_NOT_CONGRUENT_TO_1);
    }

    if (key->dmp1 != NULL && key->dmq1 != NULL && key->iqmp != NULL) {
        /* dmp1 = d mod (p-1)? */
        if (!BN_sub(i, key->p, BN_value_one())) {
            ret = -1;
            goto err;
        }
        if (!BN_mod(j, key->d, i, ctx)) {
            ret = -1;
            goto err;
        }
        if (BN_cmp(j, key->dmp1) != 0) {
            ret = 0;
            ERR_raise(ERR_LIB_RSA, RSA_R_DMP1_NOT_CONGRUENT_TO_D);
        }

        /* dmq1 = d mod (q-1)? */
        if (!BN_sub(i, key->q, BN_value_one())) {
            ret = -1;
            goto err;
        }
        if (!BN_mod(j, key->d, i, ctx)) {
            ret = -1;
            goto err;
        }
        if (BN_cmp(j, key->dmq1) != 0) {
            ret = 0;
            ERR_raise(ERR_LIB_RSA, 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;
            ERR_raise(ERR_LIB_RSA, RSA_R_IQMP_NOT_INVERSE_OF_Q);
        }
    }

    for (idx = 0; idx < ex_primes; idx++) {
        pinfo = sk_RSA_PRIME_INFO_value(key->prime_infos, idx);
        /* d_i = d mod (r_i - 1)? */
        if (!BN_sub(i, pinfo->r, BN_value_one())) {
            ret = -1;
            goto err;
        }
        if (!BN_mod(j, key->d, i, ctx)) {
            ret = -1;
            goto err;
        }
        if (BN_cmp(j, pinfo->d) != 0) {
            ret = 0;
            ERR_raise(ERR_LIB_RSA, RSA_R_MP_EXPONENT_NOT_CONGRUENT_TO_D);
        }
        /* t_i = R_i ^ -1 mod r_i ? */
        if (!BN_mod_inverse(i, pinfo->pp, pinfo->r, ctx)) {
            ret = -1;
            goto err;
        }
        if (BN_cmp(i, pinfo->t) != 0) {
            ret = 0;
            ERR_raise(ERR_LIB_RSA, RSA_R_MP_COEFFICIENT_NOT_INVERSE_OF_R);
        }
    }

 err:
    BN_free(i);
    BN_free(j);
    BN_free(k);
    BN_free(l);
    BN_free(m);
    BN_CTX_free(ctx);
    return ret;
}
#endif /* FIPS_MODULE */

int ossl_rsa_validate_public(const RSA *key)
{
    return ossl_rsa_sp800_56b_check_public(key);
}

int ossl_rsa_validate_private(const RSA *key)
{
    return ossl_rsa_sp800_56b_check_private(key);
}

int ossl_rsa_validate_pairwise(const RSA *key)
{
#ifdef FIPS_MODULE
    return ossl_rsa_sp800_56b_check_keypair(key, NULL, -1, RSA_bits(key));
#else
    return rsa_validate_keypair_multiprime(key, NULL) > 0;
#endif
}

int RSA_check_key(const RSA *key)
{
    return RSA_check_key_ex(key, NULL);
}

int RSA_check_key_ex(const RSA *key, BN_GENCB *cb)
{
#ifdef FIPS_MODULE
    return ossl_rsa_validate_public(key)
           && ossl_rsa_validate_private(key)
           && ossl_rsa_validate_pairwise(key);
#else
    return rsa_validate_keypair_multiprime(key, cb);
#endif /* FIPS_MODULE */
}

Coverage Report

Created: 2025-06-22 06:56

Line	Count	Source (jump to first uncovered line)
1		/*
2		* Copyright 1999-2023 The OpenSSL Project Authors. All Rights Reserved.
3		*
4		* Licensed under the Apache License 2.0 (the "License"). You may not use
5		* this file except in compliance with the License. You can obtain a copy
6		* in the file LICENSE in the source distribution or at
7		* https://www.openssl.org/source/license.html
8		*/
9
10		/*
11		* RSA low level APIs are deprecated for public use, but still ok for
12		* internal use.
13		*/
14		#include "internal/deprecated.h"
15
16		#include <openssl/bn.h>
17		#include <openssl/err.h>
18		#include "crypto/rsa.h"
19		#include "rsa_local.h"
20
21		#ifndef FIPS_MODULE
22		static int rsa_validate_keypair_multiprime(const RSA key, BN_GENCB cb)
23	0	{
24	0	BIGNUM i, j, k, l, *m;
25	0	BN_CTX *ctx;
26	0	int ret = 1, ex_primes = 0, idx;
27	0	RSA_PRIME_INFO *pinfo;
28
29	0	if (key->p == NULL \|\| key->q == NULL \|\| key->n == NULL
30	0	\|\| key->e == NULL \|\| key->d == NULL) {
31	0	ERR_raise(ERR_LIB_RSA, RSA_R_VALUE_MISSING);
32	0	return 0;
33	0	}
34
35		/* multi-prime? */
36	0	if (key->version == RSA_ASN1_VERSION_MULTI) {
37	0	ex_primes = sk_RSA_PRIME_INFO_num(key->prime_infos);
38	0	if (ex_primes <= 0
39	0	\|\| (ex_primes + 2) > ossl_rsa_multip_cap(BN_num_bits(key->n))) {
40	0	ERR_raise(ERR_LIB_RSA, RSA_R_INVALID_MULTI_PRIME_KEY);
41	0	return 0;
42	0	}
43	0	}
44
45	0	i = BN_new();
46	0	j = BN_new();
47	0	k = BN_new();
48	0	l = BN_new();
49	0	m = BN_new();
50	0	ctx = BN_CTX_new_ex(key->libctx);
51	0	if (i == NULL \|\| j == NULL \|\| k == NULL \|\| l == NULL
52	0	\|\| m == NULL \|\| ctx == NULL) {
53	0	ret = -1;
54	0	ERR_raise(ERR_LIB_RSA, ERR_R_BN_LIB);
55	0	goto err;
56	0	}
57
58	0	if (BN_is_one(key->e)) {
59	0	ret = 0;
60	0	ERR_raise(ERR_LIB_RSA, RSA_R_BAD_E_VALUE);
61	0	}
62	0	if (!BN_is_odd(key->e)) {
63	0	ret = 0;
64	0	ERR_raise(ERR_LIB_RSA, RSA_R_BAD_E_VALUE);
65	0	}
66
67		/* p prime? */
68	0	if (BN_check_prime(key->p, ctx, cb) != 1) {
69	0	ret = 0;
70	0	ERR_raise(ERR_LIB_RSA, RSA_R_P_NOT_PRIME);
71	0	}
72
73		/* q prime? */
74	0	if (BN_check_prime(key->q, ctx, cb) != 1) {
75	0	ret = 0;
76	0	ERR_raise(ERR_LIB_RSA, RSA_R_Q_NOT_PRIME);
77	0	}
78
79		/* r_i prime? */
80	0	for (idx = 0; idx < ex_primes; idx++) {
81	0	pinfo = sk_RSA_PRIME_INFO_value(key->prime_infos, idx);
82	0	if (BN_check_prime(pinfo->r, ctx, cb) != 1) {
83	0	ret = 0;
84	0	ERR_raise(ERR_LIB_RSA, RSA_R_MP_R_NOT_PRIME);
85	0	}
86	0	}
87
88		/* n = pq r_3...r_i? */
89	0	if (!BN_mul(i, key->p, key->q, ctx)) {
90	0	ret = -1;
91	0	goto err;
92	0	}
93	0	for (idx = 0; idx < ex_primes; idx++) {
94	0	pinfo = sk_RSA_PRIME_INFO_value(key->prime_infos, idx);
95	0	if (!BN_mul(i, i, pinfo->r, ctx)) {
96	0	ret = -1;
97	0	goto err;
98	0	}
99	0	}
100	0	if (BN_cmp(i, key->n) != 0) {
101	0	ret = 0;
102	0	if (ex_primes)
103	0	ERR_raise(ERR_LIB_RSA, RSA_R_N_DOES_NOT_EQUAL_PRODUCT_OF_PRIMES);
104	0	else
105	0	ERR_raise(ERR_LIB_RSA, RSA_R_N_DOES_NOT_EQUAL_P_Q);
106	0	}
107
108		/* de = 1 mod \lambda(n)? /
109	0	if (!BN_sub(i, key->p, BN_value_one())) {
110	0	ret = -1;
111	0	goto err;
112	0	}
113	0	if (!BN_sub(j, key->q, BN_value_one())) {
114	0	ret = -1;
115	0	goto err;
116	0	}
117
118		/* now compute k = \lambda(n) = LCM(i, j, r_3 - 1...) */
119	0	if (!BN_mul(l, i, j, ctx)) {
120	0	ret = -1;
121	0	goto err;
122	0	}
123	0	if (!BN_gcd(m, i, j, ctx)) {
124	0	ret = -1;
125	0	goto err;
126	0	}
127	0	if (!BN_div(m, NULL, l, m, ctx)) { /* remainder is 0 */
128	0	ret = -1;
129	0	goto err;
130	0	}
131	0	for (idx = 0; idx < ex_primes; idx++) {
132	0	pinfo = sk_RSA_PRIME_INFO_value(key->prime_infos, idx);
133	0	if (!BN_sub(k, pinfo->r, BN_value_one())) {
134	0	ret = -1;
135	0	goto err;
136	0	}
137	0	if (!BN_mul(l, m, k, ctx)) {
138	0	ret = -1;
139	0	goto err;
140	0	}
141	0	if (!BN_gcd(m, m, k, ctx)) {
142	0	ret = -1;
143	0	goto err;
144	0	}
145	0	if (!BN_div(m, NULL, l, m, ctx)) { /* remainder is 0 */
146	0	ret = -1;
147	0	goto err;
148	0	}
149	0	}
150	0	if (!BN_mod_mul(i, key->d, key->e, m, ctx)) {
151	0	ret = -1;
152	0	goto err;
153	0	}
154
155	0	if (!BN_is_one(i)) {
156	0	ret = 0;
157	0	ERR_raise(ERR_LIB_RSA, RSA_R_D_E_NOT_CONGRUENT_TO_1);
158	0	}
159
160	0	if (key->dmp1 != NULL && key->dmq1 != NULL && key->iqmp != NULL) {
161		/* dmp1 = d mod (p-1)? */
162	0	if (!BN_sub(i, key->p, BN_value_one())) {
163	0	ret = -1;
164	0	goto err;
165	0	}
166	0	if (!BN_mod(j, key->d, i, ctx)) {
167	0	ret = -1;
168	0	goto err;
169	0	}
170	0	if (BN_cmp(j, key->dmp1) != 0) {
171	0	ret = 0;
172	0	ERR_raise(ERR_LIB_RSA, RSA_R_DMP1_NOT_CONGRUENT_TO_D);
173	0	}
174
175		/* dmq1 = d mod (q-1)? */
176	0	if (!BN_sub(i, key->q, BN_value_one())) {
177	0	ret = -1;
178	0	goto err;
179	0	}
180	0	if (!BN_mod(j, key->d, i, ctx)) {
181	0	ret = -1;
182	0	goto err;
183	0	}
184	0	if (BN_cmp(j, key->dmq1) != 0) {
185	0	ret = 0;
186	0	ERR_raise(ERR_LIB_RSA, RSA_R_DMQ1_NOT_CONGRUENT_TO_D);
187	0	}
188
189		/* iqmp = q^-1 mod p? */
190	0	if (!BN_mod_inverse(i, key->q, key->p, ctx)) {
191	0	ret = -1;
192	0	goto err;
193	0	}
194	0	if (BN_cmp(i, key->iqmp) != 0) {
195	0	ret = 0;
196	0	ERR_raise(ERR_LIB_RSA, RSA_R_IQMP_NOT_INVERSE_OF_Q);
197	0	}
198	0	}
199
200	0	for (idx = 0; idx < ex_primes; idx++) {
201	0	pinfo = sk_RSA_PRIME_INFO_value(key->prime_infos, idx);
202		/* d_i = d mod (r_i - 1)? */
203	0	if (!BN_sub(i, pinfo->r, BN_value_one())) {
204	0	ret = -1;
205	0	goto err;
206	0	}
207	0	if (!BN_mod(j, key->d, i, ctx)) {
208	0	ret = -1;
209	0	goto err;
210	0	}
211	0	if (BN_cmp(j, pinfo->d) != 0) {
212	0	ret = 0;
213	0	ERR_raise(ERR_LIB_RSA, RSA_R_MP_EXPONENT_NOT_CONGRUENT_TO_D);
214	0	}
215		/* t_i = R_i ^ -1 mod r_i ? */
216	0	if (!BN_mod_inverse(i, pinfo->pp, pinfo->r, ctx)) {
217	0	ret = -1;
218	0	goto err;
219	0	}
220	0	if (BN_cmp(i, pinfo->t) != 0) {
221	0	ret = 0;
222	0	ERR_raise(ERR_LIB_RSA, RSA_R_MP_COEFFICIENT_NOT_INVERSE_OF_R);
223	0	}
224	0	}
225
226	0	err:
227	0	BN_free(i);
228	0	BN_free(j);
229	0	BN_free(k);
230	0	BN_free(l);
231	0	BN_free(m);
232	0	BN_CTX_free(ctx);
233	0	return ret;
234	0	}
235		#endif /* FIPS_MODULE */
236
237		int ossl_rsa_validate_public(const RSA *key)
238	0	{
239	0	return ossl_rsa_sp800_56b_check_public(key);
240	0	}
241
242		int ossl_rsa_validate_private(const RSA *key)
243	0	{
244	0	return ossl_rsa_sp800_56b_check_private(key);
245	0	}
246
247		int ossl_rsa_validate_pairwise(const RSA *key)
248	0	{
249		#ifdef FIPS_MODULE
250		return ossl_rsa_sp800_56b_check_keypair(key, NULL, -1, RSA_bits(key));
251		#else
252	0	return rsa_validate_keypair_multiprime(key, NULL) > 0;
253	0	#endif
254	0	}
255
256		int RSA_check_key(const RSA *key)
257	0	{
258	0	return RSA_check_key_ex(key, NULL);
259	0	}
260
261		int RSA_check_key_ex(const RSA key, BN_GENCB cb)
262	0	{
263		#ifdef FIPS_MODULE
264		return ossl_rsa_validate_public(key)
265		&& ossl_rsa_validate_private(key)
266		&& ossl_rsa_validate_pairwise(key);
267		#else
268	0	return rsa_validate_keypair_multiprime(key, cb);
269	0	#endif /* FIPS_MODULE */
270	0	}