1 /* $OpenBSD: rsa_gen.c,v 1.22 2017/01/29 17:49:23 beck Exp $ */ 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 60 /* NB: these functions have been "upgraded", the deprecated versions (which are 61 * compatibility wrappers using these functions) are in rsa_depr.c. 62 * - Geoff 63 */ 64 65 #include <stdio.h> 66 #include <time.h> 67 68 #include <openssl/bn.h> 69 #include <openssl/err.h> 70 #include <openssl/rsa.h> 71 72 #include "bn_lcl.h" 73 74 static int rsa_builtin_keygen(RSA *rsa, int bits, BIGNUM *e_value, BN_GENCB *cb); 75 76 /* 77 * NB: this wrapper would normally be placed in rsa_lib.c and the static 78 * implementation would probably be in rsa_eay.c. Nonetheless, is kept here so 79 * that we don't introduce a new linker dependency. Eg. any application that 80 * wasn't previously linking object code related to key-generation won't have to 81 * now just because key-generation is part of RSA_METHOD. 82 */ 83 int 84 RSA_generate_key_ex(RSA *rsa, int bits, BIGNUM *e_value, BN_GENCB *cb) 85 { 86 if (rsa->meth->rsa_keygen) 87 return rsa->meth->rsa_keygen(rsa, bits, e_value, cb); 88 return rsa_builtin_keygen(rsa, bits, e_value, cb); 89 } 90 91 static int 92 rsa_builtin_keygen(RSA *rsa, int bits, BIGNUM *e_value, BN_GENCB *cb) 93 { 94 BIGNUM *r0 = NULL, *r1 = NULL, *r2 = NULL, *r3 = NULL, *tmp; 95 BIGNUM pr0, d, p; 96 int bitsp, bitsq, ok = -1, n = 0; 97 BN_CTX *ctx = NULL; 98 99 ctx = BN_CTX_new(); 100 if (ctx == NULL) 101 goto err; 102 BN_CTX_start(ctx); 103 if ((r0 = BN_CTX_get(ctx)) == NULL) 104 goto err; 105 if ((r1 = BN_CTX_get(ctx)) == NULL) 106 goto err; 107 if ((r2 = BN_CTX_get(ctx)) == NULL) 108 goto err; 109 if ((r3 = BN_CTX_get(ctx)) == NULL) 110 goto err; 111 112 bitsp = (bits + 1) / 2; 113 bitsq = bits - bitsp; 114 115 /* We need the RSA components non-NULL */ 116 if (!rsa->n && ((rsa->n = BN_new()) == NULL)) 117 goto err; 118 if (!rsa->d && ((rsa->d = BN_new()) == NULL)) 119 goto err; 120 if (!rsa->e && ((rsa->e = BN_new()) == NULL)) 121 goto err; 122 if (!rsa->p && ((rsa->p = BN_new()) == NULL)) 123 goto err; 124 if (!rsa->q && ((rsa->q = BN_new()) == NULL)) 125 goto err; 126 if (!rsa->dmp1 && ((rsa->dmp1 = BN_new()) == NULL)) 127 goto err; 128 if (!rsa->dmq1 && ((rsa->dmq1 = BN_new()) == NULL)) 129 goto err; 130 if (!rsa->iqmp && ((rsa->iqmp = BN_new()) == NULL)) 131 goto err; 132 133 BN_copy(rsa->e, e_value); 134 135 /* generate p and q */ 136 for (;;) { 137 if (!BN_generate_prime_ex(rsa->p, bitsp, 0, NULL, NULL, cb)) 138 goto err; 139 if (!BN_sub(r2, rsa->p, BN_value_one())) 140 goto err; 141 if (!BN_gcd_ct(r1, r2, rsa->e, ctx)) 142 goto err; 143 if (BN_is_one(r1)) 144 break; 145 if (!BN_GENCB_call(cb, 2, n++)) 146 goto err; 147 } 148 if (!BN_GENCB_call(cb, 3, 0)) 149 goto err; 150 for (;;) { 151 /* 152 * When generating ridiculously small keys, we can get stuck 153 * continually regenerating the same prime values. Check for 154 * this and bail if it happens 3 times. 155 */ 156 unsigned int degenerate = 0; 157 do { 158 if (!BN_generate_prime_ex(rsa->q, bitsq, 0, NULL, NULL, 159 cb)) 160 goto err; 161 } while (BN_cmp(rsa->p, rsa->q) == 0 && 162 ++degenerate < 3); 163 if (degenerate == 3) { 164 ok = 0; /* we set our own err */ 165 RSAerror(RSA_R_KEY_SIZE_TOO_SMALL); 166 goto err; 167 } 168 if (!BN_sub(r2, rsa->q, BN_value_one())) 169 goto err; 170 if (!BN_gcd_ct(r1, r2, rsa->e, ctx)) 171 goto err; 172 if (BN_is_one(r1)) 173 break; 174 if (!BN_GENCB_call(cb, 2, n++)) 175 goto err; 176 } 177 if (!BN_GENCB_call(cb, 3, 1)) 178 goto err; 179 if (BN_cmp(rsa->p, rsa->q) < 0) { 180 tmp = rsa->p; 181 rsa->p = rsa->q; 182 rsa->q = tmp; 183 } 184 185 /* calculate n */ 186 if (!BN_mul(rsa->n, rsa->p, rsa->q, ctx)) 187 goto err; 188 189 /* calculate d */ 190 if (!BN_sub(r1, rsa->p, BN_value_one())) /* p-1 */ 191 goto err; 192 if (!BN_sub(r2, rsa->q, BN_value_one())) /* q-1 */ 193 goto err; 194 if (!BN_mul(r0, r1, r2, ctx)) /* (p-1)(q-1) */ 195 goto err; 196 197 BN_with_flags(&pr0, r0, BN_FLG_CONSTTIME); 198 199 if (!BN_mod_inverse_ct(rsa->d, rsa->e, &pr0, ctx)) /* d */ 200 goto err; 201 202 /* set up d for correct BN_FLG_CONSTTIME flag */ 203 BN_with_flags(&d, rsa->d, BN_FLG_CONSTTIME); 204 205 /* calculate d mod (p-1) */ 206 if (!BN_mod_ct(rsa->dmp1, &d, r1, ctx)) 207 goto err; 208 209 /* calculate d mod (q-1) */ 210 if (!BN_mod_ct(rsa->dmq1, &d, r2, ctx)) 211 goto err; 212 213 /* calculate inverse of q mod p */ 214 BN_with_flags(&p, rsa->p, BN_FLG_CONSTTIME); 215 if (!BN_mod_inverse_ct(rsa->iqmp, rsa->q, &p, ctx)) 216 goto err; 217 218 ok = 1; 219 err: 220 if (ok == -1) { 221 RSAerror(ERR_LIB_BN); 222 ok = 0; 223 } 224 if (ctx != NULL) { 225 BN_CTX_end(ctx); 226 BN_CTX_free(ctx); 227 } 228 229 return ok; 230 } 231