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-2005 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).
113 #include "cryptlib.h"
114 #include <openssl/bn.h>
115 #include <openssl/rsa.h>
116 #include <openssl/rand.h>
120 static int RSA_eay_public_encrypt(int flen, const unsigned char *from,
121 unsigned char *to, RSA *rsa,int padding);
122 static int RSA_eay_private_encrypt(int flen, const unsigned char *from,
123 unsigned char *to, RSA *rsa,int padding);
124 static int RSA_eay_public_decrypt(int flen, const unsigned char *from,
125 unsigned char *to, RSA *rsa,int padding);
126 static int RSA_eay_private_decrypt(int flen, const unsigned char *from,
127 unsigned char *to, RSA *rsa,int padding);
128 static int RSA_eay_mod_exp(BIGNUM *r0, const BIGNUM *i, RSA *rsa, BN_CTX *ctx);
129 static int RSA_eay_init(RSA *rsa);
130 static int RSA_eay_finish(RSA *rsa);
131 static RSA_METHOD rsa_pkcs1_eay_meth={
132 "Eric Young's PKCS#1 RSA",
133 RSA_eay_public_encrypt,
134 RSA_eay_public_decrypt, /* signature verification */
135 RSA_eay_private_encrypt, /* signing */
136 RSA_eay_private_decrypt,
138 BN_mod_exp_mont, /* XXX probably we should not use Montgomery if e == 3 */
145 NULL /* rsa_keygen */
148 const RSA_METHOD *RSA_PKCS1_SSLeay(void)
150 return(&rsa_pkcs1_eay_meth);
154 * MONT_HELPER(rsa, bn_ctx, p, rsa->flags & RSA_FLAG_CACHE_PRIVATE, goto err);
156 #define MONT_HELPER(rsa, ctx, m, pre_cond, err_instr) \
157 if((pre_cond) && ((rsa)->_method_mod_##m == NULL) && \
158 !BN_MONT_CTX_set_locked(&((rsa)->_method_mod_##m), \
163 static int RSA_eay_public_encrypt(int flen, const unsigned char *from,
164 unsigned char *to, RSA *rsa, int padding)
167 int i,j,k,num=0,r= -1;
168 unsigned char *buf=NULL;
171 if ((ctx=BN_CTX_new()) == NULL) goto err;
174 ret = BN_CTX_get(ctx);
175 num=BN_num_bytes(rsa->n);
176 buf = OPENSSL_malloc(num);
177 if (!f || !ret || !buf)
179 RSAerr(RSA_F_RSA_EAY_PUBLIC_ENCRYPT,ERR_R_MALLOC_FAILURE);
185 case RSA_PKCS1_PADDING:
186 i=RSA_padding_add_PKCS1_type_2(buf,num,from,flen);
188 #ifndef OPENSSL_NO_SHA
189 case RSA_PKCS1_OAEP_PADDING:
190 i=RSA_padding_add_PKCS1_OAEP(buf,num,from,flen,NULL,0);
193 case RSA_SSLV23_PADDING:
194 i=RSA_padding_add_SSLv23(buf,num,from,flen);
197 i=RSA_padding_add_none(buf,num,from,flen);
200 RSAerr(RSA_F_RSA_EAY_PUBLIC_ENCRYPT,RSA_R_UNKNOWN_PADDING_TYPE);
203 if (i <= 0) goto err;
205 if (BN_bin2bn(buf,num,f) == NULL) goto err;
207 if (BN_ucmp(f, rsa->n) >= 0)
209 /* usually the padding functions would catch this */
210 RSAerr(RSA_F_RSA_EAY_PUBLIC_ENCRYPT,RSA_R_DATA_TOO_LARGE_FOR_MODULUS);
214 MONT_HELPER(rsa, ctx, n, rsa->flags & RSA_FLAG_CACHE_PUBLIC, goto err);
216 if (!rsa->meth->bn_mod_exp(ret,f,rsa->e,rsa->n,ctx,
217 rsa->_method_mod_n)) goto err;
219 /* put in leading 0 bytes if the number is less than the
220 * length of the modulus */
222 i=BN_bn2bin(ret,&(to[num-j]));
223 for (k=0; k<(num-i); k++)
235 OPENSSL_cleanse(buf,num);
241 static BN_BLINDING *rsa_get_blinding(RSA *rsa, BIGNUM **r, int *local, BN_CTX *ctx)
245 if (rsa->blinding == NULL)
247 if (rsa->blinding == NULL)
249 CRYPTO_w_lock(CRYPTO_LOCK_RSA);
250 if (rsa->blinding == NULL)
251 rsa->blinding = RSA_setup_blinding(rsa, ctx);
252 CRYPTO_w_unlock(CRYPTO_LOCK_RSA);
260 if (BN_BLINDING_get_thread_id(ret) != CRYPTO_thread_id())
263 if (rsa->mt_blinding == NULL)
265 CRYPTO_w_lock(CRYPTO_LOCK_RSA);
266 if (rsa->mt_blinding == NULL)
267 rsa->mt_blinding = RSA_setup_blinding(rsa, ctx);
268 CRYPTO_w_unlock(CRYPTO_LOCK_RSA);
270 ret = rsa->mt_blinding;
278 static int rsa_blinding_convert(BN_BLINDING *b, int local, BIGNUM *f,
279 BIGNUM *r, BN_CTX *ctx)
282 return BN_BLINDING_convert_ex(f, NULL, b, ctx);
286 CRYPTO_w_lock(CRYPTO_LOCK_RSA_BLINDING);
287 ret = BN_BLINDING_convert_ex(f, r, b, ctx);
288 CRYPTO_w_unlock(CRYPTO_LOCK_RSA_BLINDING);
293 static int rsa_blinding_invert(BN_BLINDING *b, int local, BIGNUM *f,
294 BIGNUM *r, BN_CTX *ctx)
297 return BN_BLINDING_invert_ex(f, NULL, b, ctx);
301 CRYPTO_r_lock(CRYPTO_LOCK_RSA_BLINDING);
302 ret = BN_BLINDING_invert_ex(f, r, b, ctx);
303 CRYPTO_r_unlock(CRYPTO_LOCK_RSA_BLINDING);
309 static int RSA_eay_private_encrypt(int flen, const unsigned char *from,
310 unsigned char *to, RSA *rsa, int padding)
312 BIGNUM *f, *ret, *br;
313 int i,j,k,num=0,r= -1;
314 unsigned char *buf=NULL;
316 int local_blinding = 0;
317 BN_BLINDING *blinding = NULL;
319 if ((ctx=BN_CTX_new()) == NULL) goto err;
322 br = BN_CTX_get(ctx);
323 ret = BN_CTX_get(ctx);
324 num = BN_num_bytes(rsa->n);
325 buf = OPENSSL_malloc(num);
326 if(!f || !ret || !buf)
328 RSAerr(RSA_F_RSA_EAY_PRIVATE_ENCRYPT,ERR_R_MALLOC_FAILURE);
334 case RSA_PKCS1_PADDING:
335 i=RSA_padding_add_PKCS1_type_1(buf,num,from,flen);
338 i=RSA_padding_add_none(buf,num,from,flen);
340 case RSA_SSLV23_PADDING:
342 RSAerr(RSA_F_RSA_EAY_PRIVATE_ENCRYPT,RSA_R_UNKNOWN_PADDING_TYPE);
345 if (i <= 0) goto err;
347 if (BN_bin2bn(buf,num,f) == NULL) goto err;
349 if (BN_ucmp(f, rsa->n) >= 0)
351 /* usually the padding functions would catch this */
352 RSAerr(RSA_F_RSA_EAY_PRIVATE_ENCRYPT,RSA_R_DATA_TOO_LARGE_FOR_MODULUS);
356 if (!(rsa->flags & RSA_FLAG_NO_BLINDING))
358 blinding = rsa_get_blinding(rsa, &br, &local_blinding, ctx);
359 if (blinding == NULL)
361 RSAerr(RSA_F_RSA_EAY_PRIVATE_ENCRYPT, ERR_R_INTERNAL_ERROR);
366 if (blinding != NULL)
367 if (!rsa_blinding_convert(blinding, local_blinding, f, br, ctx))
370 if ( (rsa->flags & RSA_FLAG_EXT_PKEY) ||
373 (rsa->dmp1 != NULL) &&
374 (rsa->dmq1 != NULL) &&
375 (rsa->iqmp != NULL)) )
377 if (!rsa->meth->rsa_mod_exp(ret, f, rsa, ctx)) goto err;
384 if (!(rsa->flags & RSA_FLAG_NO_EXP_CONSTTIME))
387 BN_with_flags(d, rsa->d, BN_FLG_EXP_CONSTTIME);
392 MONT_HELPER(rsa, ctx, n, rsa->flags & RSA_FLAG_CACHE_PUBLIC, goto err);
394 if (!rsa->meth->bn_mod_exp(ret,f,d,rsa->n,ctx,
395 rsa->_method_mod_n)) goto err;
399 if (!rsa_blinding_invert(blinding, local_blinding, ret, br, ctx))
402 /* put in leading 0 bytes if the number is less than the
403 * length of the modulus */
405 i=BN_bn2bin(ret,&(to[num-j]));
406 for (k=0; k<(num-i); k++)
418 OPENSSL_cleanse(buf,num);
424 static int RSA_eay_private_decrypt(int flen, const unsigned char *from,
425 unsigned char *to, RSA *rsa, int padding)
427 BIGNUM *f, *ret, *br;
430 unsigned char *buf=NULL;
432 int local_blinding = 0;
433 BN_BLINDING *blinding = NULL;
435 if((ctx = BN_CTX_new()) == NULL) goto err;
438 br = BN_CTX_get(ctx);
439 ret = BN_CTX_get(ctx);
440 num = BN_num_bytes(rsa->n);
441 buf = OPENSSL_malloc(num);
442 if(!f || !ret || !buf)
444 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT,ERR_R_MALLOC_FAILURE);
448 /* This check was for equality but PGP does evil things
449 * and chops off the top '0' bytes */
452 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT,RSA_R_DATA_GREATER_THAN_MOD_LEN);
456 /* make data into a big number */
457 if (BN_bin2bn(from,(int)flen,f) == NULL) goto err;
459 if (BN_ucmp(f, rsa->n) >= 0)
461 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT,RSA_R_DATA_TOO_LARGE_FOR_MODULUS);
465 if (!(rsa->flags & RSA_FLAG_NO_BLINDING))
467 blinding = rsa_get_blinding(rsa, &br, &local_blinding, ctx);
468 if (blinding == NULL)
470 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT, ERR_R_INTERNAL_ERROR);
475 if (blinding != NULL)
476 if (!rsa_blinding_convert(blinding, local_blinding, f, br, ctx))
480 if ( (rsa->flags & RSA_FLAG_EXT_PKEY) ||
483 (rsa->dmp1 != NULL) &&
484 (rsa->dmq1 != NULL) &&
485 (rsa->iqmp != NULL)) )
487 if (!rsa->meth->rsa_mod_exp(ret, f, rsa, ctx)) goto err;
494 if (!(rsa->flags & RSA_FLAG_NO_EXP_CONSTTIME))
497 BN_with_flags(d, rsa->d, BN_FLG_EXP_CONSTTIME);
502 MONT_HELPER(rsa, ctx, n, rsa->flags & RSA_FLAG_CACHE_PUBLIC, goto err);
503 if (!rsa->meth->bn_mod_exp(ret,f,d,rsa->n,ctx,
509 if (!rsa_blinding_invert(blinding, local_blinding, ret, br, ctx))
513 j=BN_bn2bin(ret,p); /* j is only used with no-padding mode */
517 case RSA_PKCS1_PADDING:
518 r=RSA_padding_check_PKCS1_type_2(to,num,buf,j,num);
520 #ifndef OPENSSL_NO_SHA
521 case RSA_PKCS1_OAEP_PADDING:
522 r=RSA_padding_check_PKCS1_OAEP(to,num,buf,j,num,NULL,0);
525 case RSA_SSLV23_PADDING:
526 r=RSA_padding_check_SSLv23(to,num,buf,j,num);
529 r=RSA_padding_check_none(to,num,buf,j,num);
532 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT,RSA_R_UNKNOWN_PADDING_TYPE);
536 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT,RSA_R_PADDING_CHECK_FAILED);
546 OPENSSL_cleanse(buf,num);
552 /* signature verification */
553 static int RSA_eay_public_decrypt(int flen, const unsigned char *from,
554 unsigned char *to, RSA *rsa, int padding)
559 unsigned char *buf=NULL;
562 if((ctx = BN_CTX_new()) == NULL) goto err;
565 ret = BN_CTX_get(ctx);
566 num=BN_num_bytes(rsa->n);
567 buf = OPENSSL_malloc(num);
568 if(!f || !ret || !buf)
570 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT,ERR_R_MALLOC_FAILURE);
574 /* This check was for equality but PGP does evil things
575 * and chops off the top '0' bytes */
578 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT,RSA_R_DATA_GREATER_THAN_MOD_LEN);
582 if (BN_bin2bn(from,flen,f) == NULL) goto err;
584 if (BN_ucmp(f, rsa->n) >= 0)
586 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT,RSA_R_DATA_TOO_LARGE_FOR_MODULUS);
590 MONT_HELPER(rsa, ctx, n, rsa->flags & RSA_FLAG_CACHE_PUBLIC, goto err);
592 if (!rsa->meth->bn_mod_exp(ret,f,rsa->e,rsa->n,ctx,
593 rsa->_method_mod_n)) goto err;
600 case RSA_PKCS1_PADDING:
601 r=RSA_padding_check_PKCS1_type_1(to,num,buf,i,num);
604 r=RSA_padding_check_none(to,num,buf,i,num);
607 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT,RSA_R_UNKNOWN_PADDING_TYPE);
611 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT,RSA_R_PADDING_CHECK_FAILED);
621 OPENSSL_cleanse(buf,num);
627 static int RSA_eay_mod_exp(BIGNUM *r0, const BIGNUM *I, RSA *rsa, BN_CTX *ctx)
629 BIGNUM *r1,*m1,*vrfy;
630 BIGNUM local_dmp1, local_dmq1;
635 r1 = BN_CTX_get(ctx);
636 m1 = BN_CTX_get(ctx);
637 vrfy = BN_CTX_get(ctx);
639 MONT_HELPER(rsa, ctx, p, rsa->flags & RSA_FLAG_CACHE_PRIVATE, goto err);
640 MONT_HELPER(rsa, ctx, q, rsa->flags & RSA_FLAG_CACHE_PRIVATE, goto err);
641 MONT_HELPER(rsa, ctx, n, rsa->flags & RSA_FLAG_CACHE_PUBLIC, goto err);
643 if (!BN_mod(r1,I,rsa->q,ctx)) goto err;
644 if (!(rsa->flags & RSA_FLAG_NO_EXP_CONSTTIME))
647 BN_with_flags(dmq1, rsa->dmq1, BN_FLG_EXP_CONSTTIME);
651 if (!rsa->meth->bn_mod_exp(m1,r1,dmq1,rsa->q,ctx,
652 rsa->_method_mod_q)) goto err;
654 if (!BN_mod(r1,I,rsa->p,ctx)) goto err;
655 if (!(rsa->flags & RSA_FLAG_NO_EXP_CONSTTIME))
658 BN_with_flags(dmp1, rsa->dmp1, BN_FLG_EXP_CONSTTIME);
662 if (!rsa->meth->bn_mod_exp(r0,r1,dmp1,rsa->p,ctx,
663 rsa->_method_mod_p)) goto err;
665 if (!BN_sub(r0,r0,m1)) goto err;
666 /* This will help stop the size of r0 increasing, which does
667 * affect the multiply if it optimised for a power of 2 size */
668 if (BN_is_negative(r0))
669 if (!BN_add(r0,r0,rsa->p)) goto err;
671 if (!BN_mul(r1,r0,rsa->iqmp,ctx)) goto err;
672 if (!BN_mod(r0,r1,rsa->p,ctx)) goto err;
673 /* If p < q it is occasionally possible for the correction of
674 * adding 'p' if r0 is negative above to leave the result still
675 * negative. This can break the private key operations: the following
676 * second correction should *always* correct this rare occurrence.
677 * This will *never* happen with OpenSSL generated keys because
678 * they ensure p > q [steve]
680 if (BN_is_negative(r0))
681 if (!BN_add(r0,r0,rsa->p)) goto err;
682 if (!BN_mul(r1,r0,rsa->q,ctx)) goto err;
683 if (!BN_add(r0,r1,m1)) goto err;
685 if (rsa->e && rsa->n)
687 if (!rsa->meth->bn_mod_exp(vrfy,r0,rsa->e,rsa->n,ctx,rsa->_method_mod_n)) goto err;
688 /* If 'I' was greater than (or equal to) rsa->n, the operation
689 * will be equivalent to using 'I mod n'. However, the result of
690 * the verify will *always* be less than 'n' so we don't check
691 * for absolute equality, just congruency. */
692 if (!BN_sub(vrfy, vrfy, I)) goto err;
693 if (!BN_mod(vrfy, vrfy, rsa->n, ctx)) goto err;
694 if (BN_is_negative(vrfy))
695 if (!BN_add(vrfy, vrfy, rsa->n)) goto err;
696 if (!BN_is_zero(vrfy))
698 /* 'I' and 'vrfy' aren't congruent mod n. Don't leak
699 * miscalculated CRT output, just do a raw (slower)
700 * mod_exp and return that instead. */
705 if (!(rsa->flags & RSA_FLAG_NO_EXP_CONSTTIME))
708 BN_with_flags(d, rsa->d, BN_FLG_EXP_CONSTTIME);
712 if (!rsa->meth->bn_mod_exp(r0,I,d,rsa->n,ctx,
713 rsa->_method_mod_n)) goto err;
722 static int RSA_eay_init(RSA *rsa)
724 rsa->flags|=RSA_FLAG_CACHE_PUBLIC|RSA_FLAG_CACHE_PRIVATE;
728 static int RSA_eay_finish(RSA *rsa)
730 if (rsa->_method_mod_n != NULL)
731 BN_MONT_CTX_free(rsa->_method_mod_n);
732 if (rsa->_method_mod_p != NULL)
733 BN_MONT_CTX_free(rsa->_method_mod_p);
734 if (rsa->_method_mod_q != NULL)
735 BN_MONT_CTX_free(rsa->_method_mod_q);