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.]
58 /* ====================================================================
59 * Copyright (c) 1998-2006 The OpenSSL Project. All rights reserved.
61 * Redistribution and use in source and binary forms, with or without
62 * modification, are permitted provided that the following conditions
65 * 1. Redistributions of source code must retain the above copyright
66 * notice, this list of conditions and the following disclaimer.
68 * 2. Redistributions in binary form must reproduce the above copyright
69 * notice, this list of conditions and the following disclaimer in
70 * the documentation and/or other materials provided with the
73 * 3. All advertising materials mentioning features or use of this
74 * software must display the following acknowledgment:
75 * "This product includes software developed by the OpenSSL Project
76 * for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
78 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
79 * endorse or promote products derived from this software without
80 * prior written permission. For written permission, please contact
81 * openssl-core@openssl.org.
83 * 5. Products derived from this software may not be called "OpenSSL"
84 * nor may "OpenSSL" appear in their names without prior written
85 * permission of the OpenSSL Project.
87 * 6. Redistributions of any form whatsoever must retain the following
89 * "This product includes software developed by the OpenSSL Project
90 * for use in the OpenSSL Toolkit (http://www.openssl.org/)"
92 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
93 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
94 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
95 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
96 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
97 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
98 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
99 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
100 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
101 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
102 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
103 * OF THE POSSIBILITY OF SUCH DAMAGE.
104 * ====================================================================
106 * This product includes cryptographic software written by Eric Young
107 * (eay@cryptsoft.com). This product includes software written by Tim
108 * Hudson (tjh@cryptsoft.com).
112 #define OPENSSL_FIPSAPI
115 #include "cryptlib.h"
116 #include <openssl/bn.h>
117 #include <openssl/rsa.h>
118 #include <openssl/rand.h>
120 #include <openssl/fips.h>
125 static int RSA_eay_public_encrypt(int flen, const unsigned char *from,
126 unsigned char *to, RSA *rsa,int padding);
127 static int RSA_eay_private_encrypt(int flen, const unsigned char *from,
128 unsigned char *to, RSA *rsa,int padding);
129 static int RSA_eay_public_decrypt(int flen, const unsigned char *from,
130 unsigned char *to, RSA *rsa,int padding);
131 static int RSA_eay_private_decrypt(int flen, const unsigned char *from,
132 unsigned char *to, RSA *rsa,int padding);
133 static int RSA_eay_mod_exp(BIGNUM *r0, const BIGNUM *i, RSA *rsa, BN_CTX *ctx);
134 static int RSA_eay_init(RSA *rsa);
135 static int RSA_eay_finish(RSA *rsa);
136 static RSA_METHOD rsa_pkcs1_eay_meth={
137 "Eric Young's PKCS#1 RSA",
138 RSA_eay_public_encrypt,
139 RSA_eay_public_decrypt, /* signature verification */
140 RSA_eay_private_encrypt, /* signing */
141 RSA_eay_private_decrypt,
143 BN_mod_exp_mont, /* XXX probably we should not use Montgomery if e == 3 */
146 RSA_FLAG_FIPS_METHOD, /* flags */
150 NULL /* rsa_keygen */
153 const RSA_METHOD *RSA_PKCS1_SSLeay(void)
155 return(&rsa_pkcs1_eay_meth);
158 static int RSA_eay_public_encrypt(int flen, const unsigned char *from,
159 unsigned char *to, RSA *rsa, int padding)
162 int i,j,k,num=0,r= -1;
163 unsigned char *buf=NULL;
167 if(FIPS_selftest_failed())
169 FIPSerr(FIPS_F_RSA_EAY_PUBLIC_ENCRYPT,FIPS_R_FIPS_SELFTEST_FAILED);
173 if (FIPS_mode() && !(rsa->flags & RSA_FLAG_NON_FIPS_ALLOW)
174 && (BN_num_bits(rsa->n) < OPENSSL_RSA_FIPS_MIN_MODULUS_BITS))
176 RSAerr(RSA_F_RSA_EAY_PUBLIC_ENCRYPT, RSA_R_KEY_SIZE_TOO_SMALL);
181 if (BN_num_bits(rsa->n) > OPENSSL_RSA_MAX_MODULUS_BITS)
183 RSAerr(RSA_F_RSA_EAY_PUBLIC_ENCRYPT, RSA_R_MODULUS_TOO_LARGE);
187 if (BN_ucmp(rsa->n, rsa->e) <= 0)
189 RSAerr(RSA_F_RSA_EAY_PUBLIC_ENCRYPT, RSA_R_BAD_E_VALUE);
193 /* for large moduli, enforce exponent limit */
194 if (BN_num_bits(rsa->n) > OPENSSL_RSA_SMALL_MODULUS_BITS)
196 if (BN_num_bits(rsa->e) > OPENSSL_RSA_MAX_PUBEXP_BITS)
198 RSAerr(RSA_F_RSA_EAY_PUBLIC_ENCRYPT, RSA_R_BAD_E_VALUE);
203 if ((ctx=BN_CTX_new()) == NULL) goto err;
206 ret = BN_CTX_get(ctx);
207 num=BN_num_bytes(rsa->n);
208 buf = OPENSSL_malloc(num);
209 if (!f || !ret || !buf)
211 RSAerr(RSA_F_RSA_EAY_PUBLIC_ENCRYPT,ERR_R_MALLOC_FAILURE);
217 case RSA_PKCS1_PADDING:
218 i=RSA_padding_add_PKCS1_type_2(buf,num,from,flen);
220 #ifndef OPENSSL_NO_SHA
221 case RSA_PKCS1_OAEP_PADDING:
222 i=RSA_padding_add_PKCS1_OAEP(buf,num,from,flen,NULL,0);
225 case RSA_SSLV23_PADDING:
226 i=RSA_padding_add_SSLv23(buf,num,from,flen);
229 i=RSA_padding_add_none(buf,num,from,flen);
232 RSAerr(RSA_F_RSA_EAY_PUBLIC_ENCRYPT,RSA_R_UNKNOWN_PADDING_TYPE);
235 if (i <= 0) goto err;
237 if (BN_bin2bn(buf,num,f) == NULL) goto err;
239 if (BN_ucmp(f, rsa->n) >= 0)
241 /* usually the padding functions would catch this */
242 RSAerr(RSA_F_RSA_EAY_PUBLIC_ENCRYPT,RSA_R_DATA_TOO_LARGE_FOR_MODULUS);
246 if (rsa->flags & RSA_FLAG_CACHE_PUBLIC)
247 if (!BN_MONT_CTX_set_locked(&rsa->_method_mod_n, CRYPTO_LOCK_RSA, rsa->n, ctx))
250 if (!rsa->meth->bn_mod_exp(ret,f,rsa->e,rsa->n,ctx,
251 rsa->_method_mod_n)) goto err;
253 /* put in leading 0 bytes if the number is less than the
254 * length of the modulus */
256 i=BN_bn2bin(ret,&(to[num-j]));
257 for (k=0; k<(num-i); k++)
269 OPENSSL_cleanse(buf,num);
275 static BN_BLINDING *rsa_get_blinding(RSA *rsa, int *local, BN_CTX *ctx)
278 int got_write_lock = 0;
281 CRYPTO_r_lock(CRYPTO_LOCK_RSA);
283 if (rsa->blinding == NULL)
285 CRYPTO_r_unlock(CRYPTO_LOCK_RSA);
286 CRYPTO_w_lock(CRYPTO_LOCK_RSA);
289 if (rsa->blinding == NULL)
290 rsa->blinding = RSA_setup_blinding(rsa, ctx);
297 CRYPTO_THREADID_current(&cur);
298 if (!CRYPTO_THREADID_cmp(&cur, BN_BLINDING_thread_id(ret)))
300 /* rsa->blinding is ours! */
306 /* resort to rsa->mt_blinding instead */
308 *local = 0; /* instructs rsa_blinding_convert(), rsa_blinding_invert()
309 * that the BN_BLINDING is shared, meaning that accesses
310 * require locks, and that the blinding factor must be
311 * stored outside the BN_BLINDING
314 if (rsa->mt_blinding == NULL)
318 CRYPTO_r_unlock(CRYPTO_LOCK_RSA);
319 CRYPTO_w_lock(CRYPTO_LOCK_RSA);
323 if (rsa->mt_blinding == NULL)
324 rsa->mt_blinding = RSA_setup_blinding(rsa, ctx);
326 ret = rsa->mt_blinding;
331 CRYPTO_w_unlock(CRYPTO_LOCK_RSA);
333 CRYPTO_r_unlock(CRYPTO_LOCK_RSA);
337 static int rsa_blinding_convert(BN_BLINDING *b, int local, BIGNUM *f,
338 BIGNUM *r, BN_CTX *ctx)
341 return BN_BLINDING_convert_ex(f, NULL, b, ctx);
345 CRYPTO_r_lock(CRYPTO_LOCK_RSA_BLINDING);
346 ret = BN_BLINDING_convert_ex(f, r, b, ctx);
347 CRYPTO_r_unlock(CRYPTO_LOCK_RSA_BLINDING);
352 static int rsa_blinding_invert(BN_BLINDING *b, int local, BIGNUM *f,
353 BIGNUM *r, BN_CTX *ctx)
356 return BN_BLINDING_invert_ex(f, NULL, b, ctx);
360 CRYPTO_w_lock(CRYPTO_LOCK_RSA_BLINDING);
361 ret = BN_BLINDING_invert_ex(f, r, b, ctx);
362 CRYPTO_w_unlock(CRYPTO_LOCK_RSA_BLINDING);
368 static int RSA_eay_private_encrypt(int flen, const unsigned char *from,
369 unsigned char *to, RSA *rsa, int padding)
371 BIGNUM *f, *ret, *br, *res;
372 int i,j,k,num=0,r= -1;
373 unsigned char *buf=NULL;
375 int local_blinding = 0;
376 BN_BLINDING *blinding = NULL;
379 if(FIPS_selftest_failed())
381 FIPSerr(FIPS_F_RSA_EAY_PRIVATE_ENCRYPT,FIPS_R_FIPS_SELFTEST_FAILED);
385 if (FIPS_mode() && !(rsa->flags & RSA_FLAG_NON_FIPS_ALLOW)
386 && (BN_num_bits(rsa->n) < OPENSSL_RSA_FIPS_MIN_MODULUS_BITS))
388 RSAerr(RSA_F_RSA_EAY_PRIVATE_ENCRYPT, RSA_R_KEY_SIZE_TOO_SMALL);
393 if ((ctx=BN_CTX_new()) == NULL) goto err;
396 br = BN_CTX_get(ctx);
397 ret = BN_CTX_get(ctx);
398 num = BN_num_bytes(rsa->n);
399 buf = OPENSSL_malloc(num);
400 if(!f || !ret || !buf)
402 RSAerr(RSA_F_RSA_EAY_PRIVATE_ENCRYPT,ERR_R_MALLOC_FAILURE);
408 case RSA_PKCS1_PADDING:
409 i=RSA_padding_add_PKCS1_type_1(buf,num,from,flen);
411 case RSA_X931_PADDING:
412 i=RSA_padding_add_X931(buf,num,from,flen);
415 i=RSA_padding_add_none(buf,num,from,flen);
417 case RSA_SSLV23_PADDING:
419 RSAerr(RSA_F_RSA_EAY_PRIVATE_ENCRYPT,RSA_R_UNKNOWN_PADDING_TYPE);
422 if (i <= 0) goto err;
424 if (BN_bin2bn(buf,num,f) == NULL) goto err;
426 if (BN_ucmp(f, rsa->n) >= 0)
428 /* usually the padding functions would catch this */
429 RSAerr(RSA_F_RSA_EAY_PRIVATE_ENCRYPT,RSA_R_DATA_TOO_LARGE_FOR_MODULUS);
433 if (!(rsa->flags & RSA_FLAG_NO_BLINDING))
435 blinding = rsa_get_blinding(rsa, &local_blinding, ctx);
436 if (blinding == NULL)
438 RSAerr(RSA_F_RSA_EAY_PRIVATE_ENCRYPT, ERR_R_INTERNAL_ERROR);
443 if (blinding != NULL)
444 if (!rsa_blinding_convert(blinding, local_blinding, f, br, ctx))
447 if ( (rsa->flags & RSA_FLAG_EXT_PKEY) ||
450 (rsa->dmp1 != NULL) &&
451 (rsa->dmq1 != NULL) &&
452 (rsa->iqmp != NULL)) )
454 if (!rsa->meth->rsa_mod_exp(ret, f, rsa, ctx)) goto err;
461 if (!(rsa->flags & RSA_FLAG_NO_CONSTTIME))
465 BN_with_flags(d, rsa->d, BN_FLG_CONSTTIME);
470 if (rsa->flags & RSA_FLAG_CACHE_PUBLIC)
471 if(!BN_MONT_CTX_set_locked(&rsa->_method_mod_n, CRYPTO_LOCK_RSA, rsa->n, ctx))
474 if (!rsa->meth->bn_mod_exp(ret,f,d,rsa->n,ctx,
475 rsa->_method_mod_n)) goto err;
479 if (!rsa_blinding_invert(blinding, local_blinding, ret, br, ctx))
482 if (padding == RSA_X931_PADDING)
484 BN_sub(f, rsa->n, ret);
493 /* put in leading 0 bytes if the number is less than the
494 * length of the modulus */
496 i=BN_bn2bin(res,&(to[num-j]));
497 for (k=0; k<(num-i); k++)
509 OPENSSL_cleanse(buf,num);
515 static int RSA_eay_private_decrypt(int flen, const unsigned char *from,
516 unsigned char *to, RSA *rsa, int padding)
518 BIGNUM *f, *ret, *br;
521 unsigned char *buf=NULL;
523 int local_blinding = 0;
524 BN_BLINDING *blinding = NULL;
527 if(FIPS_selftest_failed())
529 FIPSerr(FIPS_F_RSA_EAY_PRIVATE_DECRYPT,FIPS_R_FIPS_SELFTEST_FAILED);
533 if (FIPS_mode() && !(rsa->flags & RSA_FLAG_NON_FIPS_ALLOW)
534 && (BN_num_bits(rsa->n) < OPENSSL_RSA_FIPS_MIN_MODULUS_BITS))
536 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT, RSA_R_KEY_SIZE_TOO_SMALL);
541 if((ctx = BN_CTX_new()) == NULL) goto err;
544 br = BN_CTX_get(ctx);
545 ret = BN_CTX_get(ctx);
546 num = BN_num_bytes(rsa->n);
547 buf = OPENSSL_malloc(num);
548 if(!f || !ret || !buf)
550 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT,ERR_R_MALLOC_FAILURE);
554 /* This check was for equality but PGP does evil things
555 * and chops off the top '0' bytes */
558 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT,RSA_R_DATA_GREATER_THAN_MOD_LEN);
562 /* make data into a big number */
563 if (BN_bin2bn(from,(int)flen,f) == NULL) goto err;
565 if (BN_ucmp(f, rsa->n) >= 0)
567 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT,RSA_R_DATA_TOO_LARGE_FOR_MODULUS);
571 if (!(rsa->flags & RSA_FLAG_NO_BLINDING))
573 blinding = rsa_get_blinding(rsa, &local_blinding, ctx);
574 if (blinding == NULL)
576 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT, ERR_R_INTERNAL_ERROR);
581 if (blinding != NULL)
582 if (!rsa_blinding_convert(blinding, local_blinding, f, br, ctx))
586 if ( (rsa->flags & RSA_FLAG_EXT_PKEY) ||
589 (rsa->dmp1 != NULL) &&
590 (rsa->dmq1 != NULL) &&
591 (rsa->iqmp != NULL)) )
593 if (!rsa->meth->rsa_mod_exp(ret, f, rsa, ctx)) goto err;
600 if (!(rsa->flags & RSA_FLAG_NO_CONSTTIME))
603 BN_with_flags(d, rsa->d, BN_FLG_CONSTTIME);
608 if (rsa->flags & RSA_FLAG_CACHE_PUBLIC)
609 if (!BN_MONT_CTX_set_locked(&rsa->_method_mod_n, CRYPTO_LOCK_RSA, rsa->n, ctx))
611 if (!rsa->meth->bn_mod_exp(ret,f,d,rsa->n,ctx,
617 if (!rsa_blinding_invert(blinding, local_blinding, ret, br, ctx))
621 j=BN_bn2bin(ret,p); /* j is only used with no-padding mode */
625 case RSA_PKCS1_PADDING:
626 r=RSA_padding_check_PKCS1_type_2(to,num,buf,j,num);
628 #ifndef OPENSSL_NO_SHA
629 case RSA_PKCS1_OAEP_PADDING:
630 r=RSA_padding_check_PKCS1_OAEP(to,num,buf,j,num,NULL,0);
633 case RSA_SSLV23_PADDING:
634 r=RSA_padding_check_SSLv23(to,num,buf,j,num);
637 r=RSA_padding_check_none(to,num,buf,j,num);
640 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT,RSA_R_UNKNOWN_PADDING_TYPE);
644 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT,RSA_R_PADDING_CHECK_FAILED);
654 OPENSSL_cleanse(buf,num);
660 /* signature verification */
661 static int RSA_eay_public_decrypt(int flen, const unsigned char *from,
662 unsigned char *to, RSA *rsa, int padding)
667 unsigned char *buf=NULL;
671 if(FIPS_selftest_failed())
673 FIPSerr(FIPS_F_RSA_EAY_PUBLIC_DECRYPT,FIPS_R_FIPS_SELFTEST_FAILED);
677 if (FIPS_mode() && !(rsa->flags & RSA_FLAG_NON_FIPS_ALLOW)
678 && (BN_num_bits(rsa->n) < OPENSSL_RSA_FIPS_MIN_MODULUS_BITS))
680 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT, RSA_R_KEY_SIZE_TOO_SMALL);
685 if (BN_num_bits(rsa->n) > OPENSSL_RSA_MAX_MODULUS_BITS)
687 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT, RSA_R_MODULUS_TOO_LARGE);
691 if (BN_ucmp(rsa->n, rsa->e) <= 0)
693 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT, RSA_R_BAD_E_VALUE);
697 /* for large moduli, enforce exponent limit */
698 if (BN_num_bits(rsa->n) > OPENSSL_RSA_SMALL_MODULUS_BITS)
700 if (BN_num_bits(rsa->e) > OPENSSL_RSA_MAX_PUBEXP_BITS)
702 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT, RSA_R_BAD_E_VALUE);
707 if((ctx = BN_CTX_new()) == NULL) goto err;
710 ret = BN_CTX_get(ctx);
711 num=BN_num_bytes(rsa->n);
712 buf = OPENSSL_malloc(num);
713 if(!f || !ret || !buf)
715 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT,ERR_R_MALLOC_FAILURE);
719 /* This check was for equality but PGP does evil things
720 * and chops off the top '0' bytes */
723 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT,RSA_R_DATA_GREATER_THAN_MOD_LEN);
727 if (BN_bin2bn(from,flen,f) == NULL) goto err;
729 if (BN_ucmp(f, rsa->n) >= 0)
731 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT,RSA_R_DATA_TOO_LARGE_FOR_MODULUS);
735 if (rsa->flags & RSA_FLAG_CACHE_PUBLIC)
736 if (!BN_MONT_CTX_set_locked(&rsa->_method_mod_n, CRYPTO_LOCK_RSA, rsa->n, ctx))
739 if (!rsa->meth->bn_mod_exp(ret,f,rsa->e,rsa->n,ctx,
740 rsa->_method_mod_n)) goto err;
742 if ((padding == RSA_X931_PADDING) && ((ret->d[0] & 0xf) != 12))
743 if (!BN_sub(ret, rsa->n, ret)) goto err;
750 case RSA_PKCS1_PADDING:
751 r=RSA_padding_check_PKCS1_type_1(to,num,buf,i,num);
753 case RSA_X931_PADDING:
754 r=RSA_padding_check_X931(to,num,buf,i,num);
757 r=RSA_padding_check_none(to,num,buf,i,num);
760 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT,RSA_R_UNKNOWN_PADDING_TYPE);
764 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT,RSA_R_PADDING_CHECK_FAILED);
774 OPENSSL_cleanse(buf,num);
780 static int RSA_eay_mod_exp(BIGNUM *r0, const BIGNUM *I, RSA *rsa, BN_CTX *ctx)
782 BIGNUM *r1,*m1,*vrfy;
783 BIGNUM local_dmp1,local_dmq1,local_c,local_r1;
784 BIGNUM *dmp1,*dmq1,*c,*pr1;
788 r1 = BN_CTX_get(ctx);
789 m1 = BN_CTX_get(ctx);
790 vrfy = BN_CTX_get(ctx);
793 BIGNUM local_p, local_q;
794 BIGNUM *p = NULL, *q = NULL;
796 /* Make sure BN_mod_inverse in Montgomery intialization uses the
797 * BN_FLG_CONSTTIME flag (unless RSA_FLAG_NO_CONSTTIME is set)
799 if (!(rsa->flags & RSA_FLAG_NO_CONSTTIME))
803 BN_with_flags(p, rsa->p, BN_FLG_CONSTTIME);
807 BN_with_flags(q, rsa->q, BN_FLG_CONSTTIME);
815 if (rsa->flags & RSA_FLAG_CACHE_PRIVATE)
817 if (!BN_MONT_CTX_set_locked(&rsa->_method_mod_p, CRYPTO_LOCK_RSA, p, ctx))
819 if (!BN_MONT_CTX_set_locked(&rsa->_method_mod_q, CRYPTO_LOCK_RSA, q, ctx))
824 if (rsa->flags & RSA_FLAG_CACHE_PUBLIC)
825 if (!BN_MONT_CTX_set_locked(&rsa->_method_mod_n, CRYPTO_LOCK_RSA, rsa->n, ctx))
828 /* compute I mod q */
829 if (!(rsa->flags & RSA_FLAG_NO_CONSTTIME))
832 BN_with_flags(c, I, BN_FLG_CONSTTIME);
833 if (!BN_mod(r1,c,rsa->q,ctx)) goto err;
837 if (!BN_mod(r1,I,rsa->q,ctx)) goto err;
840 /* compute r1^dmq1 mod q */
841 if (!(rsa->flags & RSA_FLAG_NO_CONSTTIME))
844 BN_with_flags(dmq1, rsa->dmq1, BN_FLG_CONSTTIME);
848 if (!rsa->meth->bn_mod_exp(m1,r1,dmq1,rsa->q,ctx,
849 rsa->_method_mod_q)) goto err;
851 /* compute I mod p */
852 if (!(rsa->flags & RSA_FLAG_NO_CONSTTIME))
855 BN_with_flags(c, I, BN_FLG_CONSTTIME);
856 if (!BN_mod(r1,c,rsa->p,ctx)) goto err;
860 if (!BN_mod(r1,I,rsa->p,ctx)) goto err;
863 /* compute r1^dmp1 mod p */
864 if (!(rsa->flags & RSA_FLAG_NO_CONSTTIME))
867 BN_with_flags(dmp1, rsa->dmp1, BN_FLG_CONSTTIME);
871 if (!rsa->meth->bn_mod_exp(r0,r1,dmp1,rsa->p,ctx,
872 rsa->_method_mod_p)) goto err;
874 if (!BN_sub(r0,r0,m1)) goto err;
875 /* This will help stop the size of r0 increasing, which does
876 * affect the multiply if it optimised for a power of 2 size */
877 if (BN_is_negative(r0))
878 if (!BN_add(r0,r0,rsa->p)) goto err;
880 if (!BN_mul(r1,r0,rsa->iqmp,ctx)) goto err;
882 /* Turn BN_FLG_CONSTTIME flag on before division operation */
883 if (!(rsa->flags & RSA_FLAG_NO_CONSTTIME))
886 BN_with_flags(pr1, r1, BN_FLG_CONSTTIME);
890 if (!BN_mod(r0,pr1,rsa->p,ctx)) goto err;
892 /* If p < q it is occasionally possible for the correction of
893 * adding 'p' if r0 is negative above to leave the result still
894 * negative. This can break the private key operations: the following
895 * second correction should *always* correct this rare occurrence.
896 * This will *never* happen with OpenSSL generated keys because
897 * they ensure p > q [steve]
899 if (BN_is_negative(r0))
900 if (!BN_add(r0,r0,rsa->p)) goto err;
901 if (!BN_mul(r1,r0,rsa->q,ctx)) goto err;
902 if (!BN_add(r0,r1,m1)) goto err;
904 if (rsa->e && rsa->n)
906 if (!rsa->meth->bn_mod_exp(vrfy,r0,rsa->e,rsa->n,ctx,rsa->_method_mod_n)) goto err;
907 /* If 'I' was greater than (or equal to) rsa->n, the operation
908 * will be equivalent to using 'I mod n'. However, the result of
909 * the verify will *always* be less than 'n' so we don't check
910 * for absolute equality, just congruency. */
911 if (!BN_sub(vrfy, vrfy, I)) goto err;
912 if (!BN_mod(vrfy, vrfy, rsa->n, ctx)) goto err;
913 if (BN_is_negative(vrfy))
914 if (!BN_add(vrfy, vrfy, rsa->n)) goto err;
915 if (!BN_is_zero(vrfy))
917 /* 'I' and 'vrfy' aren't congruent mod n. Don't leak
918 * miscalculated CRT output, just do a raw (slower)
919 * mod_exp and return that instead. */
924 if (!(rsa->flags & RSA_FLAG_NO_CONSTTIME))
927 BN_with_flags(d, rsa->d, BN_FLG_CONSTTIME);
931 if (!rsa->meth->bn_mod_exp(r0,I,d,rsa->n,ctx,
932 rsa->_method_mod_n)) goto err;
941 static int RSA_eay_init(RSA *rsa)
944 if(FIPS_selftest_failed())
946 FIPSerr(FIPS_F_RSA_EAY_INIT,FIPS_R_FIPS_SELFTEST_FAILED);
950 rsa->flags|=RSA_FLAG_CACHE_PUBLIC|RSA_FLAG_CACHE_PRIVATE;
954 static int RSA_eay_finish(RSA *rsa)
956 if (rsa->_method_mod_n != NULL)
957 BN_MONT_CTX_free(rsa->_method_mod_n);
958 if (rsa->_method_mod_p != NULL)
959 BN_MONT_CTX_free(rsa->_method_mod_p);
960 if (rsa->_method_mod_q != NULL)
961 BN_MONT_CTX_free(rsa->_method_mod_q);