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