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>
64 #include <openssl/engine.h>
68 static int RSA_eay_public_encrypt(int flen
, const unsigned char *from
,
69 unsigned char *to
, RSA
*rsa
,int padding
);
70 static int RSA_eay_private_encrypt(int flen
, const unsigned char *from
,
71 unsigned char *to
, RSA
*rsa
,int padding
);
72 static int RSA_eay_public_decrypt(int flen
, const unsigned char *from
,
73 unsigned char *to
, RSA
*rsa
,int padding
);
74 static int RSA_eay_private_decrypt(int flen
, const unsigned char *from
,
75 unsigned char *to
, RSA
*rsa
,int padding
);
76 static int RSA_eay_mod_exp(BIGNUM
*r0
, const BIGNUM
*i
, RSA
*rsa
);
77 static int RSA_eay_init(RSA
*rsa
);
78 static int RSA_eay_finish(RSA
*rsa
);
79 static RSA_METHOD rsa_pkcs1_eay_meth
={
80 "Eric Young's PKCS#1 RSA",
81 RSA_eay_public_encrypt
,
82 RSA_eay_public_decrypt
,
83 RSA_eay_private_encrypt
,
84 RSA_eay_private_decrypt
,
86 BN_mod_exp_mont
, /* XXX probably we should not use Montgomery if e == 3 */
93 const RSA_METHOD
*RSA_PKCS1_SSLeay(void)
95 return(&rsa_pkcs1_eay_meth
);
98 static int RSA_eay_public_encrypt(int flen
, const unsigned char *from
,
99 unsigned char *to
, RSA
*rsa
, int padding
)
101 const RSA_METHOD
*meth
;
103 int i
,j
,k
,num
=0,r
= -1;
104 unsigned char *buf
=NULL
;
107 meth
= ENGINE_get_RSA(rsa
->engine
);
110 if ((ctx
=BN_CTX_new()) == NULL
) goto err
;
111 num
=BN_num_bytes(rsa
->n
);
112 if ((buf
=(unsigned char *)OPENSSL_malloc(num
)) == NULL
)
114 RSAerr(RSA_F_RSA_EAY_PUBLIC_ENCRYPT
,ERR_R_MALLOC_FAILURE
);
120 case RSA_PKCS1_PADDING
:
121 i
=RSA_padding_add_PKCS1_type_2(buf
,num
,from
,flen
);
123 #ifndef OPENSSL_NO_SHA
124 case RSA_PKCS1_OAEP_PADDING
:
125 i
=RSA_padding_add_PKCS1_OAEP(buf
,num
,from
,flen
,NULL
,0);
128 case RSA_SSLV23_PADDING
:
129 i
=RSA_padding_add_SSLv23(buf
,num
,from
,flen
);
132 i
=RSA_padding_add_none(buf
,num
,from
,flen
);
135 RSAerr(RSA_F_RSA_EAY_PUBLIC_ENCRYPT
,RSA_R_UNKNOWN_PADDING_TYPE
);
138 if (i
<= 0) goto err
;
140 if (BN_bin2bn(buf
,num
,&f
) == NULL
) goto err
;
142 if ((rsa
->_method_mod_n
== NULL
) && (rsa
->flags
& RSA_FLAG_CACHE_PUBLIC
))
144 BN_MONT_CTX
* bn_mont_ctx
;
145 if ((bn_mont_ctx
=BN_MONT_CTX_new()) == NULL
)
147 if (!BN_MONT_CTX_set(bn_mont_ctx
,rsa
->n
,ctx
))
149 BN_MONT_CTX_free(bn_mont_ctx
);
152 if (rsa
->_method_mod_n
== NULL
) /* other thread may have finished first */
154 CRYPTO_w_lock(CRYPTO_LOCK_RSA
);
155 if (rsa
->_method_mod_n
== NULL
)
157 rsa
->_method_mod_n
= bn_mont_ctx
;
160 CRYPTO_w_unlock(CRYPTO_LOCK_RSA
);
163 BN_MONT_CTX_free(bn_mont_ctx
);
166 if (!meth
->bn_mod_exp(&ret
,&f
,rsa
->e
,rsa
->n
,ctx
,
167 rsa
->_method_mod_n
)) goto err
;
169 /* put in leading 0 bytes if the number is less than the
170 * length of the modulus */
171 j
=BN_num_bytes(&ret
);
172 i
=BN_bn2bin(&ret
,&(to
[num
-j
]));
173 for (k
=0; k
<(num
-i
); k
++)
178 if (ctx
!= NULL
) BN_CTX_free(ctx
);
189 static int RSA_eay_private_encrypt(int flen
, const unsigned char *from
,
190 unsigned char *to
, RSA
*rsa
, int padding
)
192 const RSA_METHOD
*meth
;
194 int i
,j
,k
,num
=0,r
= -1;
195 unsigned char *buf
=NULL
;
198 meth
= ENGINE_get_RSA(rsa
->engine
);
202 if ((ctx
=BN_CTX_new()) == NULL
) goto err
;
203 num
=BN_num_bytes(rsa
->n
);
204 if ((buf
=(unsigned char *)OPENSSL_malloc(num
)) == NULL
)
206 RSAerr(RSA_F_RSA_EAY_PRIVATE_ENCRYPT
,ERR_R_MALLOC_FAILURE
);
212 case RSA_PKCS1_PADDING
:
213 i
=RSA_padding_add_PKCS1_type_1(buf
,num
,from
,flen
);
216 i
=RSA_padding_add_none(buf
,num
,from
,flen
);
218 case RSA_SSLV23_PADDING
:
220 RSAerr(RSA_F_RSA_EAY_PRIVATE_ENCRYPT
,RSA_R_UNKNOWN_PADDING_TYPE
);
223 if (i
<= 0) goto err
;
225 if (BN_bin2bn(buf
,num
,&f
) == NULL
) goto err
;
227 if ((rsa
->flags
& RSA_FLAG_BLINDING
) && (rsa
->blinding
== NULL
))
228 RSA_blinding_on(rsa
,ctx
);
229 if (rsa
->flags
& RSA_FLAG_BLINDING
)
230 if (!BN_BLINDING_convert(&f
,rsa
->blinding
,ctx
)) goto err
;
232 if ( (rsa
->flags
& RSA_FLAG_EXT_PKEY
) ||
235 (rsa
->dmp1
!= NULL
) &&
236 (rsa
->dmq1
!= NULL
) &&
237 (rsa
->iqmp
!= NULL
)) )
238 { if (!meth
->rsa_mod_exp(&ret
,&f
,rsa
)) goto err
; }
241 if (!meth
->bn_mod_exp(&ret
,&f
,rsa
->d
,rsa
->n
,ctx
,NULL
)) goto err
;
244 if (rsa
->flags
& RSA_FLAG_BLINDING
)
245 if (!BN_BLINDING_invert(&ret
,rsa
->blinding
,ctx
)) goto err
;
247 /* put in leading 0 bytes if the number is less than the
248 * length of the modulus */
249 j
=BN_num_bytes(&ret
);
250 i
=BN_bn2bin(&ret
,&(to
[num
-j
]));
251 for (k
=0; k
<(num
-i
); k
++)
256 if (ctx
!= NULL
) BN_CTX_free(ctx
);
267 static int RSA_eay_private_decrypt(int flen
, const unsigned char *from
,
268 unsigned char *to
, RSA
*rsa
, int padding
)
270 const RSA_METHOD
*meth
;
274 unsigned char *buf
=NULL
;
277 meth
= ENGINE_get_RSA(rsa
->engine
);
281 if (ctx
== NULL
) goto err
;
283 num
=BN_num_bytes(rsa
->n
);
285 if ((buf
=(unsigned char *)OPENSSL_malloc(num
)) == NULL
)
287 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT
,ERR_R_MALLOC_FAILURE
);
291 /* This check was for equality but PGP does evil things
292 * and chops off the top '0' bytes */
295 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT
,RSA_R_DATA_GREATER_THAN_MOD_LEN
);
299 /* make data into a big number */
300 if (BN_bin2bn(from
,(int)flen
,&f
) == NULL
) goto err
;
302 if ((rsa
->flags
& RSA_FLAG_BLINDING
) && (rsa
->blinding
== NULL
))
303 RSA_blinding_on(rsa
,ctx
);
304 if (rsa
->flags
& RSA_FLAG_BLINDING
)
305 if (!BN_BLINDING_convert(&f
,rsa
->blinding
,ctx
)) goto err
;
308 if ( (rsa
->flags
& RSA_FLAG_EXT_PKEY
) ||
311 (rsa
->dmp1
!= NULL
) &&
312 (rsa
->dmq1
!= NULL
) &&
313 (rsa
->iqmp
!= NULL
)) )
314 { if (!meth
->rsa_mod_exp(&ret
,&f
,rsa
)) goto err
; }
317 if (!meth
->bn_mod_exp(&ret
,&f
,rsa
->d
,rsa
->n
,ctx
,NULL
))
321 if (rsa
->flags
& RSA_FLAG_BLINDING
)
322 if (!BN_BLINDING_invert(&ret
,rsa
->blinding
,ctx
)) goto err
;
325 j
=BN_bn2bin(&ret
,p
); /* j is only used with no-padding mode */
329 case RSA_PKCS1_PADDING
:
330 r
=RSA_padding_check_PKCS1_type_2(to
,num
,buf
,j
,num
);
332 #ifndef OPENSSL_NO_SHA
333 case RSA_PKCS1_OAEP_PADDING
:
334 r
=RSA_padding_check_PKCS1_OAEP(to
,num
,buf
,j
,num
,NULL
,0);
337 case RSA_SSLV23_PADDING
:
338 r
=RSA_padding_check_SSLv23(to
,num
,buf
,j
,num
);
341 r
=RSA_padding_check_none(to
,num
,buf
,j
,num
);
344 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT
,RSA_R_UNKNOWN_PADDING_TYPE
);
348 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT
,RSA_R_PADDING_CHECK_FAILED
);
351 if (ctx
!= NULL
) BN_CTX_free(ctx
);
362 static int RSA_eay_public_decrypt(int flen
, const unsigned char *from
,
363 unsigned char *to
, RSA
*rsa
, int padding
)
365 const RSA_METHOD
*meth
;
369 unsigned char *buf
=NULL
;
372 meth
= ENGINE_get_RSA(rsa
->engine
);
376 if (ctx
== NULL
) goto err
;
378 num
=BN_num_bytes(rsa
->n
);
379 buf
=(unsigned char *)OPENSSL_malloc(num
);
382 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT
,ERR_R_MALLOC_FAILURE
);
386 /* This check was for equality but PGP does evil things
387 * and chops off the top '0' bytes */
390 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT
,RSA_R_DATA_GREATER_THAN_MOD_LEN
);
394 if (BN_bin2bn(from
,flen
,&f
) == NULL
) goto err
;
396 if ((rsa
->_method_mod_n
== NULL
) && (rsa
->flags
& RSA_FLAG_CACHE_PUBLIC
))
398 BN_MONT_CTX
* bn_mont_ctx
;
399 if ((bn_mont_ctx
=BN_MONT_CTX_new()) == NULL
)
401 if (!BN_MONT_CTX_set(bn_mont_ctx
,rsa
->n
,ctx
))
403 BN_MONT_CTX_free(bn_mont_ctx
);
406 if (rsa
->_method_mod_n
== NULL
) /* other thread may have finished first */
408 CRYPTO_w_lock(CRYPTO_LOCK_RSA
);
409 if (rsa
->_method_mod_n
== NULL
)
411 rsa
->_method_mod_n
= bn_mont_ctx
;
414 CRYPTO_w_unlock(CRYPTO_LOCK_RSA
);
417 BN_MONT_CTX_free(bn_mont_ctx
);
420 if (!meth
->bn_mod_exp(&ret
,&f
,rsa
->e
,rsa
->n
,ctx
,
421 rsa
->_method_mod_n
)) goto err
;
428 case RSA_PKCS1_PADDING
:
429 r
=RSA_padding_check_PKCS1_type_1(to
,num
,buf
,i
,num
);
432 r
=RSA_padding_check_none(to
,num
,buf
,i
,num
);
435 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT
,RSA_R_UNKNOWN_PADDING_TYPE
);
439 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT
,RSA_R_PADDING_CHECK_FAILED
);
442 if (ctx
!= NULL
) BN_CTX_free(ctx
);
453 static int RSA_eay_mod_exp(BIGNUM
*r0
, const BIGNUM
*I
, RSA
*rsa
)
455 const RSA_METHOD
*meth
;
460 meth
= ENGINE_get_RSA(rsa
->engine
);
461 if ((ctx
=BN_CTX_new()) == NULL
) goto err
;
466 if (rsa
->flags
& RSA_FLAG_CACHE_PRIVATE
)
468 if (rsa
->_method_mod_p
== NULL
)
470 BN_MONT_CTX
* bn_mont_ctx
;
471 if ((bn_mont_ctx
=BN_MONT_CTX_new()) == NULL
)
473 if (!BN_MONT_CTX_set(bn_mont_ctx
,rsa
->p
,ctx
))
475 BN_MONT_CTX_free(bn_mont_ctx
);
478 if (rsa
->_method_mod_p
== NULL
) /* other thread may have finished first */
480 CRYPTO_w_lock(CRYPTO_LOCK_RSA
);
481 if (rsa
->_method_mod_p
== NULL
)
483 rsa
->_method_mod_p
= bn_mont_ctx
;
486 CRYPTO_w_unlock(CRYPTO_LOCK_RSA
);
489 BN_MONT_CTX_free(bn_mont_ctx
);
492 if (rsa
->_method_mod_q
== NULL
)
494 BN_MONT_CTX
* bn_mont_ctx
;
495 if ((bn_mont_ctx
=BN_MONT_CTX_new()) == NULL
)
497 if (!BN_MONT_CTX_set(bn_mont_ctx
,rsa
->q
,ctx
))
499 BN_MONT_CTX_free(bn_mont_ctx
);
502 if (rsa
->_method_mod_q
== NULL
) /* other thread may have finished first */
504 CRYPTO_w_lock(CRYPTO_LOCK_RSA
);
505 if (rsa
->_method_mod_q
== NULL
)
507 rsa
->_method_mod_q
= bn_mont_ctx
;
510 CRYPTO_w_unlock(CRYPTO_LOCK_RSA
);
513 BN_MONT_CTX_free(bn_mont_ctx
);
517 if (!BN_mod(&r1
,I
,rsa
->q
,ctx
)) goto err
;
518 if (!meth
->bn_mod_exp(&m1
,&r1
,rsa
->dmq1
,rsa
->q
,ctx
,
519 rsa
->_method_mod_q
)) goto err
;
521 if (!BN_mod(&r1
,I
,rsa
->p
,ctx
)) goto err
;
522 if (!meth
->bn_mod_exp(r0
,&r1
,rsa
->dmp1
,rsa
->p
,ctx
,
523 rsa
->_method_mod_p
)) goto err
;
525 if (!BN_sub(r0
,r0
,&m1
)) goto err
;
526 /* This will help stop the size of r0 increasing, which does
527 * affect the multiply if it optimised for a power of 2 size */
529 if (!BN_add(r0
,r0
,rsa
->p
)) goto err
;
531 if (!BN_mul(&r1
,r0
,rsa
->iqmp
,ctx
)) goto err
;
532 if (!BN_mod(r0
,&r1
,rsa
->p
,ctx
)) goto err
;
533 /* If p < q it is occasionally possible for the correction of
534 * adding 'p' if r0 is negative above to leave the result still
535 * negative. This can break the private key operations: the following
536 * second correction should *always* correct this rare occurrence.
537 * This will *never* happen with OpenSSL generated keys because
538 * they ensure p > q [steve]
541 if (!BN_add(r0
,r0
,rsa
->p
)) goto err
;
542 if (!BN_mul(&r1
,r0
,rsa
->q
,ctx
)) goto err
;
543 if (!BN_add(r0
,&r1
,&m1
)) goto err
;
545 if (rsa
->e
&& rsa
->n
)
547 if (!rsa
->meth
->bn_mod_exp(&vrfy
,r0
,rsa
->e
,rsa
->n
,ctx
,NULL
)) goto err
;
548 if (BN_cmp(I
, &vrfy
) != 0)
550 if (!rsa
->meth
->bn_mod_exp(r0
,I
,rsa
->d
,rsa
->n
,ctx
,NULL
)) goto err
;
557 BN_clear_free(&vrfy
);
562 static int RSA_eay_init(RSA
*rsa
)
564 rsa
->flags
|=RSA_FLAG_CACHE_PUBLIC
|RSA_FLAG_CACHE_PRIVATE
;
568 static int RSA_eay_finish(RSA
*rsa
)
570 if (rsa
->_method_mod_n
!= NULL
)
571 BN_MONT_CTX_free(rsa
->_method_mod_n
);
572 if (rsa
->_method_mod_p
!= NULL
)
573 BN_MONT_CTX_free(rsa
->_method_mod_p
);
574 if (rsa
->_method_mod_q
!= NULL
)
575 BN_MONT_CTX_free(rsa
->_method_mod_q
);