rsa_lib.c 8.2 KB
Newer Older
1
/* crypto/rsa/rsa_lib.c */
2
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59
 * All rights reserved.
 *
 * This package is an SSL implementation written
 * by Eric Young (eay@cryptsoft.com).
 * The implementation was written so as to conform with Netscapes SSL.
 * 
 * This library is free for commercial and non-commercial use as long as
 * the following conditions are aheared to.  The following conditions
 * apply to all code found in this distribution, be it the RC4, RSA,
 * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
 * included with this distribution is covered by the same copyright terms
 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
 * 
 * Copyright remains Eric Young's, and as such any Copyright notices in
 * the code are not to be removed.
 * If this package is used in a product, Eric Young should be given attribution
 * as the author of the parts of the library used.
 * This can be in the form of a textual message at program startup or
 * in documentation (online or textual) provided with the package.
 * 
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *    "This product includes cryptographic software written by
 *     Eric Young (eay@cryptsoft.com)"
 *    The word 'cryptographic' can be left out if the rouines from the library
 *    being used are not cryptographic related :-).
 * 4. If you include any Windows specific code (or a derivative thereof) from 
 *    the apps directory (application code) you must include an acknowledgement:
 *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
 * 
 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 * 
 * The licence and distribution terms for any publically available version or
 * derivative of this code cannot be changed.  i.e. this code cannot simply be
 * copied and put under another distribution licence
 * [including the GNU Public Licence.]
 */

#include <stdio.h>
60
#include <openssl/crypto.h>
61
#include "cryptlib.h"
62 63 64
#include <openssl/lhash.h>
#include <openssl/bn.h>
#include <openssl/rsa.h>
65

B
Ben Laurie 已提交
66
const char *RSA_version="RSA" OPENSSL_VERSION_PTEXT;
67 68

static RSA_METHOD *default_RSA_meth=NULL;
69 70
static int rsa_meth_num=0;
static STACK *rsa_meth=NULL;
71

U
Ulf Möller 已提交
72
RSA *RSA_new(void)
73 74 75 76
	{
	return(RSA_new_method(NULL));
	}

U
Ulf Möller 已提交
77
void RSA_set_default_method(RSA_METHOD *meth)
78 79 80 81
	{
	default_RSA_meth=meth;
	}

U
Ulf Möller 已提交
82
RSA *RSA_new_method(RSA_METHOD *meth)
83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116
	{
	RSA *ret;

	if (default_RSA_meth == NULL)
		{
#ifdef RSAref
		default_RSA_meth=RSA_PKCS1_RSAref();
#else
		default_RSA_meth=RSA_PKCS1_SSLeay();
#endif
		}
	ret=(RSA *)Malloc(sizeof(RSA));
	if (ret == NULL)
		{
		RSAerr(RSA_F_RSA_NEW_METHOD,ERR_R_MALLOC_FAILURE);
		return(NULL);
		}

	if (meth == NULL)
		ret->meth=default_RSA_meth;
	else
		ret->meth=meth;

	ret->pad=0;
	ret->version=0;
	ret->n=NULL;
	ret->e=NULL;
	ret->d=NULL;
	ret->p=NULL;
	ret->q=NULL;
	ret->dmp1=NULL;
	ret->dmq1=NULL;
	ret->iqmp=NULL;
	ret->references=1;
117 118 119
	ret->_method_mod_n=NULL;
	ret->_method_mod_p=NULL;
	ret->_method_mod_q=NULL;
120
	ret->blinding=NULL;
121
	ret->bignum_data=NULL;
122
	ret->flags=ret->meth->flags;
123 124 125 126 127
	if ((ret->meth->init != NULL) && !ret->meth->init(ret))
		{
		Free(ret);
		ret=NULL;
		}
128 129
	else
		CRYPTO_new_ex_data(rsa_meth,(char *)ret,&ret->ex_data);
130 131 132
	return(ret);
	}

U
Ulf Möller 已提交
133
void RSA_free(RSA *r)
134 135 136 137 138 139
	{
	int i;

	if (r == NULL) return;

	i=CRYPTO_add(&r->references,-1,CRYPTO_LOCK_RSA);
140 141 142
#ifdef REF_PRINT
	REF_PRINT("RSA",r);
#endif
143 144 145 146 147 148 149 150 151
	if (i > 0) return;
#ifdef REF_CHECK
	if (i < 0)
		{
		fprintf(stderr,"RSA_free, bad reference count\n");
		abort();
		}
#endif

152 153
	CRYPTO_free_ex_data(rsa_meth,(char *)r,&r->ex_data);

154 155 156 157 158 159 160 161 162 163 164
	if (r->meth->finish != NULL)
		r->meth->finish(r);

	if (r->n != NULL) BN_clear_free(r->n);
	if (r->e != NULL) BN_clear_free(r->e);
	if (r->d != NULL) BN_clear_free(r->d);
	if (r->p != NULL) BN_clear_free(r->p);
	if (r->q != NULL) BN_clear_free(r->q);
	if (r->dmp1 != NULL) BN_clear_free(r->dmp1);
	if (r->dmq1 != NULL) BN_clear_free(r->dmq1);
	if (r->iqmp != NULL) BN_clear_free(r->iqmp);
165
	if (r->blinding != NULL) BN_BLINDING_free(r->blinding);
166
	if (r->bignum_data != NULL) Free_locked(r->bignum_data);
167 168 169
	Free(r);
	}

U
Ulf Möller 已提交
170 171
int RSA_get_ex_new_index(long argl, char *argp, int (*new_func)(),
	     int (*dup_func)(), void (*free_func)())
172 173 174 175 176 177
        {
	rsa_meth_num++;
	return(CRYPTO_get_ex_new_index(rsa_meth_num-1,
		&rsa_meth,argl,argp,new_func,dup_func,free_func));
        }

U
Ulf Möller 已提交
178
int RSA_set_ex_data(RSA *r, int idx, char *arg)
179 180 181 182
	{
	return(CRYPTO_set_ex_data(&r->ex_data,idx,arg));
	}

U
Ulf Möller 已提交
183
char *RSA_get_ex_data(RSA *r, int idx)
184 185 186 187
	{
	return(CRYPTO_get_ex_data(&r->ex_data,idx));
	}

U
Ulf Möller 已提交
188
int RSA_size(RSA *r)
189 190 191 192
	{
	return(BN_num_bytes(r->n));
	}

U
Ulf Möller 已提交
193 194
int RSA_public_encrypt(int flen, unsigned char *from, unsigned char *to,
	     RSA *rsa, int padding)
195 196 197 198
	{
	return(rsa->meth->rsa_pub_enc(flen, from, to, rsa, padding));
	}

U
Ulf Möller 已提交
199 200
int RSA_private_encrypt(int flen, unsigned char *from, unsigned char *to,
	     RSA *rsa, int padding)
201 202 203 204
	{
	return(rsa->meth->rsa_priv_enc(flen, from, to, rsa, padding));
	}

U
Ulf Möller 已提交
205 206
int RSA_private_decrypt(int flen, unsigned char *from, unsigned char *to,
	     RSA *rsa, int padding)
207 208 209 210
	{
	return(rsa->meth->rsa_priv_dec(flen, from, to, rsa, padding));
	}

U
Ulf Möller 已提交
211 212
int RSA_public_decrypt(int flen, unsigned char *from, unsigned char *to,
	     RSA *rsa, int padding)
213 214 215 216
	{
	return(rsa->meth->rsa_pub_dec(flen, from, to, rsa, padding));
	}

U
Ulf Möller 已提交
217
int RSA_flags(RSA *r)
218 219 220 221
	{
	return((r == NULL)?0:r->meth->flags);
	}

U
Ulf Möller 已提交
222
void RSA_blinding_off(RSA *rsa)
223 224 225 226 227 228 229 230 231
	{
	if (rsa->blinding != NULL)
		{
		BN_BLINDING_free(rsa->blinding);
		rsa->blinding=NULL;
		}
	rsa->flags&= ~RSA_FLAG_BLINDING;
	}

U
Ulf Möller 已提交
232
int RSA_blinding_on(RSA *rsa, BN_CTX *p_ctx)
233 234 235 236 237 238 239 240 241 242 243 244 245 246 247
	{
	BIGNUM *A,*Ai;
	BN_CTX *ctx;
	int ret=0;

	if (p_ctx == NULL)
		{
		if ((ctx=BN_CTX_new()) == NULL) goto err;
		}
	else
		ctx=p_ctx;

	if (rsa->blinding != NULL)
		BN_BLINDING_free(rsa->blinding);

248
	A= &(ctx->bn[0]);
249 250
	ctx->tos++;
	if (!BN_rand(A,BN_num_bits(rsa->n)-1,1,0)) goto err;
251
	if ((Ai=BN_mod_inverse(NULL,A,rsa->n,ctx)) == NULL) goto err;
252

253 254
	if (!rsa->meth->bn_mod_exp(A,A,rsa->e,rsa->n,ctx,rsa->_method_mod_n))
	    goto err;
255 256 257 258 259 260 261 262 263 264
	rsa->blinding=BN_BLINDING_new(A,Ai,rsa->n);
	ctx->tos--;
	rsa->flags|=RSA_FLAG_BLINDING;
	BN_free(Ai);
	ret=1;
err:
	if (ctx != p_ctx) BN_CTX_free(ctx);
	return(ret);
	}

U
Ulf Möller 已提交
265
int RSA_memory_lock(RSA *r)
266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309
	{
	int i,j,k,off;
	char *p;
	BIGNUM *bn,**t[6],*b;
	BN_ULONG *ul;

	if (r->d == NULL) return(1);
	t[0]= &r->d;
	t[1]= &r->p;
	t[2]= &r->q;
	t[3]= &r->dmp1;
	t[4]= &r->dmq1;
	t[5]= &r->iqmp;
	k=sizeof(BIGNUM)*6;
	off=k/sizeof(BN_ULONG)+1;
	j=1;
	for (i=0; i<6; i++)
		j+= (*t[i])->top;
	if ((p=Malloc_locked((off+j)*sizeof(BN_ULONG))) == NULL)
		{
		RSAerr(RSA_F_MEMORY_LOCK,ERR_R_MALLOC_FAILURE);
		return(0);
		}
	bn=(BIGNUM *)p;
	ul=(BN_ULONG *)&(p[off]);
	for (i=0; i<6; i++)
		{
		b= *(t[i]);
		*(t[i])= &(bn[i]);
		memcpy((char *)&(bn[i]),(char *)b,sizeof(BIGNUM));
		bn[i].flags=BN_FLG_STATIC_DATA;
		bn[i].d=ul;
		memcpy((char *)ul,b->d,sizeof(BN_ULONG)*b->top);
		ul+=b->top;
		BN_clear_free(b);
		}
	
	/* I should fix this so it can still be done */
	r->flags&= ~(RSA_FLAG_CACHE_PRIVATE|RSA_FLAG_CACHE_PUBLIC);

	r->bignum_data=p;
	return(1);
	}