1998-12-21 18:52:47 +08:00
|
|
|
/* crypto/rsa/rsa_lib.c */
|
1998-12-21 18:56:39 +08:00
|
|
|
/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
|
1998-12-21 18:52:47 +08:00
|
|
|
* 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>
|
1999-04-24 06:13:45 +08:00
|
|
|
#include <openssl/crypto.h>
|
1998-12-21 18:52:47 +08:00
|
|
|
#include "cryptlib.h"
|
1999-04-24 06:13:45 +08:00
|
|
|
#include <openssl/lhash.h>
|
|
|
|
#include <openssl/bn.h>
|
|
|
|
#include <openssl/rsa.h>
|
1998-12-21 18:52:47 +08:00
|
|
|
|
1999-04-18 05:25:43 +08:00
|
|
|
const char *RSA_version="RSA" OPENSSL_VERSION_PTEXT;
|
1998-12-21 18:52:47 +08:00
|
|
|
|
|
|
|
static RSA_METHOD *default_RSA_meth=NULL;
|
1998-12-21 18:56:39 +08:00
|
|
|
static int rsa_meth_num=0;
|
2000-01-24 07:41:49 +08:00
|
|
|
static STACK_OF(CRYPTO_EX_DATA_FUNCS) *rsa_meth=NULL;
|
1998-12-21 18:52:47 +08:00
|
|
|
|
1999-04-20 05:31:43 +08:00
|
|
|
RSA *RSA_new(void)
|
1998-12-21 18:52:47 +08:00
|
|
|
{
|
|
|
|
return(RSA_new_method(NULL));
|
|
|
|
}
|
|
|
|
|
1999-04-20 05:31:43 +08:00
|
|
|
void RSA_set_default_method(RSA_METHOD *meth)
|
1998-12-21 18:52:47 +08:00
|
|
|
{
|
|
|
|
default_RSA_meth=meth;
|
|
|
|
}
|
|
|
|
|
1999-06-30 06:22:42 +08:00
|
|
|
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;
|
|
|
|
}
|
|
|
|
|
1999-04-20 05:31:43 +08:00
|
|
|
RSA *RSA_new_method(RSA_METHOD *meth)
|
1998-12-21 18:52:47 +08:00
|
|
|
{
|
|
|
|
RSA *ret;
|
|
|
|
|
|
|
|
if (default_RSA_meth == NULL)
|
|
|
|
{
|
1999-09-09 02:19:45 +08:00
|
|
|
#ifdef RSA_NULL
|
|
|
|
default_RSA_meth=RSA_null_method();
|
|
|
|
#else
|
1998-12-21 18:52:47 +08:00
|
|
|
#ifdef RSAref
|
|
|
|
default_RSA_meth=RSA_PKCS1_RSAref();
|
|
|
|
#else
|
|
|
|
default_RSA_meth=RSA_PKCS1_SSLeay();
|
1999-09-09 02:19:45 +08:00
|
|
|
#endif
|
1998-12-21 18:52:47 +08:00
|
|
|
#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;
|
1998-12-30 01:22:31 +08:00
|
|
|
ret->_method_mod_n=NULL;
|
|
|
|
ret->_method_mod_p=NULL;
|
|
|
|
ret->_method_mod_q=NULL;
|
1998-12-21 18:56:39 +08:00
|
|
|
ret->blinding=NULL;
|
1998-12-21 19:00:56 +08:00
|
|
|
ret->bignum_data=NULL;
|
1998-12-21 18:56:39 +08:00
|
|
|
ret->flags=ret->meth->flags;
|
1998-12-21 18:52:47 +08:00
|
|
|
if ((ret->meth->init != NULL) && !ret->meth->init(ret))
|
|
|
|
{
|
|
|
|
Free(ret);
|
|
|
|
ret=NULL;
|
|
|
|
}
|
1998-12-21 19:00:56 +08:00
|
|
|
else
|
2000-01-24 07:41:49 +08:00
|
|
|
CRYPTO_new_ex_data(rsa_meth,ret,&ret->ex_data);
|
1998-12-21 18:52:47 +08:00
|
|
|
return(ret);
|
|
|
|
}
|
|
|
|
|
1999-04-20 05:31:43 +08:00
|
|
|
void RSA_free(RSA *r)
|
1998-12-21 18:52:47 +08:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if (r == NULL) return;
|
|
|
|
|
|
|
|
i=CRYPTO_add(&r->references,-1,CRYPTO_LOCK_RSA);
|
1998-12-21 18:56:39 +08:00
|
|
|
#ifdef REF_PRINT
|
|
|
|
REF_PRINT("RSA",r);
|
|
|
|
#endif
|
1998-12-21 18:52:47 +08:00
|
|
|
if (i > 0) return;
|
|
|
|
#ifdef REF_CHECK
|
|
|
|
if (i < 0)
|
|
|
|
{
|
|
|
|
fprintf(stderr,"RSA_free, bad reference count\n");
|
|
|
|
abort();
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2000-01-24 07:41:49 +08:00
|
|
|
CRYPTO_free_ex_data(rsa_meth,r,&r->ex_data);
|
1998-12-21 18:56:39 +08:00
|
|
|
|
1998-12-21 18:52:47 +08:00
|
|
|
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);
|
1998-12-21 18:56:39 +08:00
|
|
|
if (r->blinding != NULL) BN_BLINDING_free(r->blinding);
|
1998-12-21 19:00:56 +08:00
|
|
|
if (r->bignum_data != NULL) Free_locked(r->bignum_data);
|
1998-12-21 18:52:47 +08:00
|
|
|
Free(r);
|
|
|
|
}
|
|
|
|
|
2000-01-24 07:41:49 +08:00
|
|
|
int RSA_get_ex_new_index(long argl, void *argp, CRYPTO_EX_new *new_func,
|
|
|
|
CRYPTO_EX_dup *dup_func, CRYPTO_EX_free *free_func)
|
1998-12-21 18:56:39 +08:00
|
|
|
{
|
|
|
|
rsa_meth_num++;
|
|
|
|
return(CRYPTO_get_ex_new_index(rsa_meth_num-1,
|
|
|
|
&rsa_meth,argl,argp,new_func,dup_func,free_func));
|
|
|
|
}
|
|
|
|
|
2000-01-24 07:41:49 +08:00
|
|
|
int RSA_set_ex_data(RSA *r, int idx, void *arg)
|
1998-12-21 18:56:39 +08:00
|
|
|
{
|
|
|
|
return(CRYPTO_set_ex_data(&r->ex_data,idx,arg));
|
|
|
|
}
|
|
|
|
|
2000-01-24 07:41:49 +08:00
|
|
|
void *RSA_get_ex_data(RSA *r, int idx)
|
1998-12-21 18:56:39 +08:00
|
|
|
{
|
|
|
|
return(CRYPTO_get_ex_data(&r->ex_data,idx));
|
|
|
|
}
|
|
|
|
|
1999-04-20 05:31:43 +08:00
|
|
|
int RSA_size(RSA *r)
|
1998-12-21 18:52:47 +08:00
|
|
|
{
|
|
|
|
return(BN_num_bytes(r->n));
|
|
|
|
}
|
|
|
|
|
1999-04-20 05:31:43 +08:00
|
|
|
int RSA_public_encrypt(int flen, unsigned char *from, unsigned char *to,
|
|
|
|
RSA *rsa, int padding)
|
1998-12-21 18:52:47 +08:00
|
|
|
{
|
|
|
|
return(rsa->meth->rsa_pub_enc(flen, from, to, rsa, padding));
|
|
|
|
}
|
|
|
|
|
1999-04-20 05:31:43 +08:00
|
|
|
int RSA_private_encrypt(int flen, unsigned char *from, unsigned char *to,
|
|
|
|
RSA *rsa, int padding)
|
1998-12-21 18:52:47 +08:00
|
|
|
{
|
|
|
|
return(rsa->meth->rsa_priv_enc(flen, from, to, rsa, padding));
|
|
|
|
}
|
|
|
|
|
1999-04-20 05:31:43 +08:00
|
|
|
int RSA_private_decrypt(int flen, unsigned char *from, unsigned char *to,
|
|
|
|
RSA *rsa, int padding)
|
1998-12-21 18:52:47 +08:00
|
|
|
{
|
|
|
|
return(rsa->meth->rsa_priv_dec(flen, from, to, rsa, padding));
|
|
|
|
}
|
|
|
|
|
1999-04-20 05:31:43 +08:00
|
|
|
int RSA_public_decrypt(int flen, unsigned char *from, unsigned char *to,
|
|
|
|
RSA *rsa, int padding)
|
1998-12-21 18:52:47 +08:00
|
|
|
{
|
|
|
|
return(rsa->meth->rsa_pub_dec(flen, from, to, rsa, padding));
|
|
|
|
}
|
|
|
|
|
1999-04-20 05:31:43 +08:00
|
|
|
int RSA_flags(RSA *r)
|
1998-12-21 18:56:39 +08:00
|
|
|
{
|
|
|
|
return((r == NULL)?0:r->meth->flags);
|
|
|
|
}
|
|
|
|
|
1999-04-20 05:31:43 +08:00
|
|
|
void RSA_blinding_off(RSA *rsa)
|
1998-12-21 18:56:39 +08:00
|
|
|
{
|
|
|
|
if (rsa->blinding != NULL)
|
|
|
|
{
|
|
|
|
BN_BLINDING_free(rsa->blinding);
|
|
|
|
rsa->blinding=NULL;
|
|
|
|
}
|
|
|
|
rsa->flags&= ~RSA_FLAG_BLINDING;
|
|
|
|
}
|
|
|
|
|
1999-04-20 05:31:43 +08:00
|
|
|
int RSA_blinding_on(RSA *rsa, BN_CTX *p_ctx)
|
1998-12-21 18:56:39 +08:00
|
|
|
{
|
|
|
|
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);
|
|
|
|
|
2000-02-05 22:17:32 +08:00
|
|
|
BN_CTX_start(ctx);
|
|
|
|
A = BN_CTX_get(ctx);
|
1998-12-21 18:56:39 +08:00
|
|
|
if (!BN_rand(A,BN_num_bits(rsa->n)-1,1,0)) goto err;
|
1998-12-21 19:00:56 +08:00
|
|
|
if ((Ai=BN_mod_inverse(NULL,A,rsa->n,ctx)) == NULL) goto err;
|
1998-12-21 18:56:39 +08:00
|
|
|
|
1998-12-30 01:22:31 +08:00
|
|
|
if (!rsa->meth->bn_mod_exp(A,A,rsa->e,rsa->n,ctx,rsa->_method_mod_n))
|
|
|
|
goto err;
|
1998-12-21 18:56:39 +08:00
|
|
|
rsa->blinding=BN_BLINDING_new(A,Ai,rsa->n);
|
|
|
|
rsa->flags|=RSA_FLAG_BLINDING;
|
|
|
|
BN_free(Ai);
|
|
|
|
ret=1;
|
|
|
|
err:
|
2000-02-05 22:17:32 +08:00
|
|
|
BN_CTX_end(ctx);
|
1998-12-21 18:56:39 +08:00
|
|
|
if (ctx != p_ctx) BN_CTX_free(ctx);
|
|
|
|
return(ret);
|
|
|
|
}
|
|
|
|
|
1999-04-20 05:31:43 +08:00
|
|
|
int RSA_memory_lock(RSA *r)
|
1998-12-21 19:00:56 +08:00
|
|
|
{
|
|
|
|
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);
|
|
|
|
}
|
|
|
|
|