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>
65 static int RSA_eay_public_encrypt(int flen, unsigned char *from,
66 unsigned char *to, RSA *rsa,int padding);
67 static int RSA_eay_private_encrypt(int flen, unsigned char *from,
68 unsigned char *to, RSA *rsa,int padding);
69 static int RSA_eay_public_decrypt(int flen, unsigned char *from,
70 unsigned char *to, RSA *rsa,int padding);
71 static int RSA_eay_private_decrypt(int flen, unsigned char *from,
72 unsigned char *to, RSA *rsa,int padding);
73 static int RSA_eay_mod_exp(BIGNUM *r0, BIGNUM *i, RSA *rsa);
74 static int RSA_eay_init(RSA *rsa);
75 static int RSA_eay_finish(RSA *rsa);
76 static RSA_METHOD rsa_pkcs1_eay_meth={
77 "Eric Young's PKCS#1 RSA",
78 RSA_eay_public_encrypt,
79 RSA_eay_public_decrypt,
80 RSA_eay_private_encrypt,
81 RSA_eay_private_decrypt,
90 RSA_METHOD *RSA_PKCS1_SSLeay(void)
92 return(&rsa_pkcs1_eay_meth);
95 static int RSA_eay_public_encrypt(int flen, unsigned char *from,
96 unsigned char *to, RSA *rsa, int padding)
99 int i,j,k,num=0,r= -1;
100 unsigned char *buf=NULL;
105 if ((ctx=BN_CTX_new()) == NULL) goto err;
106 num=BN_num_bytes(rsa->n);
107 if ((buf=(unsigned char *)Malloc(num)) == NULL)
109 RSAerr(RSA_F_RSA_EAY_PUBLIC_ENCRYPT,ERR_R_MALLOC_FAILURE);
115 case RSA_PKCS1_PADDING:
116 i=RSA_padding_add_PKCS1_type_2(buf,num,from,flen);
119 case RSA_PKCS1_OAEP_PADDING:
120 i=RSA_padding_add_PKCS1_OAEP(buf,num,from,flen,NULL,0);
123 case RSA_SSLV23_PADDING:
124 i=RSA_padding_add_SSLv23(buf,num,from,flen);
127 i=RSA_padding_add_none(buf,num,from,flen);
130 RSAerr(RSA_F_RSA_EAY_PUBLIC_ENCRYPT,RSA_R_UNKNOWN_PADDING_TYPE);
133 if (i <= 0) goto err;
135 if (BN_bin2bn(buf,num,&f) == NULL) goto err;
137 if ((rsa->_method_mod_n == NULL) && (rsa->flags & RSA_FLAG_CACHE_PUBLIC))
139 if ((rsa->_method_mod_n=BN_MONT_CTX_new()) != NULL)
140 if (!BN_MONT_CTX_set(rsa->_method_mod_n,rsa->n,ctx))
144 if (!rsa->meth->bn_mod_exp(&ret,&f,rsa->e,rsa->n,ctx,
145 rsa->_method_mod_n)) goto err;
147 /* put in leading 0 bytes if the number is less than the
148 * length of the modulus */
149 j=BN_num_bytes(&ret);
150 i=BN_bn2bin(&ret,&(to[num-j]));
151 for (k=0; k<(num-i); k++)
156 if (ctx != NULL) BN_CTX_free(ctx);
167 static int RSA_eay_private_encrypt(int flen, unsigned char *from,
168 unsigned char *to, RSA *rsa, int padding)
171 int i,j,k,num=0,r= -1;
172 unsigned char *buf=NULL;
178 if ((ctx=BN_CTX_new()) == NULL) goto err;
179 num=BN_num_bytes(rsa->n);
180 if ((buf=(unsigned char *)Malloc(num)) == NULL)
182 RSAerr(RSA_F_RSA_EAY_PRIVATE_ENCRYPT,ERR_R_MALLOC_FAILURE);
188 case RSA_PKCS1_PADDING:
189 i=RSA_padding_add_PKCS1_type_1(buf,num,from,flen);
192 i=RSA_padding_add_none(buf,num,from,flen);
194 case RSA_SSLV23_PADDING:
196 RSAerr(RSA_F_RSA_EAY_PRIVATE_ENCRYPT,RSA_R_UNKNOWN_PADDING_TYPE);
199 if (i <= 0) goto err;
201 if (BN_bin2bn(buf,num,&f) == NULL) goto err;
203 if ((rsa->flags & RSA_FLAG_BLINDING) && (rsa->blinding == NULL))
204 RSA_blinding_on(rsa,ctx);
205 if (rsa->flags & RSA_FLAG_BLINDING)
206 if (!BN_BLINDING_convert(&f,rsa->blinding,ctx)) goto err;
208 if ( (rsa->flags & RSA_FLAG_EXT_PKEY) ||
211 (rsa->dmp1 != NULL) &&
212 (rsa->dmq1 != NULL) &&
213 (rsa->iqmp != NULL)) )
214 { if (!rsa->meth->rsa_mod_exp(&ret,&f,rsa)) goto err; }
217 if (!rsa->meth->bn_mod_exp(&ret,&f,rsa->d,rsa->n,ctx,NULL)) goto err;
220 if (rsa->flags & RSA_FLAG_BLINDING)
221 if (!BN_BLINDING_invert(&ret,rsa->blinding,ctx)) goto err;
223 /* put in leading 0 bytes if the number is less than the
224 * length of the modulus */
225 j=BN_num_bytes(&ret);
226 i=BN_bn2bin(&ret,&(to[num-j]));
227 for (k=0; k<(num-i); k++)
232 if (ctx != NULL) BN_CTX_free(ctx);
243 static int RSA_eay_private_decrypt(int flen, unsigned char *from,
244 unsigned char *to, RSA *rsa, int padding)
249 unsigned char *buf=NULL;
255 if (ctx == NULL) goto err;
257 num=BN_num_bytes(rsa->n);
259 if ((buf=(unsigned char *)Malloc(num)) == NULL)
261 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT,ERR_R_MALLOC_FAILURE);
265 /* This check was for equallity but PGP does evil things
266 * and chops off the top '0' bytes */
269 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT,RSA_R_DATA_GREATER_THAN_MOD_LEN);
273 /* make data into a big number */
274 if (BN_bin2bn(from,(int)flen,&f) == NULL) goto err;
276 if ((rsa->flags & RSA_FLAG_BLINDING) && (rsa->blinding == NULL))
277 RSA_blinding_on(rsa,ctx);
278 if (rsa->flags & RSA_FLAG_BLINDING)
279 if (!BN_BLINDING_convert(&f,rsa->blinding,ctx)) goto err;
282 if ( (rsa->flags & RSA_FLAG_EXT_PKEY) ||
285 (rsa->dmp1 != NULL) &&
286 (rsa->dmq1 != NULL) &&
287 (rsa->iqmp != NULL)) )
288 { if (!rsa->meth->rsa_mod_exp(&ret,&f,rsa)) goto err; }
291 if (!rsa->meth->bn_mod_exp(&ret,&f,rsa->d,rsa->n,ctx,NULL))
295 if (rsa->flags & RSA_FLAG_BLINDING)
296 if (!BN_BLINDING_invert(&ret,rsa->blinding,ctx)) goto err;
299 j=BN_bn2bin(&ret,p); /* j is only used with no-padding mode */
303 case RSA_PKCS1_PADDING:
304 r=RSA_padding_check_PKCS1_type_2(to,num,buf,j,num);
307 case RSA_PKCS1_OAEP_PADDING:
308 r=RSA_padding_check_PKCS1_OAEP(to,num,buf,j,num,NULL,0);
311 case RSA_SSLV23_PADDING:
312 r=RSA_padding_check_SSLv23(to,num,buf,j,num);
315 r=RSA_padding_check_none(to,num,buf,j,num);
318 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT,RSA_R_UNKNOWN_PADDING_TYPE);
322 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT,RSA_R_PADDING_CHECK_FAILED);
325 if (ctx != NULL) BN_CTX_free(ctx);
336 static int RSA_eay_public_decrypt(int flen, unsigned char *from,
337 unsigned char *to, RSA *rsa, int padding)
342 unsigned char *buf=NULL;
348 if (ctx == NULL) goto err;
350 num=BN_num_bytes(rsa->n);
351 buf=(unsigned char *)Malloc(num);
354 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT,ERR_R_MALLOC_FAILURE);
358 /* This check was for equallity but PGP does evil things
359 * and chops off the top '0' bytes */
362 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT,RSA_R_DATA_GREATER_THAN_MOD_LEN);
366 if (BN_bin2bn(from,flen,&f) == NULL) goto err;
368 if ((rsa->_method_mod_n == NULL) && (rsa->flags & RSA_FLAG_CACHE_PUBLIC))
370 if ((rsa->_method_mod_n=BN_MONT_CTX_new()) != NULL)
371 if (!BN_MONT_CTX_set(rsa->_method_mod_n,rsa->n,ctx))
375 if (!rsa->meth->bn_mod_exp(&ret,&f,rsa->e,rsa->n,ctx,
376 rsa->_method_mod_n)) goto err;
383 case RSA_PKCS1_PADDING:
384 r=RSA_padding_check_PKCS1_type_1(to,num,buf,i,num);
387 r=RSA_padding_check_none(to,num,buf,i,num);
390 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT,RSA_R_UNKNOWN_PADDING_TYPE);
394 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT,RSA_R_PADDING_CHECK_FAILED);
397 if (ctx != NULL) BN_CTX_free(ctx);
408 static int RSA_eay_mod_exp(BIGNUM *r0, BIGNUM *I, RSA *rsa)
414 if ((ctx=BN_CTX_new()) == NULL) goto err;
418 if (rsa->flags & RSA_FLAG_CACHE_PRIVATE)
420 if (rsa->_method_mod_p == NULL)
422 if ((rsa->_method_mod_p=BN_MONT_CTX_new()) != NULL)
423 if (!BN_MONT_CTX_set(rsa->_method_mod_p,rsa->p,
427 if (rsa->_method_mod_q == NULL)
429 if ((rsa->_method_mod_q=BN_MONT_CTX_new()) != NULL)
430 if (!BN_MONT_CTX_set(rsa->_method_mod_q,rsa->q,
436 if (!BN_mod(&r1,I,rsa->q,ctx)) goto err;
437 if (!rsa->meth->bn_mod_exp(&m1,&r1,rsa->dmq1,rsa->q,ctx,
438 rsa->_method_mod_q)) goto err;
440 if (!BN_mod(&r1,I,rsa->p,ctx)) goto err;
441 if (!rsa->meth->bn_mod_exp(r0,&r1,rsa->dmp1,rsa->p,ctx,
442 rsa->_method_mod_p)) goto err;
444 if (!BN_sub(r0,r0,&m1)) goto err;
445 /* This will help stop the size of r0 increasing, which does
446 * affect the multiply if it optimised for a power of 2 size */
448 if (!BN_add(r0,r0,rsa->p)) goto err;
450 if (!BN_mul(&r1,r0,rsa->iqmp,ctx)) goto err;
451 if (!BN_mod(r0,&r1,rsa->p,ctx)) goto err;
452 /* If p < q it is occasionally possible for the correction of
453 * adding 'p' if r0 is negative above to leave the result still
454 * negative. This can break the private key operations: the following
455 * second correction should *always* correct this rare occurrence.
456 * This will *never* happen with OpenSSL generated keys because
457 * they ensure p > q [steve]
460 if (!BN_add(r0,r0,rsa->p)) goto err;
461 if (!BN_mul(&r1,r0,rsa->q,ctx)) goto err;
462 if (!BN_add(r0,&r1,&m1)) goto err;
472 static int RSA_eay_init(RSA *rsa)
474 rsa->flags|=RSA_FLAG_CACHE_PUBLIC|RSA_FLAG_CACHE_PRIVATE;
478 static int RSA_eay_finish(RSA *rsa)
480 if (rsa->_method_mod_n != NULL)
481 BN_MONT_CTX_free(rsa->_method_mod_n);
482 if (rsa->_method_mod_p != NULL)
483 BN_MONT_CTX_free(rsa->_method_mod_p);
484 if (rsa->_method_mod_q != NULL)
485 BN_MONT_CTX_free(rsa->_method_mod_q);