2 * Copyright 1999-2020 The OpenSSL Project Authors. All Rights Reserved.
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
10 #include <openssl/bn.h>
11 #include <openssl/err.h>
12 #include "crypto/rsa.h"
13 #include "rsa_local.h"
16 static int rsa_validate_keypair_multiprime(const RSA *key, BN_GENCB *cb)
18 BIGNUM *i, *j, *k, *l, *m;
20 int ret = 1, ex_primes = 0, idx;
21 RSA_PRIME_INFO *pinfo;
23 if (key->p == NULL || key->q == NULL || key->n == NULL
24 || key->e == NULL || key->d == NULL) {
25 RSAerr(0, RSA_R_VALUE_MISSING);
30 if (key->version == RSA_ASN1_VERSION_MULTI) {
31 ex_primes = sk_RSA_PRIME_INFO_num(key->prime_infos);
33 || (ex_primes + 2) > rsa_multip_cap(BN_num_bits(key->n))) {
34 RSAerr(0, RSA_R_INVALID_MULTI_PRIME_KEY);
45 if (i == NULL || j == NULL || k == NULL || l == NULL
46 || m == NULL || ctx == NULL) {
48 RSAerr(0, ERR_R_MALLOC_FAILURE);
52 if (BN_is_one(key->e)) {
54 RSAerr(0, RSA_R_BAD_E_VALUE);
56 if (!BN_is_odd(key->e)) {
58 RSAerr(0, RSA_R_BAD_E_VALUE);
62 if (BN_check_prime(key->p, NULL, cb) != 1) {
64 RSAerr(0, RSA_R_P_NOT_PRIME);
68 if (BN_check_prime(key->q, NULL, cb) != 1) {
70 RSAerr(0, RSA_R_Q_NOT_PRIME);
74 for (idx = 0; idx < ex_primes; idx++) {
75 pinfo = sk_RSA_PRIME_INFO_value(key->prime_infos, idx);
76 if (BN_check_prime(pinfo->r, NULL, cb) != 1) {
78 RSAerr(0, RSA_R_MP_R_NOT_PRIME);
82 /* n = p*q * r_3...r_i? */
83 if (!BN_mul(i, key->p, key->q, ctx)) {
87 for (idx = 0; idx < ex_primes; idx++) {
88 pinfo = sk_RSA_PRIME_INFO_value(key->prime_infos, idx);
89 if (!BN_mul(i, i, pinfo->r, ctx)) {
94 if (BN_cmp(i, key->n) != 0) {
97 RSAerr(0, RSA_R_N_DOES_NOT_EQUAL_PRODUCT_OF_PRIMES);
99 RSAerr(0, RSA_R_N_DOES_NOT_EQUAL_P_Q);
102 /* d*e = 1 mod \lambda(n)? */
103 if (!BN_sub(i, key->p, BN_value_one())) {
107 if (!BN_sub(j, key->q, BN_value_one())) {
112 /* now compute k = \lambda(n) = LCM(i, j, r_3 - 1...) */
113 if (!BN_mul(l, i, j, ctx)) {
117 if (!BN_gcd(m, i, j, ctx)) {
121 for (idx = 0; idx < ex_primes; idx++) {
122 pinfo = sk_RSA_PRIME_INFO_value(key->prime_infos, idx);
123 if (!BN_sub(k, pinfo->r, BN_value_one())) {
127 if (!BN_mul(l, l, k, ctx)) {
131 if (!BN_gcd(m, m, k, ctx)) {
136 if (!BN_div(k, NULL, l, m, ctx)) { /* remainder is 0 */
140 if (!BN_mod_mul(i, key->d, key->e, k, ctx)) {
147 RSAerr(0, RSA_R_D_E_NOT_CONGRUENT_TO_1);
150 if (key->dmp1 != NULL && key->dmq1 != NULL && key->iqmp != NULL) {
151 /* dmp1 = d mod (p-1)? */
152 if (!BN_sub(i, key->p, BN_value_one())) {
156 if (!BN_mod(j, key->d, i, ctx)) {
160 if (BN_cmp(j, key->dmp1) != 0) {
162 RSAerr(0, RSA_R_DMP1_NOT_CONGRUENT_TO_D);
165 /* dmq1 = d mod (q-1)? */
166 if (!BN_sub(i, key->q, BN_value_one())) {
170 if (!BN_mod(j, key->d, i, ctx)) {
174 if (BN_cmp(j, key->dmq1) != 0) {
176 RSAerr(0, RSA_R_DMQ1_NOT_CONGRUENT_TO_D);
179 /* iqmp = q^-1 mod p? */
180 if (!BN_mod_inverse(i, key->q, key->p, ctx)) {
184 if (BN_cmp(i, key->iqmp) != 0) {
186 RSAerr(0, RSA_R_IQMP_NOT_INVERSE_OF_Q);
190 for (idx = 0; idx < ex_primes; idx++) {
191 pinfo = sk_RSA_PRIME_INFO_value(key->prime_infos, idx);
192 /* d_i = d mod (r_i - 1)? */
193 if (!BN_sub(i, pinfo->r, BN_value_one())) {
197 if (!BN_mod(j, key->d, i, ctx)) {
201 if (BN_cmp(j, pinfo->d) != 0) {
203 RSAerr(0, RSA_R_MP_EXPONENT_NOT_CONGRUENT_TO_D);
205 /* t_i = R_i ^ -1 mod r_i ? */
206 if (!BN_mod_inverse(i, pinfo->pp, pinfo->r, ctx)) {
210 if (BN_cmp(i, pinfo->t) != 0) {
212 RSAerr(0, RSA_R_MP_COEFFICIENT_NOT_INVERSE_OF_R);
225 #endif /* FIPS_MODE */
227 int rsa_validate_public(const RSA *key)
229 return rsa_sp800_56b_check_public(key);
232 int rsa_validate_private(const RSA *key)
234 return rsa_sp800_56b_check_private(key);
237 int rsa_validate_pairwise(const RSA *key)
240 return rsa_sp800_56b_check_keypair(key, NULL, -1, RSA_bits(key));
242 return rsa_validate_keypair_multiprime(key, NULL);
246 int RSA_check_key(const RSA *key)
248 return RSA_check_key_ex(key, NULL);
251 int RSA_check_key_ex(const RSA *key, BN_GENCB *cb)
254 return rsa_validate_public(key)
255 && rsa_validate_private(key)
256 && rsa_validate_pairwise(key);
258 return rsa_validate_keypair_multiprime(key, cb);
259 #endif /* FIPS_MODE */