[thirdparty/openssl.git] / crypto / rsa / rsa_lib.c

/* crypto/rsa/rsa_lib.c */
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
 * 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>
#include <openssl/crypto.h>
#include "cryptlib.h"
#include <openssl/lhash.h>
#include <openssl/bn.h>
#include <openssl/rsa.h>

const char *RSA_version="RSA" OPENSSL_VERSION_PTEXT;

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

RSA *RSA_new(void)
	{
	return(RSA_new_method(NULL));
	}

void RSA_set_default_method(RSA_METHOD *meth)
	{
	default_RSA_meth=meth;
	}

RSA_METHOD *RSA_get_default_method(void)
{
	return default_RSA_meth;
}

RSA_METHOD *RSA_get_method(RSA *rsa)
{
	return rsa->meth;
}

RSA_METHOD *RSA_set_method(RSA *rsa, RSA_METHOD *meth)
{
	RSA_METHOD *mtmp;
	mtmp = rsa->meth;
	if (mtmp->finish) mtmp->finish(rsa);
	rsa->meth = meth;
	if (meth->init) meth->init(rsa);
	return mtmp;
}

RSA *RSA_new_method(RSA_METHOD *meth)
	{
	RSA *ret;

	if (default_RSA_meth == NULL)
		{
#ifdef RSA_NULL
		default_RSA_meth=RSA_null_method();
#else
#ifdef RSAref
		default_RSA_meth=RSA_PKCS1_RSAref();
#else
		default_RSA_meth=RSA_PKCS1_SSLeay();
#endif
#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;
	ret->_method_mod_n=NULL;
	ret->_method_mod_p=NULL;
	ret->_method_mod_q=NULL;
	ret->blinding=NULL;
	ret->bignum_data=NULL;
	ret->flags=ret->meth->flags;
	if ((ret->meth->init != NULL) && !ret->meth->init(ret))
		{
		Free(ret);
		ret=NULL;
		}
	else
		CRYPTO_new_ex_data(rsa_meth,(char *)ret,&ret->ex_data);
	return(ret);
	}

void RSA_free(RSA *r)
	{
	int i;

	if (r == NULL) return;

	i=CRYPTO_add(&r->references,-1,CRYPTO_LOCK_RSA);
#ifdef REF_PRINT
	REF_PRINT("RSA",r);
#endif
	if (i > 0) return;
#ifdef REF_CHECK
	if (i < 0)
		{
		fprintf(stderr,"RSA_free, bad reference count\n");
		abort();
		}
#endif

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

	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);
	if (r->blinding != NULL) BN_BLINDING_free(r->blinding);
	if (r->bignum_data != NULL) Free_locked(r->bignum_data);
	Free(r);
	}

int RSA_get_ex_new_index(long argl, char *argp, int (*new_func)(),
	     int (*dup_func)(), void (*free_func)())
        {
	rsa_meth_num++;
	return(CRYPTO_get_ex_new_index(rsa_meth_num-1,
		&rsa_meth,argl,argp,new_func,dup_func,free_func));
        }

int RSA_set_ex_data(RSA *r, int idx, char *arg)
	{
	return(CRYPTO_set_ex_data(&r->ex_data,idx,arg));
	}

char *RSA_get_ex_data(RSA *r, int idx)
	{
	return(CRYPTO_get_ex_data(&r->ex_data,idx));
	}

int RSA_size(RSA *r)
	{
	return(BN_num_bytes(r->n));
	}

int RSA_public_encrypt(int flen, unsigned char *from, unsigned char *to,
	     RSA *rsa, int padding)
	{
	return(rsa->meth->rsa_pub_enc(flen, from, to, rsa, padding));
	}

int RSA_private_encrypt(int flen, unsigned char *from, unsigned char *to,
	     RSA *rsa, int padding)
	{
	return(rsa->meth->rsa_priv_enc(flen, from, to, rsa, padding));
	}

int RSA_private_decrypt(int flen, unsigned char *from, unsigned char *to,
	     RSA *rsa, int padding)
	{
	return(rsa->meth->rsa_priv_dec(flen, from, to, rsa, padding));
	}

int RSA_public_decrypt(int flen, unsigned char *from, unsigned char *to,
	     RSA *rsa, int padding)
	{
	return(rsa->meth->rsa_pub_dec(flen, from, to, rsa, padding));
	}

int RSA_flags(RSA *r)
	{
	return((r == NULL)?0:r->meth->flags);
	}

void RSA_blinding_off(RSA *rsa)
	{
	if (rsa->blinding != NULL)
		{
		BN_BLINDING_free(rsa->blinding);
		rsa->blinding=NULL;
		}
	rsa->flags&= ~RSA_FLAG_BLINDING;
	}

int RSA_blinding_on(RSA *rsa, BN_CTX *p_ctx)
	{
	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);

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

	if (!rsa->meth->bn_mod_exp(A,A,rsa->e,rsa->n,ctx,rsa->_method_mod_n))
	    goto err;
	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);
	}

int RSA_memory_lock(RSA *r)
	{
	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);
	}
Commit	Line	Data
d02b48c6	1	/* crypto/rsa/rsa_lib.c */
58964a49	2	/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
d02b48c6 RE	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>
ec577822	60	#include <openssl/crypto.h>
d02b48c6	61	#include "cryptlib.h"
ec577822 BM	62	#include <openssl/lhash.h>
	63	#include <openssl/bn.h>
	64	#include <openssl/rsa.h>
d02b48c6	65
e778802f	66	const char *RSA_version="RSA" OPENSSL_VERSION_PTEXT;
d02b48c6 RE	67
d02b48c6 RE	68	static RSA_METHOD *default_RSA_meth=NULL;
58964a49 RE	69	static int rsa_meth_num=0;
58964a49 RE	70	static STACK *rsa_meth=NULL;
d02b48c6	71
6b691a5c	72	RSA *RSA_new(void)
d02b48c6 RE	73	{
	74	return(RSA_new_method(NULL));
	75	}
	76
6b691a5c	77	void RSA_set_default_method(RSA_METHOD *meth)
d02b48c6 RE	78	{
	79	default_RSA_meth=meth;
	80	}
	81
ce8b2574 DSH	82	RSA_METHOD *RSA_get_default_method(void)
	83	{
	84	return default_RSA_meth;
	85	}
	86
	87	RSA_METHOD RSA_get_method(RSA rsa)
	88	{
	89	return rsa->meth;
	90	}
	91
	92	RSA_METHOD RSA_set_method(RSA rsa, RSA_METHOD *meth)
	93	{
	94	RSA_METHOD *mtmp;
	95	mtmp = rsa->meth;
	96	if (mtmp->finish) mtmp->finish(rsa);
	97	rsa->meth = meth;
	98	if (meth->init) meth->init(rsa);
	99	return mtmp;
	100	}
	101
6b691a5c	102	RSA RSA_new_method(RSA_METHOD meth)
d02b48c6 RE	103	{
	104	RSA *ret;
	105
	106	if (default_RSA_meth == NULL)
	107	{
c1cd88a0 DSH	108	#ifdef RSA_NULL
	109	default_RSA_meth=RSA_null_method();
	110	#else
d02b48c6 RE	111	#ifdef RSAref
	112	default_RSA_meth=RSA_PKCS1_RSAref();
	113	#else
	114	default_RSA_meth=RSA_PKCS1_SSLeay();
c1cd88a0	115	#endif
d02b48c6 RE	116	#endif
	117	}
	118	ret=(RSA *)Malloc(sizeof(RSA));
	119	if (ret == NULL)
	120	{
	121	RSAerr(RSA_F_RSA_NEW_METHOD,ERR_R_MALLOC_FAILURE);
	122	return(NULL);
	123	}
	124
	125	if (meth == NULL)
	126	ret->meth=default_RSA_meth;
	127	else
	128	ret->meth=meth;
	129
	130	ret->pad=0;
	131	ret->version=0;
	132	ret->n=NULL;
	133	ret->e=NULL;
	134	ret->d=NULL;
	135	ret->p=NULL;
	136	ret->q=NULL;
	137	ret->dmp1=NULL;
	138	ret->dmq1=NULL;
	139	ret->iqmp=NULL;
	140	ret->references=1;
03f8b042 BL	141	ret->_method_mod_n=NULL;
	142	ret->_method_mod_p=NULL;
	143	ret->_method_mod_q=NULL;
58964a49	144	ret->blinding=NULL;
dfeab068	145	ret->bignum_data=NULL;
58964a49	146	ret->flags=ret->meth->flags;
d02b48c6 RE	147	if ((ret->meth->init != NULL) && !ret->meth->init(ret))
	148	{
	149	Free(ret);
	150	ret=NULL;
	151	}
dfeab068 RE	152	else
dfeab068 RE	153	CRYPTO_new_ex_data(rsa_meth,(char *)ret,&ret->ex_data);
d02b48c6 RE	154	return(ret);
	155	}
	156
6b691a5c	157	void RSA_free(RSA *r)
d02b48c6 RE	158	{
	159	int i;
	160
	161	if (r == NULL) return;
	162
	163	i=CRYPTO_add(&r->references,-1,CRYPTO_LOCK_RSA);
58964a49 RE	164	#ifdef REF_PRINT
	165	REF_PRINT("RSA",r);
	166	#endif
d02b48c6 RE	167	if (i > 0) return;
	168	#ifdef REF_CHECK
	169	if (i < 0)
	170	{
	171	fprintf(stderr,"RSA_free, bad reference count\n");
	172	abort();
	173	}
	174	#endif
	175
58964a49 RE	176	CRYPTO_free_ex_data(rsa_meth,(char *)r,&r->ex_data);
58964a49 RE	177
d02b48c6 RE	178	if (r->meth->finish != NULL)
	179	r->meth->finish(r);
	180
	181	if (r->n != NULL) BN_clear_free(r->n);
	182	if (r->e != NULL) BN_clear_free(r->e);
	183	if (r->d != NULL) BN_clear_free(r->d);
	184	if (r->p != NULL) BN_clear_free(r->p);
	185	if (r->q != NULL) BN_clear_free(r->q);
	186	if (r->dmp1 != NULL) BN_clear_free(r->dmp1);
	187	if (r->dmq1 != NULL) BN_clear_free(r->dmq1);
	188	if (r->iqmp != NULL) BN_clear_free(r->iqmp);
58964a49	189	if (r->blinding != NULL) BN_BLINDING_free(r->blinding);
dfeab068	190	if (r->bignum_data != NULL) Free_locked(r->bignum_data);
d02b48c6 RE	191	Free(r);
	192	}
	193
6b691a5c UM	194	int RSA_get_ex_new_index(long argl, char argp, int (new_func)(),
6b691a5c UM	195	int (dup_func)(), void (free_func)())
58964a49 RE	196	{
	197	rsa_meth_num++;
	198	return(CRYPTO_get_ex_new_index(rsa_meth_num-1,
	199	&rsa_meth,argl,argp,new_func,dup_func,free_func));
	200	}
	201
6b691a5c	202	int RSA_set_ex_data(RSA r, int idx, char arg)
58964a49 RE	203	{
	204	return(CRYPTO_set_ex_data(&r->ex_data,idx,arg));
	205	}
	206
6b691a5c	207	char RSA_get_ex_data(RSA r, int idx)
58964a49 RE	208	{
	209	return(CRYPTO_get_ex_data(&r->ex_data,idx));
	210	}
	211
6b691a5c	212	int RSA_size(RSA *r)
d02b48c6 RE	213	{
	214	return(BN_num_bytes(r->n));
	215	}
	216
6b691a5c UM	217	int RSA_public_encrypt(int flen, unsigned char from, unsigned char to,
6b691a5c UM	218	RSA *rsa, int padding)
d02b48c6 RE	219	{
	220	return(rsa->meth->rsa_pub_enc(flen, from, to, rsa, padding));
	221	}
	222
6b691a5c UM	223	int RSA_private_encrypt(int flen, unsigned char from, unsigned char to,
6b691a5c UM	224	RSA *rsa, int padding)
d02b48c6 RE	225	{
	226	return(rsa->meth->rsa_priv_enc(flen, from, to, rsa, padding));
	227	}
	228
6b691a5c UM	229	int RSA_private_decrypt(int flen, unsigned char from, unsigned char to,
6b691a5c UM	230	RSA *rsa, int padding)
d02b48c6 RE	231	{
	232	return(rsa->meth->rsa_priv_dec(flen, from, to, rsa, padding));
	233	}
	234
6b691a5c UM	235	int RSA_public_decrypt(int flen, unsigned char from, unsigned char to,
6b691a5c UM	236	RSA *rsa, int padding)
d02b48c6 RE	237	{
	238	return(rsa->meth->rsa_pub_dec(flen, from, to, rsa, padding));
	239	}
	240
6b691a5c	241	int RSA_flags(RSA *r)
58964a49 RE	242	{
	243	return((r == NULL)?0:r->meth->flags);
	244	}
	245
6b691a5c	246	void RSA_blinding_off(RSA *rsa)
58964a49 RE	247	{
	248	if (rsa->blinding != NULL)
	249	{
	250	BN_BLINDING_free(rsa->blinding);
	251	rsa->blinding=NULL;
	252	}
	253	rsa->flags&= ~RSA_FLAG_BLINDING;
	254	}
	255
6b691a5c	256	int RSA_blinding_on(RSA rsa, BN_CTX p_ctx)
58964a49 RE	257	{
	258	BIGNUM A,Ai;
	259	BN_CTX *ctx;
	260	int ret=0;
	261
	262	if (p_ctx == NULL)
	263	{
	264	if ((ctx=BN_CTX_new()) == NULL) goto err;
	265	}
	266	else
	267	ctx=p_ctx;
	268
	269	if (rsa->blinding != NULL)
	270	BN_BLINDING_free(rsa->blinding);
	271
dfeab068	272	A= &(ctx->bn[0]);
58964a49 RE	273	ctx->tos++;
58964a49 RE	274	if (!BN_rand(A,BN_num_bits(rsa->n)-1,1,0)) goto err;
dfeab068	275	if ((Ai=BN_mod_inverse(NULL,A,rsa->n,ctx)) == NULL) goto err;
58964a49	276
03f8b042 BL	277	if (!rsa->meth->bn_mod_exp(A,A,rsa->e,rsa->n,ctx,rsa->_method_mod_n))
03f8b042 BL	278	goto err;
58964a49 RE	279	rsa->blinding=BN_BLINDING_new(A,Ai,rsa->n);
	280	ctx->tos--;
	281	rsa->flags\|=RSA_FLAG_BLINDING;
	282	BN_free(Ai);
	283	ret=1;
	284	err:
	285	if (ctx != p_ctx) BN_CTX_free(ctx);
	286	return(ret);
	287	}
	288
6b691a5c	289	int RSA_memory_lock(RSA *r)
dfeab068 RE	290	{
	291	int i,j,k,off;
	292	char *p;
	293	BIGNUM bn,t[6],b;
	294	BN_ULONG *ul;
	295
	296	if (r->d == NULL) return(1);
	297	t[0]= &r->d;
	298	t[1]= &r->p;
	299	t[2]= &r->q;
	300	t[3]= &r->dmp1;
	301	t[4]= &r->dmq1;
	302	t[5]= &r->iqmp;
	303	k=sizeof(BIGNUM)*6;
	304	off=k/sizeof(BN_ULONG)+1;
	305	j=1;
	306	for (i=0; i<6; i++)
	307	j+= (*t[i])->top;
	308	if ((p=Malloc_locked((off+j)*sizeof(BN_ULONG))) == NULL)
	309	{
	310	RSAerr(RSA_F_MEMORY_LOCK,ERR_R_MALLOC_FAILURE);
	311	return(0);
	312	}
	313	bn=(BIGNUM *)p;
	314	ul=(BN_ULONG *)&(p[off]);
	315	for (i=0; i<6; i++)
	316	{
	317	b= *(t[i]);
	318	*(t[i])= &(bn[i]);
	319	memcpy((char )&(bn[i]),(char )b,sizeof(BIGNUM));
	320	bn[i].flags=BN_FLG_STATIC_DATA;
	321	bn[i].d=ul;
	322	memcpy((char )ul,b->d,sizeof(BN_ULONG)b->top);
	323	ul+=b->top;
	324	BN_clear_free(b);
	325	}
	326
	327	/* I should fix this so it can still be done */
	328	r->flags&= ~(RSA_FLAG_CACHE_PRIVATE\|RSA_FLAG_CACHE_PUBLIC);
	329
	330	r->bignum_data=p;
	331	return(1);
	332	}
	333