AppleCSP/open_ssl/rsa/rsa_gen.c

   1 /*
   2  * Copyright (c) 2000-2001 Apple Computer, Inc. All Rights Reserved.
   3  *
   4  * The contents of this file constitute Original Code as defined in and are
   5  * subject to the Apple Public Source License Version 1.2 (the 'License').
   6  * You may not use this file except in compliance with the License. Please obtain
   7  * a copy of the License at http://www.apple.com/publicsource and read it before
   8  * using this file.
   9  *
  10  * This Original Code and all software distributed under the License are
  11  * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESS
  12  * OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES, INCLUDING WITHOUT
  13  * LIMITATION, ANY WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
  14  * PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT. Please see the License for the
  15  * specific language governing rights and limitations under the License.
  16  */
  17
  18
  19 /* crypto/rsa/rsa_gen.c */
  20 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
  21  * All rights reserved.
  22  *
  23  * This package is an SSL implementation written
  24  * by Eric Young (eay@cryptsoft.com).
  25  * The implementation was written so as to conform with Netscapes SSL.
  26  *
  27  * This library is free for commercial and non-commercial use as long as
  28  * the following conditions are aheared to.  The following conditions
  29  * apply to all code found in this distribution, be it the RC4, RSA,
  30  * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
  31  * included with this distribution is covered by the same copyright terms
  32  * except that the holder is Tim Hudson (tjh@cryptsoft.com).
  33  *
  34  * Copyright remains Eric Young's, and as such any Copyright notices in
  35  * the code are not to be removed.
  36  * If this package is used in a product, Eric Young should be given attribution
  37  * as the author of the parts of the library used.
  38  * This can be in the form of a textual message at program startup or
  39  * in documentation (online or textual) provided with the package.
  40  *
  41  * Redistribution and use in source and binary forms, with or without
  42  * modification, are permitted provided that the following conditions
  43  * are met:
  44  * 1. Redistributions of source code must retain the copyright
  45  *    notice, this list of conditions and the following disclaimer.
  46  * 2. Redistributions in binary form must reproduce the above copyright
  47  *    notice, this list of conditions and the following disclaimer in the
  48  *    documentation and/or other materials provided with the distribution.
  49  * 3. All advertising materials mentioning features or use of this software
  50  *    must display the following acknowledgement:
  51  *    "This product includes cryptographic software written by
  52  *     Eric Young (eay@cryptsoft.com)"
  53  *    The word 'cryptographic' can be left out if the rouines from the library
  54  *    being used are not cryptographic related :-).
  55  * 4. If you include any Windows specific code (or a derivative thereof) from
  56  *    the apps directory (application code) you must include an acknowledgement:
  57  *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
  58  *
  59  * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
  60  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  61  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  62  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  63  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  64  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  65  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  66  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  67  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  68  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  69  * SUCH DAMAGE.
  70  *
  71  * The licence and distribution terms for any publically available version or
  72  * derivative of this code cannot be changed.  i.e. this code cannot simply be
  73  * copied and put under another distribution licence
  74  * [including the GNU Public Licence.]
  75  */
  76
  77 #include <stdio.h>
  78 #include <time.h>
  79 #include "cryptlib.h"
  80 #include <openssl/bn.h>
  81 #include <openssl/rsa.h>
  82
  83 RSA *RSA_generate_key(int bits, unsigned long e_value,
  84              void (*callback)(int,int,void *), void *cb_arg)
  85         {
  86         RSA *rsa=NULL;
  87         BIGNUM *r0=NULL,*r1=NULL,*r2=NULL,*r3=NULL,*tmp;
  88         int bitsp,bitsq,ok= -1,n=0,i;
  89         BN_CTX *ctx=NULL,*ctx2=NULL;
  90
  91         ctx=BN_CTX_new();
  92         if (ctx == NULL) goto err;
  93         ctx2=BN_CTX_new();
  94         if (ctx2 == NULL) goto err;
  95         BN_CTX_start(ctx);
  96         r0 = BN_CTX_get(ctx);
  97         r1 = BN_CTX_get(ctx);
  98         r2 = BN_CTX_get(ctx);
  99         r3 = BN_CTX_get(ctx);
 100         if (r3 == NULL) goto err;
 101
 102         bitsp=(bits+1)/2;
 103         bitsq=bits-bitsp;
 104         rsa=RSA_new();
 105         if (rsa == NULL) goto err;
 106
 107         /* set e */
 108         rsa->e=BN_new();
 109         if (rsa->e == NULL) goto err;
 110
 111 #if 1
 112         /* The problem is when building with 8, 16, or 32 BN_ULONG,
 113          * unsigned long can be larger */
 114         for (i=0; i<sizeof(unsigned long)*8; i++)
 115                 {
 116                 if (e_value & (1<<i))
 117                         BN_set_bit(rsa->e,i);
 118                 }
 119 #else
 120         if (!BN_set_word(rsa->e,e_value)) goto err;
 121 #endif
 122
 123         /* generate p and q */
 124         for (;;)
 125                 {
 126                 rsa->p=BN_generate_prime(NULL,bitsp,0,NULL,NULL,callback,cb_arg);
 127                 if (rsa->p == NULL) goto err;
 128                 if (!BN_sub(r2,rsa->p,BN_value_one())) goto err;
 129                 if (!BN_gcd(r1,r2,rsa->e,ctx)) goto err;
 130                 if (BN_is_one(r1)) break;
 131                 if (callback != NULL) callback(2,n++,cb_arg);
 132                 BN_free(rsa->p);
 133                 }
 134         if (callback != NULL) callback(3,0,cb_arg);
 135         for (;;)
 136                 {
 137                 rsa->q=BN_generate_prime(NULL,bitsq,0,NULL,NULL,callback,cb_arg);
 138                 if (rsa->q == NULL) goto err;
 139                 if (!BN_sub(r2,rsa->q,BN_value_one())) goto err;
 140                 if (!BN_gcd(r1,r2,rsa->e,ctx)) goto err;
 141                 if (BN_is_one(r1) && (BN_cmp(rsa->p,rsa->q) != 0))
 142                         break;
 143                 if (callback != NULL) callback(2,n++,cb_arg);
 144                 BN_free(rsa->q);
 145                 }
 146         if (callback != NULL) callback(3,1,cb_arg);
 147         if (BN_cmp(rsa->p,rsa->q) < 0)
 148                 {
 149                 tmp=rsa->p;
 150                 rsa->p=rsa->q;
 151                 rsa->q=tmp;
 152                 }
 153
 154         /* calculate n */
 155         rsa->n=BN_new();
 156         if (rsa->n == NULL) goto err;
 157         if (!BN_mul(rsa->n,rsa->p,rsa->q,ctx)) goto err;
 158
 159         /* calculate d */
 160         if (!BN_sub(r1,rsa->p,BN_value_one())) goto err;        /* p-1 */
 161         if (!BN_sub(r2,rsa->q,BN_value_one())) goto err;        /* q-1 */
 162         if (!BN_mul(r0,r1,r2,ctx)) goto err;    /* (p-1)(q-1) */
 163
 164 /* should not be needed, since gcd(p-1,e) == 1 and gcd(q-1,e) == 1 */
 165 /*      for (;;)
 166                 {
 167                 if (!BN_gcd(r3,r0,rsa->e,ctx)) goto err;
 168                 if (BN_is_one(r3)) break;
 169
 170                 if (1)
 171                         {
 172                         if (!BN_add_word(rsa->e,2L)) goto err;
 173                         continue;
 174                         }
 175                 RSAerr(RSA_F_RSA_GENERATE_KEY,RSA_R_BAD_E_VALUE);
 176                 goto err;
 177                 }
 178 */
 179         rsa->d=BN_mod_inverse(NULL,rsa->e,r0,ctx2);     /* d */
 180         if (rsa->d == NULL) goto err;
 181
 182         /* calculate d mod (p-1) */
 183         rsa->dmp1=BN_new();
 184         if (rsa->dmp1 == NULL) goto err;
 185         if (!BN_mod(rsa->dmp1,rsa->d,r1,ctx)) goto err;
 186
 187         /* calculate d mod (q-1) */
 188         rsa->dmq1=BN_new();
 189         if (rsa->dmq1 == NULL) goto err;
 190         if (!BN_mod(rsa->dmq1,rsa->d,r2,ctx)) goto err;
 191
 192         /* calculate inverse of q mod p */
 193         rsa->iqmp=BN_mod_inverse(NULL,rsa->q,rsa->p,ctx2);
 194         if (rsa->iqmp == NULL) goto err;
 195
 196         ok=1;
 197 err:
 198         if (ok == -1)
 199                 {
 200                 RSAerr(RSA_F_RSA_GENERATE_KEY,ERR_LIB_BN);
 201                 ok=0;
 202                 }
 203         BN_CTX_end(ctx);
 204         BN_CTX_free(ctx);
 205         BN_CTX_free(ctx2);
 206
 207         if (!ok)
 208                 {
 209                 if (rsa != NULL) RSA_free(rsa);
 210                 return(NULL);
 211                 }
 212         else
 213                 return(rsa);
 214         }
 215