crypto/rsa/rsa_chk.c

   1 /* crypto/rsa/rsa_chk.c  -*- Mode: C; c-file-style: "eay" -*- */
   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 int RSA_check_key(const RSA *key)
  56 {
  57     return RSA_check_key_ex(key, NULL);
  58 }
  59
  60 int RSA_check_key_ex(const RSA *key, BN_GENCB *cb)
  61 {
  62     BIGNUM *i, *j, *k, *l, *m;
  63     BN_CTX *ctx;
  64     int r;
  65     int ret = 1;
  66
  67     if (!key->p || !key->q || !key->n || !key->e || !key->d) {
  68         RSAerr(RSA_F_RSA_CHECK_KEY_EX, RSA_R_VALUE_MISSING);
  69         return 0;
  70     }
  71
  72     i = BN_new();
  73     j = BN_new();
  74     k = BN_new();
  75     l = BN_new();
  76     m = BN_new();
  77     ctx = BN_CTX_new();
  78     if (i == NULL || j == NULL || k == NULL || l == NULL ||
  79         m == NULL || ctx == NULL) {
  80         ret = -1;
  81         RSAerr(RSA_F_RSA_CHECK_KEY_EX, ERR_R_MALLOC_FAILURE);
  82         goto err;
  83     }
  84
  85     /* p prime? */
  86     r = BN_is_prime_ex(key->p, BN_prime_checks, NULL, cb);
  87     if (r != 1) {
  88         ret = r;
  89         if (r != 0)
  90             goto err;
  91         RSAerr(RSA_F_RSA_CHECK_KEY_EX, RSA_R_P_NOT_PRIME);
  92     }
  93
  94     /* q prime? */
  95     r = BN_is_prime_ex(key->q, BN_prime_checks, NULL, cb);
  96     if (r != 1) {
  97         ret = r;
  98         if (r != 0)
  99             goto err;
 100         RSAerr(RSA_F_RSA_CHECK_KEY_EX, RSA_R_Q_NOT_PRIME);
 101     }
 102
 103     /* n = p*q? */
 104     r = BN_mul(i, key->p, key->q, ctx);
 105     if (!r) {
 106         ret = -1;
 107         goto err;
 108     }
 109
 110     if (BN_cmp(i, key->n) != 0) {
 111         ret = 0;
 112         RSAerr(RSA_F_RSA_CHECK_KEY_EX, RSA_R_N_DOES_NOT_EQUAL_P_Q);
 113     }
 114
 115     /* d*e = 1  mod lcm(p-1,q-1)? */
 116
 117     r = BN_sub(i, key->p, BN_value_one());
 118     if (!r) {
 119         ret = -1;
 120         goto err;
 121     }
 122     r = BN_sub(j, key->q, BN_value_one());
 123     if (!r) {
 124         ret = -1;
 125         goto err;
 126     }
 127
 128     /* now compute k = lcm(i,j) */
 129     r = BN_mul(l, i, j, ctx);
 130     if (!r) {
 131         ret = -1;
 132         goto err;
 133     }
 134     r = BN_gcd(m, i, j, ctx);
 135     if (!r) {
 136         ret = -1;
 137         goto err;
 138     }
 139     r = BN_div(k, NULL, l, m, ctx); /* remainder is 0 */
 140     if (!r) {
 141         ret = -1;
 142         goto err;
 143     }
 144
 145     r = BN_mod_mul(i, key->d, key->e, k, ctx);
 146     if (!r) {
 147         ret = -1;
 148         goto err;
 149     }
 150
 151     if (!BN_is_one(i)) {
 152         ret = 0;
 153         RSAerr(RSA_F_RSA_CHECK_KEY_EX, RSA_R_D_E_NOT_CONGRUENT_TO_1);
 154     }
 155
 156     if (key->dmp1 != NULL && key->dmq1 != NULL && key->iqmp != NULL) {
 157         /* dmp1 = d mod (p-1)? */
 158         r = BN_sub(i, key->p, BN_value_one());
 159         if (!r) {
 160             ret = -1;
 161             goto err;
 162         }
 163
 164         r = BN_mod(j, key->d, i, ctx);
 165         if (!r) {
 166             ret = -1;
 167             goto err;
 168         }
 169
 170         if (BN_cmp(j, key->dmp1) != 0) {
 171             ret = 0;
 172             RSAerr(RSA_F_RSA_CHECK_KEY_EX, RSA_R_DMP1_NOT_CONGRUENT_TO_D);
 173         }
 174
 175         /* dmq1 = d mod (q-1)? */
 176         r = BN_sub(i, key->q, BN_value_one());
 177         if (!r) {
 178             ret = -1;
 179             goto err;
 180         }
 181
 182         r = BN_mod(j, key->d, i, ctx);
 183         if (!r) {
 184             ret = -1;
 185             goto err;
 186         }
 187
 188         if (BN_cmp(j, key->dmq1) != 0) {
 189             ret = 0;
 190             RSAerr(RSA_F_RSA_CHECK_KEY_EX, RSA_R_DMQ1_NOT_CONGRUENT_TO_D);
 191         }
 192
 193         /* iqmp = q^-1 mod p? */
 194         if (!BN_mod_inverse(i, key->q, key->p, ctx)) {
 195             ret = -1;
 196             goto err;
 197         }
 198
 199         if (BN_cmp(i, key->iqmp) != 0) {
 200             ret = 0;
 201             RSAerr(RSA_F_RSA_CHECK_KEY_EX, RSA_R_IQMP_NOT_INVERSE_OF_Q);
 202         }
 203     }
 204
 205  err:
 206     BN_free(i);
 207     BN_free(j);
 208     BN_free(k);
 209     BN_free(l);
 210     BN_free(m);
 211     BN_CTX_free(ctx);
 212     return (ret);
 213 }