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>
67 static int RSA_eay_public_encrypt(int flen, unsigned char *from,
68 unsigned char *to, RSA *rsa,int padding);
69 static int RSA_eay_private_encrypt(int flen, unsigned char *from,
70 unsigned char *to, RSA *rsa,int padding);
71 static int RSA_eay_public_decrypt(int flen, unsigned char *from,
72 unsigned char *to, RSA *rsa,int padding);
73 static int RSA_eay_private_decrypt(int flen, unsigned char *from,
74 unsigned char *to, RSA *rsa,int padding);
75 static int RSA_eay_mod_exp(BIGNUM *r0, BIGNUM *i, RSA *rsa);
76 static int RSA_eay_init(RSA *rsa);
77 static int RSA_eay_finish(RSA *rsa);
78 static RSA_METHOD rsa_pkcs1_eay_meth={
79 "Eric Young's PKCS#1 RSA",
80 RSA_eay_public_encrypt,
81 RSA_eay_public_decrypt,
82 RSA_eay_private_encrypt,
83 RSA_eay_private_decrypt,
92 RSA_METHOD *RSA_PKCS1_SSLeay(void)
94 return(&rsa_pkcs1_eay_meth);
97 static int RSA_eay_public_encrypt(int flen, unsigned char *from,
98 unsigned char *to, RSA *rsa, int padding)
101 int i,j,k,num=0,r= -1;
102 unsigned char *buf=NULL;
107 if ((ctx=BN_CTX_new()) == NULL) goto err;
108 num=BN_num_bytes(rsa->n);
109 if ((buf=(unsigned char *)OPENSSL_malloc(num)) == NULL)
111 RSAerr(RSA_F_RSA_EAY_PUBLIC_ENCRYPT,ERR_R_MALLOC_FAILURE);
117 case RSA_PKCS1_PADDING:
118 i=RSA_padding_add_PKCS1_type_2(buf,num,from,flen);
121 case RSA_PKCS1_OAEP_PADDING:
122 i=RSA_padding_add_PKCS1_OAEP(buf,num,from,flen,NULL,0);
125 case RSA_SSLV23_PADDING:
126 i=RSA_padding_add_SSLv23(buf,num,from,flen);
129 i=RSA_padding_add_none(buf,num,from,flen);
132 RSAerr(RSA_F_RSA_EAY_PUBLIC_ENCRYPT,RSA_R_UNKNOWN_PADDING_TYPE);
135 if (i <= 0) goto err;
137 if (BN_bin2bn(buf,num,&f) == NULL) goto err;
139 if ((rsa->_method_mod_n == NULL) && (rsa->flags & RSA_FLAG_CACHE_PUBLIC))
141 BN_MONT_CTX* bn_mont_ctx;
142 if ((bn_mont_ctx=BN_MONT_CTX_new()) == NULL)
144 if (!BN_MONT_CTX_set(bn_mont_ctx,rsa->n,ctx))
146 BN_MONT_CTX_free(bn_mont_ctx);
149 if (rsa->_method_mod_n == NULL) /* other thread may have finished first */
151 CRYPTO_w_lock(CRYPTO_LOCK_RSA);
152 if (rsa->_method_mod_n == NULL)
154 rsa->_method_mod_n = bn_mont_ctx;
157 CRYPTO_w_unlock(CRYPTO_LOCK_RSA);
160 BN_MONT_CTX_free(bn_mont_ctx);
163 if (!rsa->meth->bn_mod_exp(&ret,&f,rsa->e,rsa->n,ctx,
164 rsa->_method_mod_n)) goto err;
166 /* put in leading 0 bytes if the number is less than the
167 * length of the modulus */
168 j=BN_num_bytes(&ret);
169 i=BN_bn2bin(&ret,&(to[num-j]));
170 for (k=0; k<(num-i); k++)
175 if (ctx != NULL) BN_CTX_free(ctx);
186 static int RSA_eay_private_encrypt(int flen, unsigned char *from,
187 unsigned char *to, RSA *rsa, int padding)
190 int i,j,k,num=0,r= -1;
191 unsigned char *buf=NULL;
197 if ((ctx=BN_CTX_new()) == NULL) goto err;
198 num=BN_num_bytes(rsa->n);
199 if ((buf=(unsigned char *)OPENSSL_malloc(num)) == NULL)
201 RSAerr(RSA_F_RSA_EAY_PRIVATE_ENCRYPT,ERR_R_MALLOC_FAILURE);
207 case RSA_PKCS1_PADDING:
208 i=RSA_padding_add_PKCS1_type_1(buf,num,from,flen);
211 i=RSA_padding_add_none(buf,num,from,flen);
213 case RSA_SSLV23_PADDING:
215 RSAerr(RSA_F_RSA_EAY_PRIVATE_ENCRYPT,RSA_R_UNKNOWN_PADDING_TYPE);
218 if (i <= 0) goto err;
220 if (BN_bin2bn(buf,num,&f) == NULL) goto err;
222 if ((rsa->flags & RSA_FLAG_BLINDING) && (rsa->blinding == NULL))
223 RSA_blinding_on(rsa,ctx);
224 if (rsa->flags & RSA_FLAG_BLINDING)
225 if (!BN_BLINDING_convert(&f,rsa->blinding,ctx)) goto err;
227 if ( (rsa->flags & RSA_FLAG_EXT_PKEY) ||
230 (rsa->dmp1 != NULL) &&
231 (rsa->dmq1 != NULL) &&
232 (rsa->iqmp != NULL)) )
233 { if (!rsa->meth->rsa_mod_exp(&ret,&f,rsa)) goto err; }
236 if (!rsa->meth->bn_mod_exp(&ret,&f,rsa->d,rsa->n,ctx,NULL)) goto err;
239 if (rsa->flags & RSA_FLAG_BLINDING)
240 if (!BN_BLINDING_invert(&ret,rsa->blinding,ctx)) goto err;
242 /* put in leading 0 bytes if the number is less than the
243 * length of the modulus */
244 j=BN_num_bytes(&ret);
245 i=BN_bn2bin(&ret,&(to[num-j]));
246 for (k=0; k<(num-i); k++)
251 if (ctx != NULL) BN_CTX_free(ctx);
262 static int RSA_eay_private_decrypt(int flen, unsigned char *from,
263 unsigned char *to, RSA *rsa, int padding)
268 unsigned char *buf=NULL;
274 if (ctx == NULL) goto err;
276 num=BN_num_bytes(rsa->n);
278 if ((buf=(unsigned char *)OPENSSL_malloc(num)) == NULL)
280 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT,ERR_R_MALLOC_FAILURE);
284 /* This check was for equality but PGP does evil things
285 * and chops off the top '0' bytes */
288 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT,RSA_R_DATA_GREATER_THAN_MOD_LEN);
292 /* make data into a big number */
293 if (BN_bin2bn(from,(int)flen,&f) == NULL) goto err;
295 if ((rsa->flags & RSA_FLAG_BLINDING) && (rsa->blinding == NULL))
296 RSA_blinding_on(rsa,ctx);
297 if (rsa->flags & RSA_FLAG_BLINDING)
298 if (!BN_BLINDING_convert(&f,rsa->blinding,ctx)) goto err;
301 if ( (rsa->flags & RSA_FLAG_EXT_PKEY) ||
304 (rsa->dmp1 != NULL) &&
305 (rsa->dmq1 != NULL) &&
306 (rsa->iqmp != NULL)) )
307 { if (!rsa->meth->rsa_mod_exp(&ret,&f,rsa)) goto err; }
310 if (!rsa->meth->bn_mod_exp(&ret,&f,rsa->d,rsa->n,ctx,NULL))
314 if (rsa->flags & RSA_FLAG_BLINDING)
315 if (!BN_BLINDING_invert(&ret,rsa->blinding,ctx)) goto err;
318 j=BN_bn2bin(&ret,p); /* j is only used with no-padding mode */
322 case RSA_PKCS1_PADDING:
323 r=RSA_padding_check_PKCS1_type_2(to,num,buf,j,num);
326 case RSA_PKCS1_OAEP_PADDING:
327 r=RSA_padding_check_PKCS1_OAEP(to,num,buf,j,num,NULL,0);
330 case RSA_SSLV23_PADDING:
331 r=RSA_padding_check_SSLv23(to,num,buf,j,num);
334 r=RSA_padding_check_none(to,num,buf,j,num);
337 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT,RSA_R_UNKNOWN_PADDING_TYPE);
341 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT,RSA_R_PADDING_CHECK_FAILED);
344 if (ctx != NULL) BN_CTX_free(ctx);
355 static int RSA_eay_public_decrypt(int flen, unsigned char *from,
356 unsigned char *to, RSA *rsa, int padding)
361 unsigned char *buf=NULL;
367 if (ctx == NULL) goto err;
369 num=BN_num_bytes(rsa->n);
370 buf=(unsigned char *)OPENSSL_malloc(num);
373 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT,ERR_R_MALLOC_FAILURE);
377 /* This check was for equality but PGP does evil things
378 * and chops off the top '0' bytes */
381 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT,RSA_R_DATA_GREATER_THAN_MOD_LEN);
385 if (BN_bin2bn(from,flen,&f) == NULL) goto err;
387 if ((rsa->_method_mod_n == NULL) && (rsa->flags & RSA_FLAG_CACHE_PUBLIC))
389 BN_MONT_CTX* bn_mont_ctx;
390 if ((bn_mont_ctx=BN_MONT_CTX_new()) == NULL)
392 if (!BN_MONT_CTX_set(bn_mont_ctx,rsa->n,ctx))
394 BN_MONT_CTX_free(bn_mont_ctx);
397 if (rsa->_method_mod_n == NULL) /* other thread may have finished first */
399 CRYPTO_w_lock(CRYPTO_LOCK_RSA);
400 if (rsa->_method_mod_n == NULL)
402 rsa->_method_mod_n = bn_mont_ctx;
405 CRYPTO_w_unlock(CRYPTO_LOCK_RSA);
408 BN_MONT_CTX_free(bn_mont_ctx);
411 if (!rsa->meth->bn_mod_exp(&ret,&f,rsa->e,rsa->n,ctx,
412 rsa->_method_mod_n)) goto err;
419 case RSA_PKCS1_PADDING:
420 r=RSA_padding_check_PKCS1_type_1(to,num,buf,i,num);
423 r=RSA_padding_check_none(to,num,buf,i,num);
426 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT,RSA_R_UNKNOWN_PADDING_TYPE);
430 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT,RSA_R_PADDING_CHECK_FAILED);
433 if (ctx != NULL) BN_CTX_free(ctx);
444 static int RSA_eay_mod_exp(BIGNUM *r0, BIGNUM *I, RSA *rsa)
450 if ((ctx=BN_CTX_new()) == NULL) goto err;
454 if (rsa->flags & RSA_FLAG_CACHE_PRIVATE)
456 if (rsa->_method_mod_p == NULL)
458 BN_MONT_CTX* bn_mont_ctx;
459 if ((bn_mont_ctx=BN_MONT_CTX_new()) == NULL)
461 if (!BN_MONT_CTX_set(bn_mont_ctx,rsa->p,ctx))
463 BN_MONT_CTX_free(bn_mont_ctx);
466 if (rsa->_method_mod_p == NULL) /* other thread may have finished first */
468 CRYPTO_w_lock(CRYPTO_LOCK_RSA);
469 if (rsa->_method_mod_p == NULL)
471 rsa->_method_mod_p = bn_mont_ctx;
474 CRYPTO_w_unlock(CRYPTO_LOCK_RSA);
477 BN_MONT_CTX_free(bn_mont_ctx);
480 if (rsa->_method_mod_q == NULL)
482 BN_MONT_CTX* bn_mont_ctx;
483 if ((bn_mont_ctx=BN_MONT_CTX_new()) == NULL)
485 if (!BN_MONT_CTX_set(bn_mont_ctx,rsa->q,ctx))
487 BN_MONT_CTX_free(bn_mont_ctx);
490 if (rsa->_method_mod_q == NULL) /* other thread may have finished first */
492 CRYPTO_w_lock(CRYPTO_LOCK_RSA);
493 if (rsa->_method_mod_q == NULL)
495 rsa->_method_mod_q = bn_mont_ctx;
498 CRYPTO_w_unlock(CRYPTO_LOCK_RSA);
501 BN_MONT_CTX_free(bn_mont_ctx);
505 if (!BN_mod(&r1,I,rsa->q,ctx)) goto err;
506 if (!rsa->meth->bn_mod_exp(&m1,&r1,rsa->dmq1,rsa->q,ctx,
507 rsa->_method_mod_q)) goto err;
509 if (!BN_mod(&r1,I,rsa->p,ctx)) goto err;
510 if (!rsa->meth->bn_mod_exp(r0,&r1,rsa->dmp1,rsa->p,ctx,
511 rsa->_method_mod_p)) goto err;
513 if (!BN_sub(r0,r0,&m1)) goto err;
514 /* This will help stop the size of r0 increasing, which does
515 * affect the multiply if it optimised for a power of 2 size */
517 if (!BN_add(r0,r0,rsa->p)) goto err;
519 if (!BN_mul(&r1,r0,rsa->iqmp,ctx)) goto err;
520 if (!BN_mod(r0,&r1,rsa->p,ctx)) goto err;
521 /* If p < q it is occasionally possible for the correction of
522 * adding 'p' if r0 is negative above to leave the result still
523 * negative. This can break the private key operations: the following
524 * second correction should *always* correct this rare occurrence.
525 * This will *never* happen with OpenSSL generated keys because
526 * they ensure p > q [steve]
529 if (!BN_add(r0,r0,rsa->p)) goto err;
530 if (!BN_mul(&r1,r0,rsa->q,ctx)) goto err;
531 if (!BN_add(r0,&r1,&m1)) goto err;
541 static int RSA_eay_init(RSA *rsa)
543 rsa->flags|=RSA_FLAG_CACHE_PUBLIC|RSA_FLAG_CACHE_PRIVATE;
547 static int RSA_eay_finish(RSA *rsa)
549 if (rsa->_method_mod_n != NULL)
550 BN_MONT_CTX_free(rsa->_method_mod_n);
551 if (rsa->_method_mod_p != NULL)
552 BN_MONT_CTX_free(rsa->_method_mod_p);
553 if (rsa->_method_mod_q != NULL)
554 BN_MONT_CTX_free(rsa->_method_mod_q);