crypto/rsa/rsa_x931g.c

   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 #define OPENSSL_FIPSAPI
  60
  61 #include <stdio.h>
  62 #include <string.h>
  63 #include <time.h>
  64 #include <openssl/err.h>
  65 #include <openssl/bn.h>
  66 #include <openssl/rsa.h>
  67
  68 #ifdef OPENSSL_FIPS
  69 #include <openssl/fips.h>
  70
  71 extern int fips_check_rsa(RSA *rsa);
  72 #endif
  73
  74 /* X9.31 RSA key derivation and generation */
  75
  76 int RSA_X931_derive_ex(RSA *rsa, BIGNUM *p1, BIGNUM *p2, BIGNUM *q1, BIGNUM *q2,
  77                         const BIGNUM *Xp1, const BIGNUM *Xp2, const BIGNUM *Xp,
  78                         const BIGNUM *Xq1, const BIGNUM *Xq2, const BIGNUM *Xq,
  79                         const BIGNUM *e, BN_GENCB *cb)
  80         {
  81         BIGNUM *r0=NULL,*r1=NULL,*r2=NULL,*r3=NULL;
  82         BN_CTX *ctx=NULL,*ctx2=NULL;
  83
  84         if (!rsa)
  85                 goto err;
  86
  87         ctx = BN_CTX_new();
  88         BN_CTX_start(ctx);
  89         if (!ctx)
  90                 goto err;
  91
  92         r0 = BN_CTX_get(ctx);
  93         r1 = BN_CTX_get(ctx);
  94         r2 = BN_CTX_get(ctx);
  95         r3 = BN_CTX_get(ctx);
  96
  97         if (r3 == NULL)
  98                 goto err;
  99         if (!rsa->e)
 100                 {
 101                 rsa->e = BN_dup(e);
 102                 if (!rsa->e)
 103                         goto err;
 104                 }
 105         else
 106                 e = rsa->e;
 107
 108         /* If not all parameters present only calculate what we can.
 109          * This allows test programs to output selective parameters.
 110          */
 111
 112         if (Xp && !rsa->p)
 113                 {
 114                 rsa->p = BN_new();
 115                 if (!rsa->p)
 116                         goto err;
 117
 118                 if (!BN_X931_derive_prime_ex(rsa->p, p1, p2,
 119                                         Xp, Xp1, Xp2, e, ctx, cb))
 120                         goto err;
 121                 }
 122
 123         if (Xq && !rsa->q)
 124                 {
 125                 rsa->q = BN_new();
 126                 if (!rsa->q)
 127                         goto err;
 128                 if (!BN_X931_derive_prime_ex(rsa->q, q1, q2,
 129                                         Xq, Xq1, Xq2, e, ctx, cb))
 130                         goto err;
 131                 }
 132
 133         if (!rsa->p || !rsa->q)
 134                 {
 135                 BN_CTX_end(ctx);
 136                 BN_CTX_free(ctx);
 137                 return 2;
 138                 }
 139
 140         /* Since both primes are set we can now calculate all remaining
 141          * components.
 142          */
 143
 144         /* calculate n */
 145         rsa->n=BN_new();
 146         if (rsa->n == NULL)
 147                 goto err;
 148         if (!BN_mul(rsa->n,rsa->p,rsa->q,ctx))
 149                 goto err;
 150
 151         /* calculate d */
 152         if (!BN_sub(r1,rsa->p,BN_value_one()))
 153                 goto err;       /* p-1 */
 154         if (!BN_sub(r2,rsa->q,BN_value_one()))
 155                 goto err;       /* q-1 */
 156         if (!BN_mul(r0,r1,r2,ctx))
 157                 goto err;       /* (p-1)(q-1) */
 158
 159         if (!BN_gcd(r3, r1, r2, ctx))
 160                 goto err;
 161
 162         if (!BN_div(r0, NULL, r0, r3, ctx))
 163                 goto err;       /* LCM((p-1)(q-1)) */
 164
 165         ctx2 = BN_CTX_new();
 166         if (!ctx2)
 167                 goto err;
 168
 169         rsa->d=BN_mod_inverse(NULL,rsa->e,r0,ctx2);     /* d */
 170         if (rsa->d == NULL)
 171                 goto err;
 172
 173         /* calculate d mod (p-1) */
 174         rsa->dmp1=BN_new();
 175         if (rsa->dmp1 == NULL)
 176                 goto err;
 177         if (!BN_mod(rsa->dmp1,rsa->d,r1,ctx))
 178                 goto err;
 179
 180         /* calculate d mod (q-1) */
 181         rsa->dmq1=BN_new();
 182         if (rsa->dmq1 == NULL)
 183                 goto err;
 184         if (!BN_mod(rsa->dmq1,rsa->d,r2,ctx))
 185                 goto err;
 186
 187         /* calculate inverse of q mod p */
 188         rsa->iqmp=BN_mod_inverse(NULL,rsa->q,rsa->p,ctx2);
 189
 190         err:
 191         if (ctx)
 192                 {
 193                 BN_CTX_end(ctx);
 194                 BN_CTX_free(ctx);
 195                 }
 196         if (ctx2)
 197                 BN_CTX_free(ctx2);
 198         /* If this is set all calls successful */
 199         if (rsa->iqmp != NULL)
 200                 return 1;
 201
 202         return 0;
 203
 204         }
 205
 206 int RSA_X931_generate_key_ex(RSA *rsa, int bits, const BIGNUM *e, BN_GENCB *cb)
 207         {
 208         int ok = 0;
 209         BIGNUM *Xp = NULL, *Xq = NULL;
 210         BN_CTX *ctx = NULL;
 211
 212 #ifdef OPENSSL_FIPS
 213         if (FIPS_module_mode() && !(rsa->flags & RSA_FLAG_NON_FIPS_ALLOW) &&
 214                 (bits < OPENSSL_RSA_FIPS_MIN_MODULUS_BITS))
 215             {
 216             FIPSerr(FIPS_F_RSA_X931_GENERATE_KEY_EX,FIPS_R_KEY_TOO_SHORT);
 217             return 0;
 218             }
 219
 220         if (bits & 0xff)
 221             {
 222             FIPSerr(FIPS_F_RSA_X931_GENERATE_KEY_EX,FIPS_R_INVALID_KEY_LENGTH);
 223             return 0;
 224             }
 225
 226         if(FIPS_selftest_failed())
 227             {
 228             FIPSerr(FIPS_F_RSA_X931_GENERATE_KEY_EX,FIPS_R_FIPS_SELFTEST_FAILED);
 229             return 0;
 230             }
 231         if (!fips_check_rsa_prng(rsa, bits))
 232             return 0;
 233 #endif
 234
 235         ctx = BN_CTX_new();
 236         if (!ctx)
 237                 goto error;
 238
 239         BN_CTX_start(ctx);
 240         Xp = BN_CTX_get(ctx);
 241         Xq = BN_CTX_get(ctx);
 242         if (!BN_X931_generate_Xpq(Xp, Xq, bits, ctx))
 243                 goto error;
 244
 245         rsa->p = BN_new();
 246         rsa->q = BN_new();
 247         if (!rsa->p || !rsa->q)
 248                 goto error;
 249
 250         /* Generate two primes from Xp, Xq */
 251
 252         if (!BN_X931_generate_prime_ex(rsa->p, NULL, NULL, NULL, NULL, Xp,
 253                                         e, ctx, cb))
 254                 goto error;
 255
 256         if (!BN_X931_generate_prime_ex(rsa->q, NULL, NULL, NULL, NULL, Xq,
 257                                         e, ctx, cb))
 258                 goto error;
 259
 260         /* Since rsa->p and rsa->q are valid this call will just derive
 261          * remaining RSA components.
 262          */
 263
 264         if (!RSA_X931_derive_ex(rsa, NULL, NULL, NULL, NULL,
 265                                 NULL, NULL, NULL, NULL, NULL, NULL, e, cb))
 266                 goto error;
 267
 268 #ifdef OPENSSL_FIPS
 269         if(!fips_check_rsa(rsa))
 270             goto error;
 271 #endif
 272
 273         ok = 1;
 274
 275         error:
 276         if (ctx)
 277                 {
 278                 BN_CTX_end(ctx);
 279                 BN_CTX_free(ctx);
 280                 }
 281
 282         if (ok)
 283                 return 1;
 284
 285         return 0;
 286
 287         }
 288