1 /* crypto/rsa/rsa_lib.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 <openssl/crypto.h> 61 #include "cryptlib.h" 62 #include <openssl/lhash.h> 63 #include <openssl/bn.h> 64 #include <openssl/rsa.h> 65 #include <openssl/engine.h> 66 67 const char *RSA_version="RSA" OPENSSL_VERSION_PTEXT; 68 69 static const RSA_METHOD *default_RSA_meth=NULL; 70 71 RSA *RSA_new(void) 72 { 73 return(RSA_new_method(NULL)); 74 } 75 76 void RSA_set_default_method(const RSA_METHOD *meth) 77 { 78 default_RSA_meth = meth; 79 } 80 81 const RSA_METHOD *RSA_get_default_method(void) 82 { 83 if (default_RSA_meth == NULL) 84 { 85 #ifdef RSA_NULL 86 default_RSA_meth=RSA_null_method(); 87 #else 88 #if 0 /* was: #ifdef RSAref */ 89 default_RSA_meth=RSA_PKCS1_RSAref(); 90 #else 91 default_RSA_meth=RSA_PKCS1_SSLeay(); 92 #endif 93 #endif 94 } 95 96 return default_RSA_meth; 97 } 98 99 const RSA_METHOD *RSA_get_method(const RSA *rsa) 100 { 101 return rsa->meth; 102 } 103 104 int RSA_set_method(RSA *rsa, const RSA_METHOD *meth) 105 { 106 /* NB: The caller is specifically setting a method, so it's not up to us 107 * to deal with which ENGINE it comes from. */ 108 const RSA_METHOD *mtmp; 109 mtmp = rsa->meth; 110 if (mtmp->finish) mtmp->finish(rsa); 111 if (rsa->engine) 112 { 113 ENGINE_finish(rsa->engine); 114 rsa->engine = NULL; 115 } 116 rsa->meth = meth; 117 if (meth->init) meth->init(rsa); 118 return 1; 119 } 120 121 RSA *RSA_new_method(ENGINE *engine) 122 { 123 RSA *ret; 124 125 ret=(RSA *)OPENSSL_malloc(sizeof(RSA)); 126 if (ret == NULL) 127 { 128 RSAerr(RSA_F_RSA_NEW_METHOD,ERR_R_MALLOC_FAILURE); 129 return NULL; 130 } 131 132 ret->meth = RSA_get_default_method(); 133 if (engine) 134 { 135 if (!ENGINE_init(engine)) 136 { 137 RSAerr(RSA_F_RSA_NEW_METHOD, ERR_R_ENGINE_LIB); 138 OPENSSL_free(ret); 139 return NULL; 140 } 141 ret->engine = engine; 142 } 143 else 144 ret->engine = ENGINE_get_default_RSA(); 145 if(ret->engine) 146 { 147 ret->meth = ENGINE_get_RSA(ret->engine); 148 if(!ret->meth) 149 { 150 RSAerr(RSA_F_RSA_NEW_METHOD, 151 ERR_R_ENGINE_LIB); 152 ENGINE_finish(ret->engine); 153 OPENSSL_free(ret); 154 return NULL; 155 } 156 } 157 158 ret->pad=0; 159 ret->version=0; 160 ret->n=NULL; 161 ret->e=NULL; 162 ret->d=NULL; 163 ret->p=NULL; 164 ret->q=NULL; 165 ret->dmp1=NULL; 166 ret->dmq1=NULL; 167 ret->iqmp=NULL; 168 ret->references=1; 169 ret->_method_mod_n=NULL; 170 ret->_method_mod_p=NULL; 171 ret->_method_mod_q=NULL; 172 ret->blinding=NULL; 173 ret->bignum_data=NULL; 174 ret->flags=ret->meth->flags; 175 CRYPTO_new_ex_data(CRYPTO_EX_INDEX_RSA, ret, &ret->ex_data); 176 if ((ret->meth->init != NULL) && !ret->meth->init(ret)) 177 { 178 if (ret->engine) 179 ENGINE_finish(ret->engine); 180 CRYPTO_free_ex_data(CRYPTO_EX_INDEX_RSA, ret, &ret->ex_data); 181 OPENSSL_free(ret); 182 ret=NULL; 183 } 184 return(ret); 185 } 186 187 void RSA_free(RSA *r) 188 { 189 int i; 190 191 if (r == NULL) return; 192 193 i=CRYPTO_add(&r->references,-1,CRYPTO_LOCK_RSA); 194 #ifdef REF_PRINT 195 REF_PRINT("RSA",r); 196 #endif 197 if (i > 0) return; 198 #ifdef REF_CHECK 199 if (i < 0) 200 { 201 fprintf(stderr,"RSA_free, bad reference count\n"); 202 abort(); 203 } 204 #endif 205 206 if (r->meth->finish) 207 r->meth->finish(r); 208 if (r->engine) 209 ENGINE_finish(r->engine); 210 211 CRYPTO_free_ex_data(CRYPTO_EX_INDEX_RSA, r, &r->ex_data); 212 213 if (r->n != NULL) BN_clear_free(r->n); 214 if (r->e != NULL) BN_clear_free(r->e); 215 if (r->d != NULL) BN_clear_free(r->d); 216 if (r->p != NULL) BN_clear_free(r->p); 217 if (r->q != NULL) BN_clear_free(r->q); 218 if (r->dmp1 != NULL) BN_clear_free(r->dmp1); 219 if (r->dmq1 != NULL) BN_clear_free(r->dmq1); 220 if (r->iqmp != NULL) BN_clear_free(r->iqmp); 221 if (r->blinding != NULL) BN_BLINDING_free(r->blinding); 222 if (r->bignum_data != NULL) OPENSSL_free_locked(r->bignum_data); 223 OPENSSL_free(r); 224 } 225 226 int RSA_up_ref(RSA *r) 227 { 228 int i = CRYPTO_add(&r->references, 1, CRYPTO_LOCK_RSA); 229 #ifdef REF_PRINT 230 REF_PRINT("RSA",r); 231 #endif 232 #ifdef REF_CHECK 233 if (i < 2) 234 { 235 fprintf(stderr, "RSA_up_ref, bad reference count\n"); 236 abort(); 237 } 238 #endif 239 return ((i > 1) ? 1 : 0); 240 } 241 242 int RSA_get_ex_new_index(long argl, void *argp, CRYPTO_EX_new *new_func, 243 CRYPTO_EX_dup *dup_func, CRYPTO_EX_free *free_func) 244 { 245 return CRYPTO_get_ex_new_index(CRYPTO_EX_INDEX_RSA, argl, argp, 246 new_func, dup_func, free_func); 247 } 248 249 int RSA_set_ex_data(RSA *r, int idx, void *arg) 250 { 251 return(CRYPTO_set_ex_data(&r->ex_data,idx,arg)); 252 } 253 254 void *RSA_get_ex_data(const RSA *r, int idx) 255 { 256 return(CRYPTO_get_ex_data(&r->ex_data,idx)); 257 } 258 259 int RSA_size(const RSA *r) 260 { 261 return(BN_num_bytes(r->n)); 262 } 263 264 int RSA_public_encrypt(int flen, const unsigned char *from, unsigned char *to, 265 RSA *rsa, int padding) 266 { 267 return(rsa->meth->rsa_pub_enc(flen, from, to, rsa, padding)); 268 } 269 270 int RSA_private_encrypt(int flen, const unsigned char *from, unsigned char *to, 271 RSA *rsa, int padding) 272 { 273 return(rsa->meth->rsa_priv_enc(flen, from, to, rsa, padding)); 274 } 275 276 int RSA_private_decrypt(int flen, const unsigned char *from, unsigned char *to, 277 RSA *rsa, int padding) 278 { 279 return(rsa->meth->rsa_priv_dec(flen, from, to, rsa, padding)); 280 } 281 282 int RSA_public_decrypt(int flen, const unsigned char *from, unsigned char *to, 283 RSA *rsa, int padding) 284 { 285 return(rsa->meth->rsa_pub_dec(flen, from, to, rsa, padding)); 286 } 287 288 int RSA_flags(const RSA *r) 289 { 290 return((r == NULL)?0:r->meth->flags); 291 } 292 293 void RSA_blinding_off(RSA *rsa) 294 { 295 if (rsa->blinding != NULL) 296 { 297 BN_BLINDING_free(rsa->blinding); 298 rsa->blinding=NULL; 299 } 300 rsa->flags&= ~RSA_FLAG_BLINDING; 301 } 302 303 int RSA_blinding_on(RSA *rsa, BN_CTX *p_ctx) 304 { 305 BIGNUM *A,*Ai; 306 BN_CTX *ctx; 307 int ret=0; 308 309 if (p_ctx == NULL) 310 { 311 if ((ctx=BN_CTX_new()) == NULL) goto err; 312 } 313 else 314 ctx=p_ctx; 315 316 if (rsa->blinding != NULL) 317 BN_BLINDING_free(rsa->blinding); 318 319 BN_CTX_start(ctx); 320 A = BN_CTX_get(ctx); 321 if (!BN_rand_range(A,rsa->n)) goto err; 322 if ((Ai=BN_mod_inverse(NULL,A,rsa->n,ctx)) == NULL) goto err; 323 324 if (!rsa->meth->bn_mod_exp(A,A,rsa->e,rsa->n,ctx,rsa->_method_mod_n)) 325 goto err; 326 rsa->blinding=BN_BLINDING_new(A,Ai,rsa->n); 327 rsa->flags|=RSA_FLAG_BLINDING; 328 BN_free(Ai); 329 ret=1; 330 err: 331 BN_CTX_end(ctx); 332 if (ctx != p_ctx) BN_CTX_free(ctx); 333 return(ret); 334 } 335 336 int RSA_memory_lock(RSA *r) 337 { 338 int i,j,k,off; 339 char *p; 340 BIGNUM *bn,**t[6],*b; 341 BN_ULONG *ul; 342 343 if (r->d == NULL) return(1); 344 t[0]= &r->d; 345 t[1]= &r->p; 346 t[2]= &r->q; 347 t[3]= &r->dmp1; 348 t[4]= &r->dmq1; 349 t[5]= &r->iqmp; 350 k=sizeof(BIGNUM)*6; 351 off=k/sizeof(BN_ULONG)+1; 352 j=1; 353 for (i=0; i<6; i++) 354 j+= (*t[i])->top; 355 if ((p=OPENSSL_malloc_locked((off+j)*sizeof(BN_ULONG))) == NULL) 356 { 357 RSAerr(RSA_F_MEMORY_LOCK,ERR_R_MALLOC_FAILURE); 358 return(0); 359 } 360 bn=(BIGNUM *)p; 361 ul=(BN_ULONG *)&(p[off]); 362 for (i=0; i<6; i++) 363 { 364 b= *(t[i]); 365 *(t[i])= &(bn[i]); 366 memcpy((char *)&(bn[i]),(char *)b,sizeof(BIGNUM)); 367 bn[i].flags=BN_FLG_STATIC_DATA; 368 bn[i].d=ul; 369 memcpy((char *)ul,b->d,sizeof(BN_ULONG)*b->top); 370 ul+=b->top; 371 BN_clear_free(b); 372 } 373 374 /* I should fix this so it can still be done */ 375 r->flags&= ~(RSA_FLAG_CACHE_PRIVATE|RSA_FLAG_CACHE_PUBLIC); 376 377 r->bignum_data=p; 378 return(1); 379 } 380