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.]
66 static int RSA_eay_public_encrypt(int flen, unsigned char *from,
67 unsigned char *to, RSA *rsa,int padding);
68 static int RSA_eay_private_encrypt(int flen, unsigned char *from,
69 unsigned char *to, RSA *rsa,int padding);
70 static int RSA_eay_public_decrypt(int flen, unsigned char *from,
71 unsigned char *to, RSA *rsa,int padding);
72 static int RSA_eay_private_decrypt(int flen, unsigned char *from,
73 unsigned char *to, RSA *rsa,int padding);
74 static int RSA_eay_mod_exp(BIGNUM *r0, BIGNUM *i, RSA *rsa);
75 static int RSA_eay_init(RSA *rsa);
76 static int RSA_eay_finish(RSA *rsa);
78 static int RSA_eay_public_encrypt();
79 static int RSA_eay_private_encrypt();
80 static int RSA_eay_public_decrypt();
81 static int RSA_eay_private_decrypt();
82 static int RSA_eay_mod_exp();
83 static int RSA_eay_init();
84 static int RSA_eay_finish();
87 static RSA_METHOD rsa_pkcs1_eay_meth={
88 "Eric Young's PKCS#1 RSA",
89 RSA_eay_public_encrypt,
90 RSA_eay_public_decrypt,
91 RSA_eay_private_encrypt,
92 RSA_eay_private_decrypt,
101 RSA_METHOD *RSA_PKCS1_SSLeay()
103 return(&rsa_pkcs1_eay_meth);
106 static int RSA_eay_public_encrypt(flen, from, to, rsa, padding)
114 int i,j,k,num=0,r= -1;
115 unsigned char *buf=NULL;
120 if ((ctx=BN_CTX_new()) == NULL) goto err;
121 num=BN_num_bytes(rsa->n);
122 if ((buf=(unsigned char *)Malloc(num)) == NULL)
124 RSAerr(RSA_F_RSA_EAY_PUBLIC_ENCRYPT,ERR_R_MALLOC_FAILURE);
130 case RSA_PKCS1_PADDING:
131 i=RSA_padding_add_PKCS1_type_2(buf,num,from,flen);
133 case RSA_PKCS1_OAEP_PADDING:
134 i=RSA_padding_add_PKCS1_OAEP(buf,num,from,flen,NULL,0);
136 case RSA_SSLV23_PADDING:
137 i=RSA_padding_add_SSLv23(buf,num,from,flen);
140 i=RSA_padding_add_none(buf,num,from,flen);
143 RSAerr(RSA_F_RSA_EAY_PUBLIC_ENCRYPT,RSA_R_UNKNOWN_PADDING_TYPE);
146 if (i <= 0) goto err;
148 if (BN_bin2bn(buf,num,&f) == NULL) goto err;
150 if ((rsa->_method_mod_n == NULL) && (rsa->flags & RSA_FLAG_CACHE_PUBLIC))
152 if ((rsa->_method_mod_n=BN_MONT_CTX_new()) != NULL)
153 if (!BN_MONT_CTX_set(rsa->_method_mod_n,rsa->n,ctx))
157 if (!rsa->meth->bn_mod_exp(&ret,&f,rsa->e,rsa->n,ctx,
158 rsa->_method_mod_n)) goto err;
160 /* put in leading 0 bytes if the number is less than the
161 * length of the modulus */
162 j=BN_num_bytes(&ret);
163 i=BN_bn2bin(&ret,&(to[num-j]));
164 for (k=0; k<(num-i); k++)
169 if (ctx != NULL) BN_CTX_free(ctx);
180 static int RSA_eay_private_encrypt(flen, from, to, rsa, padding)
188 int i,j,k,num=0,r= -1;
189 unsigned char *buf=NULL;
195 if ((ctx=BN_CTX_new()) == NULL) goto err;
196 num=BN_num_bytes(rsa->n);
197 if ((buf=(unsigned char *)Malloc(num)) == NULL)
199 RSAerr(RSA_F_RSA_EAY_PRIVATE_ENCRYPT,ERR_R_MALLOC_FAILURE);
205 case RSA_PKCS1_PADDING:
206 i=RSA_padding_add_PKCS1_type_1(buf,num,from,flen);
209 i=RSA_padding_add_none(buf,num,from,flen);
211 case RSA_SSLV23_PADDING:
213 RSAerr(RSA_F_RSA_EAY_PRIVATE_ENCRYPT,RSA_R_UNKNOWN_PADDING_TYPE);
216 if (i <= 0) goto err;
218 if (BN_bin2bn(buf,num,&f) == NULL) goto err;
220 if ((rsa->flags & RSA_FLAG_BLINDING) && (rsa->blinding == NULL))
221 RSA_blinding_on(rsa,ctx);
222 if (rsa->flags & RSA_FLAG_BLINDING)
223 if (!BN_BLINDING_convert(&f,rsa->blinding,ctx)) goto err;
225 if ( (rsa->p != NULL) &&
227 (rsa->dmp1 != NULL) &&
228 (rsa->dmq1 != NULL) &&
230 { if (!rsa->meth->rsa_mod_exp(&ret,&f,rsa)) goto err; }
233 if (!rsa->meth->bn_mod_exp(&ret,&f,rsa->d,rsa->n,ctx,NULL)) goto err;
236 if (rsa->flags & RSA_FLAG_BLINDING)
237 if (!BN_BLINDING_invert(&ret,rsa->blinding,ctx)) goto err;
239 /* put in leading 0 bytes if the number is less than the
240 * length of the modulus */
241 j=BN_num_bytes(&ret);
242 i=BN_bn2bin(&ret,&(to[num-j]));
243 for (k=0; k<(num-i); k++)
248 if (ctx != NULL) BN_CTX_free(ctx);
259 static int RSA_eay_private_decrypt(flen, from, to, rsa,padding)
269 unsigned char *buf=NULL;
275 if (ctx == NULL) goto err;
277 num=BN_num_bytes(rsa->n);
279 if ((buf=(unsigned char *)Malloc(num)) == NULL)
281 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT,ERR_R_MALLOC_FAILURE);
285 /* This check was for equallity but PGP does evil things
286 * and chops off the top '0' bytes */
289 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT,RSA_R_DATA_GREATER_THAN_MOD_LEN);
293 /* make data into a big number */
294 if (BN_bin2bn(from,(int)flen,&f) == NULL) goto err;
296 if ((rsa->flags & RSA_FLAG_BLINDING) && (rsa->blinding == NULL))
297 RSA_blinding_on(rsa,ctx);
298 if (rsa->flags & RSA_FLAG_BLINDING)
299 if (!BN_BLINDING_convert(&f,rsa->blinding,ctx)) goto err;
302 if ( (rsa->p != NULL) &&
304 (rsa->dmp1 != NULL) &&
305 (rsa->dmq1 != 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);
325 case RSA_PKCS1_OAEP_PADDING:
326 r=RSA_padding_check_PKCS1_OAEP(to,num,buf,j,num,NULL,0);
328 case RSA_SSLV23_PADDING:
329 r=RSA_padding_check_SSLv23(to,num,buf,j,num);
332 r=RSA_padding_check_none(to,num,buf,j,num);
335 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT,RSA_R_UNKNOWN_PADDING_TYPE);
339 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT,RSA_R_PADDING_CHECK_FAILED);
342 if (ctx != NULL) BN_CTX_free(ctx);
353 static int RSA_eay_public_decrypt(flen, from, to, rsa, padding)
363 unsigned char *buf=NULL;
369 if (ctx == NULL) goto err;
371 num=BN_num_bytes(rsa->n);
372 buf=(unsigned char *)Malloc(num);
375 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT,ERR_R_MALLOC_FAILURE);
379 /* This check was for equallity but PGP does evil things
380 * and chops off the top '0' bytes */
383 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT,RSA_R_DATA_GREATER_THAN_MOD_LEN);
387 if (BN_bin2bn(from,flen,&f) == NULL) goto err;
389 if ((rsa->_method_mod_n == NULL) && (rsa->flags & RSA_FLAG_CACHE_PUBLIC))
391 if ((rsa->_method_mod_n=BN_MONT_CTX_new()) != NULL)
392 if (!BN_MONT_CTX_set(rsa->_method_mod_n,rsa->n,ctx))
396 if (!rsa->meth->bn_mod_exp(&ret,&f,rsa->e,rsa->n,ctx,
397 rsa->_method_mod_n)) goto err;
404 case RSA_PKCS1_PADDING:
405 r=RSA_padding_check_PKCS1_type_1(to,num,buf,i,num);
408 r=RSA_padding_check_none(to,num,buf,i,num);
411 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT,RSA_R_UNKNOWN_PADDING_TYPE);
415 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT,RSA_R_PADDING_CHECK_FAILED);
418 if (ctx != NULL) BN_CTX_free(ctx);
429 static int RSA_eay_mod_exp(r0, I, rsa)
438 if ((ctx=BN_CTX_new()) == NULL) goto err;
442 if (rsa->flags & RSA_FLAG_CACHE_PRIVATE)
444 if (rsa->_method_mod_p == NULL)
446 if ((rsa->_method_mod_p=BN_MONT_CTX_new()) != NULL)
447 if (!BN_MONT_CTX_set(rsa->_method_mod_p,rsa->p,
451 if (rsa->_method_mod_q == NULL)
453 if ((rsa->_method_mod_q=BN_MONT_CTX_new()) != NULL)
454 if (!BN_MONT_CTX_set(rsa->_method_mod_q,rsa->q,
460 if (!BN_mod(&r1,I,rsa->q,ctx)) goto err;
461 if (!rsa->meth->bn_mod_exp(&m1,&r1,rsa->dmq1,rsa->q,ctx,
462 rsa->_method_mod_q)) goto err;
464 if (!BN_mod(&r1,I,rsa->p,ctx)) goto err;
465 if (!rsa->meth->bn_mod_exp(r0,&r1,rsa->dmp1,rsa->p,ctx,
466 rsa->_method_mod_p)) goto err;
468 if (!BN_sub(r0,r0,&m1)) goto err;
469 /* This will help stop the size of r0 increasing, which does
470 * affect the multiply if it optimised for a power of 2 size */
472 if (!BN_add(r0,r0,rsa->p)) goto err;
474 if (!BN_mul(&r1,r0,rsa->iqmp,ctx)) goto err;
475 if (!BN_mod(r0,&r1,rsa->p,ctx)) goto err;
476 /* If p < q it is occasionally possible for the correction of
477 * adding 'p' if r0 is negative above to leave the result still
478 * negative. This can break the private key operations: the following
479 * second correction should *always* correct this rare occurrence.
480 * This will *never* happen with OpenSSL generated keys because
481 * they ensure p > q [steve]
484 if (!BN_add(r0,r0,rsa->p)) goto err;
485 if (!BN_mul(&r1,r0,rsa->q,ctx)) goto err;
486 if (!BN_add(r0,&r1,&m1)) goto err;
496 static int RSA_eay_init(rsa)
499 rsa->flags|=RSA_FLAG_CACHE_PUBLIC|RSA_FLAG_CACHE_PRIVATE;
503 static int RSA_eay_finish(rsa)
506 if (rsa->_method_mod_n != NULL)
507 BN_MONT_CTX_free(rsa->_method_mod_n);
508 if (rsa->_method_mod_p != NULL)
509 BN_MONT_CTX_free(rsa->_method_mod_p);
510 if (rsa->_method_mod_q != NULL)
511 BN_MONT_CTX_free(rsa->_method_mod_q);