1 /* crypto/rsa/rsa_eay.c */
2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
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.
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).
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.
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
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)"
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
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.]
61 #include <openssl/bn.h>
62 #include <openssl/rsa.h>
63 #include <openssl/rand.h>
65 static int RSA_eay_public_encrypt(int flen, unsigned char *from,
66 unsigned char *to, RSA *rsa,int padding);
67 static int RSA_eay_private_encrypt(int flen, unsigned char *from,
68 unsigned char *to, RSA *rsa,int padding);
69 static int RSA_eay_public_decrypt(int flen, unsigned char *from,
70 unsigned char *to, RSA *rsa,int padding);
71 static int RSA_eay_private_decrypt(int flen, unsigned char *from,
72 unsigned char *to, RSA *rsa,int padding);
73 static int RSA_eay_mod_exp(BIGNUM *r0, BIGNUM *i, RSA *rsa);
74 static int RSA_eay_init(RSA *rsa);
75 static int RSA_eay_finish(RSA *rsa);
76 static RSA_METHOD rsa_pkcs1_eay_meth={
77 "Eric Young's PKCS#1 RSA",
78 RSA_eay_public_encrypt,
79 RSA_eay_public_decrypt,
80 RSA_eay_private_encrypt,
81 RSA_eay_private_decrypt,
90 RSA_METHOD *RSA_PKCS1_SSLeay(void)
92 return(&rsa_pkcs1_eay_meth);
95 static int RSA_eay_public_encrypt(int flen, unsigned char *from,
96 unsigned char *to, RSA *rsa, int padding)
99 int i,j,k,num=0,r= -1;
100 unsigned char *buf=NULL;
105 if ((ctx=BN_CTX_new()) == NULL) goto err;
106 num=BN_num_bytes(rsa->n);
107 if ((buf=(unsigned char *)Malloc(num)) == NULL)
109 RSAerr(RSA_F_RSA_EAY_PUBLIC_ENCRYPT,ERR_R_MALLOC_FAILURE);
115 case RSA_PKCS1_PADDING:
116 i=RSA_padding_add_PKCS1_type_2(buf,num,from,flen);
118 case RSA_PKCS1_OAEP_PADDING:
119 i=RSA_padding_add_PKCS1_OAEP(buf,num,from,flen,NULL,0);
121 case RSA_SSLV23_PADDING:
122 i=RSA_padding_add_SSLv23(buf,num,from,flen);
125 i=RSA_padding_add_none(buf,num,from,flen);
128 RSAerr(RSA_F_RSA_EAY_PUBLIC_ENCRYPT,RSA_R_UNKNOWN_PADDING_TYPE);
131 if (i <= 0) goto err;
133 if (BN_bin2bn(buf,num,&f) == NULL) goto err;
135 if ((rsa->_method_mod_n == NULL) && (rsa->flags & RSA_FLAG_CACHE_PUBLIC))
137 if ((rsa->_method_mod_n=BN_MONT_CTX_new()) != NULL)
138 if (!BN_MONT_CTX_set(rsa->_method_mod_n,rsa->n,ctx))
142 if (!rsa->meth->bn_mod_exp(&ret,&f,rsa->e,rsa->n,ctx,
143 rsa->_method_mod_n)) goto err;
145 /* put in leading 0 bytes if the number is less than the
146 * length of the modulus */
147 j=BN_num_bytes(&ret);
148 i=BN_bn2bin(&ret,&(to[num-j]));
149 for (k=0; k<(num-i); k++)
154 if (ctx != NULL) BN_CTX_free(ctx);
165 static int RSA_eay_private_encrypt(int flen, unsigned char *from,
166 unsigned char *to, RSA *rsa, int padding)
169 int i,j,k,num=0,r= -1;
170 unsigned char *buf=NULL;
176 if ((ctx=BN_CTX_new()) == NULL) goto err;
177 num=BN_num_bytes(rsa->n);
178 if ((buf=(unsigned char *)Malloc(num)) == NULL)
180 RSAerr(RSA_F_RSA_EAY_PRIVATE_ENCRYPT,ERR_R_MALLOC_FAILURE);
186 case RSA_PKCS1_PADDING:
187 i=RSA_padding_add_PKCS1_type_1(buf,num,from,flen);
190 i=RSA_padding_add_none(buf,num,from,flen);
192 case RSA_SSLV23_PADDING:
194 RSAerr(RSA_F_RSA_EAY_PRIVATE_ENCRYPT,RSA_R_UNKNOWN_PADDING_TYPE);
197 if (i <= 0) goto err;
199 if (BN_bin2bn(buf,num,&f) == NULL) goto err;
201 if ((rsa->flags & RSA_FLAG_BLINDING) && (rsa->blinding == NULL))
202 RSA_blinding_on(rsa,ctx);
203 if (rsa->flags & RSA_FLAG_BLINDING)
204 if (!BN_BLINDING_convert(&f,rsa->blinding,ctx)) goto err;
206 if ( (rsa->p != NULL) &&
208 (rsa->dmp1 != NULL) &&
209 (rsa->dmq1 != NULL) &&
211 { if (!rsa->meth->rsa_mod_exp(&ret,&f,rsa)) goto err; }
214 if (!rsa->meth->bn_mod_exp(&ret,&f,rsa->d,rsa->n,ctx,NULL)) goto err;
217 if (rsa->flags & RSA_FLAG_BLINDING)
218 if (!BN_BLINDING_invert(&ret,rsa->blinding,ctx)) goto err;
220 /* put in leading 0 bytes if the number is less than the
221 * length of the modulus */
222 j=BN_num_bytes(&ret);
223 i=BN_bn2bin(&ret,&(to[num-j]));
224 for (k=0; k<(num-i); k++)
229 if (ctx != NULL) BN_CTX_free(ctx);
240 static int RSA_eay_private_decrypt(int flen, unsigned char *from,
241 unsigned char *to, RSA *rsa, int padding)
246 unsigned char *buf=NULL;
252 if (ctx == NULL) goto err;
254 num=BN_num_bytes(rsa->n);
256 if ((buf=(unsigned char *)Malloc(num)) == NULL)
258 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT,ERR_R_MALLOC_FAILURE);
262 /* This check was for equallity but PGP does evil things
263 * and chops off the top '0' bytes */
266 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT,RSA_R_DATA_GREATER_THAN_MOD_LEN);
270 /* make data into a big number */
271 if (BN_bin2bn(from,(int)flen,&f) == NULL) goto err;
273 if ((rsa->flags & RSA_FLAG_BLINDING) && (rsa->blinding == NULL))
274 RSA_blinding_on(rsa,ctx);
275 if (rsa->flags & RSA_FLAG_BLINDING)
276 if (!BN_BLINDING_convert(&f,rsa->blinding,ctx)) goto err;
279 if ( (rsa->p != NULL) &&
281 (rsa->dmp1 != NULL) &&
282 (rsa->dmq1 != NULL) &&
284 { if (!rsa->meth->rsa_mod_exp(&ret,&f,rsa)) goto err; }
287 if (!rsa->meth->bn_mod_exp(&ret,&f,rsa->d,rsa->n,ctx,NULL))
291 if (rsa->flags & RSA_FLAG_BLINDING)
292 if (!BN_BLINDING_invert(&ret,rsa->blinding,ctx)) goto err;
295 j=BN_bn2bin(&ret,p); /* j is only used with no-padding mode */
299 case RSA_PKCS1_PADDING:
300 r=RSA_padding_check_PKCS1_type_2(to,num,buf,j,num);
302 case RSA_PKCS1_OAEP_PADDING:
303 r=RSA_padding_check_PKCS1_OAEP(to,num,buf,j,num,NULL,0);
305 case RSA_SSLV23_PADDING:
306 r=RSA_padding_check_SSLv23(to,num,buf,j,num);
309 r=RSA_padding_check_none(to,num,buf,j,num);
312 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT,RSA_R_UNKNOWN_PADDING_TYPE);
316 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT,RSA_R_PADDING_CHECK_FAILED);
319 if (ctx != NULL) BN_CTX_free(ctx);
330 static int RSA_eay_public_decrypt(int flen, unsigned char *from,
331 unsigned char *to, RSA *rsa, int padding)
336 unsigned char *buf=NULL;
342 if (ctx == NULL) goto err;
344 num=BN_num_bytes(rsa->n);
345 buf=(unsigned char *)Malloc(num);
348 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT,ERR_R_MALLOC_FAILURE);
352 /* This check was for equallity but PGP does evil things
353 * and chops off the top '0' bytes */
356 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT,RSA_R_DATA_GREATER_THAN_MOD_LEN);
360 if (BN_bin2bn(from,flen,&f) == NULL) goto err;
362 if ((rsa->_method_mod_n == NULL) && (rsa->flags & RSA_FLAG_CACHE_PUBLIC))
364 if ((rsa->_method_mod_n=BN_MONT_CTX_new()) != NULL)
365 if (!BN_MONT_CTX_set(rsa->_method_mod_n,rsa->n,ctx))
369 if (!rsa->meth->bn_mod_exp(&ret,&f,rsa->e,rsa->n,ctx,
370 rsa->_method_mod_n)) goto err;
377 case RSA_PKCS1_PADDING:
378 r=RSA_padding_check_PKCS1_type_1(to,num,buf,i,num);
381 r=RSA_padding_check_none(to,num,buf,i,num);
384 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT,RSA_R_UNKNOWN_PADDING_TYPE);
388 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT,RSA_R_PADDING_CHECK_FAILED);
391 if (ctx != NULL) BN_CTX_free(ctx);
402 static int RSA_eay_mod_exp(BIGNUM *r0, BIGNUM *I, RSA *rsa)
408 if ((ctx=BN_CTX_new()) == NULL) goto err;
412 if (rsa->flags & RSA_FLAG_CACHE_PRIVATE)
414 if (rsa->_method_mod_p == NULL)
416 if ((rsa->_method_mod_p=BN_MONT_CTX_new()) != NULL)
417 if (!BN_MONT_CTX_set(rsa->_method_mod_p,rsa->p,
421 if (rsa->_method_mod_q == NULL)
423 if ((rsa->_method_mod_q=BN_MONT_CTX_new()) != NULL)
424 if (!BN_MONT_CTX_set(rsa->_method_mod_q,rsa->q,
430 if (!BN_mod(&r1,I,rsa->q,ctx)) goto err;
431 if (!rsa->meth->bn_mod_exp(&m1,&r1,rsa->dmq1,rsa->q,ctx,
432 rsa->_method_mod_q)) goto err;
434 if (!BN_mod(&r1,I,rsa->p,ctx)) goto err;
435 if (!rsa->meth->bn_mod_exp(r0,&r1,rsa->dmp1,rsa->p,ctx,
436 rsa->_method_mod_p)) goto err;
438 if (!BN_sub(r0,r0,&m1)) goto err;
439 /* This will help stop the size of r0 increasing, which does
440 * affect the multiply if it optimised for a power of 2 size */
442 if (!BN_add(r0,r0,rsa->p)) goto err;
444 if (!BN_mul(&r1,r0,rsa->iqmp,ctx)) goto err;
445 if (!BN_mod(r0,&r1,rsa->p,ctx)) goto err;
446 /* If p < q it is occasionally possible for the correction of
447 * adding 'p' if r0 is negative above to leave the result still
448 * negative. This can break the private key operations: the following
449 * second correction should *always* correct this rare occurrence.
450 * This will *never* happen with OpenSSL generated keys because
451 * they ensure p > q [steve]
454 if (!BN_add(r0,r0,rsa->p)) goto err;
455 if (!BN_mul(&r1,r0,rsa->q,ctx)) goto err;
456 if (!BN_add(r0,&r1,&m1)) goto err;
466 static int RSA_eay_init(RSA *rsa)
468 rsa->flags|=RSA_FLAG_CACHE_PUBLIC|RSA_FLAG_CACHE_PRIVATE;
472 static int RSA_eay_finish(RSA *rsa)
474 if (rsa->_method_mod_n != NULL)
475 BN_MONT_CTX_free(rsa->_method_mod_n);
476 if (rsa->_method_mod_p != NULL)
477 BN_MONT_CTX_free(rsa->_method_mod_p);
478 if (rsa->_method_mod_q != NULL)
479 BN_MONT_CTX_free(rsa->_method_mod_q);