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>
67 static int RSA_eay_public_encrypt(int flen
, unsigned char *from
,
68 unsigned char *to
, RSA
*rsa
,int padding
);
69 static int RSA_eay_private_encrypt(int flen
, unsigned char *from
,
70 unsigned char *to
, RSA
*rsa
,int padding
);
71 static int RSA_eay_public_decrypt(int flen
, unsigned char *from
,
72 unsigned char *to
, RSA
*rsa
,int padding
);
73 static int RSA_eay_private_decrypt(int flen
, unsigned char *from
,
74 unsigned char *to
, RSA
*rsa
,int padding
);
75 static int RSA_eay_mod_exp(BIGNUM
*r0
, BIGNUM
*i
, RSA
*rsa
);
76 static int RSA_eay_init(RSA
*rsa
);
77 static int RSA_eay_finish(RSA
*rsa
);
78 static RSA_METHOD rsa_pkcs1_eay_meth
={
79 "Eric Young's PKCS#1 RSA",
80 RSA_eay_public_encrypt
,
81 RSA_eay_public_decrypt
,
82 RSA_eay_private_encrypt
,
83 RSA_eay_private_decrypt
,
92 RSA_METHOD
*RSA_PKCS1_SSLeay(void)
94 return(&rsa_pkcs1_eay_meth
);
97 static int RSA_eay_public_encrypt(int flen
, unsigned char *from
,
98 unsigned char *to
, RSA
*rsa
, int padding
)
101 int i
,j
,k
,num
=0,r
= -1;
102 unsigned char *buf
=NULL
;
107 if ((ctx
=BN_CTX_new()) == NULL
) goto err
;
108 num
=BN_num_bytes(rsa
->n
);
109 if ((buf
=(unsigned char *)Malloc(num
)) == NULL
)
111 RSAerr(RSA_F_RSA_EAY_PUBLIC_ENCRYPT
,ERR_R_MALLOC_FAILURE
);
117 case RSA_PKCS1_PADDING
:
118 i
=RSA_padding_add_PKCS1_type_2(buf
,num
,from
,flen
);
121 case RSA_PKCS1_OAEP_PADDING
:
122 i
=RSA_padding_add_PKCS1_OAEP(buf
,num
,from
,flen
,NULL
,0);
125 case RSA_SSLV23_PADDING
:
126 i
=RSA_padding_add_SSLv23(buf
,num
,from
,flen
);
129 i
=RSA_padding_add_none(buf
,num
,from
,flen
);
132 RSAerr(RSA_F_RSA_EAY_PUBLIC_ENCRYPT
,RSA_R_UNKNOWN_PADDING_TYPE
);
135 if (i
<= 0) goto err
;
137 if (BN_bin2bn(buf
,num
,&f
) == NULL
) goto err
;
139 if ((rsa
->_method_mod_n
== NULL
) && (rsa
->flags
& RSA_FLAG_CACHE_PUBLIC
))
141 if ((rsa
->_method_mod_n
=BN_MONT_CTX_new()) != NULL
)
142 if (!BN_MONT_CTX_set(rsa
->_method_mod_n
,rsa
->n
,ctx
))
146 if (!rsa
->meth
->bn_mod_exp(&ret
,&f
,rsa
->e
,rsa
->n
,ctx
,
147 rsa
->_method_mod_n
)) goto err
;
149 /* put in leading 0 bytes if the number is less than the
150 * length of the modulus */
151 j
=BN_num_bytes(&ret
);
152 i
=BN_bn2bin(&ret
,&(to
[num
-j
]));
153 for (k
=0; k
<(num
-i
); k
++)
158 if (ctx
!= NULL
) BN_CTX_free(ctx
);
169 static int RSA_eay_private_encrypt(int flen
, unsigned char *from
,
170 unsigned char *to
, RSA
*rsa
, int padding
)
173 int i
,j
,k
,num
=0,r
= -1;
174 unsigned char *buf
=NULL
;
180 if ((ctx
=BN_CTX_new()) == NULL
) goto err
;
181 num
=BN_num_bytes(rsa
->n
);
182 if ((buf
=(unsigned char *)Malloc(num
)) == NULL
)
184 RSAerr(RSA_F_RSA_EAY_PRIVATE_ENCRYPT
,ERR_R_MALLOC_FAILURE
);
190 case RSA_PKCS1_PADDING
:
191 i
=RSA_padding_add_PKCS1_type_1(buf
,num
,from
,flen
);
194 i
=RSA_padding_add_none(buf
,num
,from
,flen
);
196 case RSA_SSLV23_PADDING
:
198 RSAerr(RSA_F_RSA_EAY_PRIVATE_ENCRYPT
,RSA_R_UNKNOWN_PADDING_TYPE
);
201 if (i
<= 0) goto err
;
203 if (BN_bin2bn(buf
,num
,&f
) == NULL
) goto err
;
205 if ((rsa
->flags
& RSA_FLAG_BLINDING
) && (rsa
->blinding
== NULL
))
206 RSA_blinding_on(rsa
,ctx
);
207 if (rsa
->flags
& RSA_FLAG_BLINDING
)
208 if (!BN_BLINDING_convert(&f
,rsa
->blinding
,ctx
)) goto err
;
210 if ( (rsa
->flags
& RSA_FLAG_EXT_PKEY
) ||
213 (rsa
->dmp1
!= NULL
) &&
214 (rsa
->dmq1
!= NULL
) &&
215 (rsa
->iqmp
!= NULL
)) )
216 { if (!rsa
->meth
->rsa_mod_exp(&ret
,&f
,rsa
)) goto err
; }
219 if (!rsa
->meth
->bn_mod_exp(&ret
,&f
,rsa
->d
,rsa
->n
,ctx
,NULL
)) goto err
;
222 if (rsa
->flags
& RSA_FLAG_BLINDING
)
223 if (!BN_BLINDING_invert(&ret
,rsa
->blinding
,ctx
)) goto err
;
225 /* put in leading 0 bytes if the number is less than the
226 * length of the modulus */
227 j
=BN_num_bytes(&ret
);
228 i
=BN_bn2bin(&ret
,&(to
[num
-j
]));
229 for (k
=0; k
<(num
-i
); k
++)
234 if (ctx
!= NULL
) BN_CTX_free(ctx
);
245 static int RSA_eay_private_decrypt(int flen
, unsigned char *from
,
246 unsigned char *to
, RSA
*rsa
, int padding
)
251 unsigned char *buf
=NULL
;
257 if (ctx
== NULL
) goto err
;
259 num
=BN_num_bytes(rsa
->n
);
261 if ((buf
=(unsigned char *)Malloc(num
)) == NULL
)
263 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT
,ERR_R_MALLOC_FAILURE
);
267 /* This check was for equality but PGP does evil things
268 * and chops off the top '0' bytes */
271 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT
,RSA_R_DATA_GREATER_THAN_MOD_LEN
);
275 /* make data into a big number */
276 if (BN_bin2bn(from
,(int)flen
,&f
) == NULL
) goto err
;
278 if ((rsa
->flags
& RSA_FLAG_BLINDING
) && (rsa
->blinding
== NULL
))
279 RSA_blinding_on(rsa
,ctx
);
280 if (rsa
->flags
& RSA_FLAG_BLINDING
)
281 if (!BN_BLINDING_convert(&f
,rsa
->blinding
,ctx
)) goto err
;
284 if ( (rsa
->flags
& RSA_FLAG_EXT_PKEY
) ||
287 (rsa
->dmp1
!= NULL
) &&
288 (rsa
->dmq1
!= NULL
) &&
289 (rsa
->iqmp
!= NULL
)) )
290 { if (!rsa
->meth
->rsa_mod_exp(&ret
,&f
,rsa
)) goto err
; }
293 if (!rsa
->meth
->bn_mod_exp(&ret
,&f
,rsa
->d
,rsa
->n
,ctx
,NULL
))
297 if (rsa
->flags
& RSA_FLAG_BLINDING
)
298 if (!BN_BLINDING_invert(&ret
,rsa
->blinding
,ctx
)) goto err
;
301 j
=BN_bn2bin(&ret
,p
); /* j is only used with no-padding mode */
305 case RSA_PKCS1_PADDING
:
306 r
=RSA_padding_check_PKCS1_type_2(to
,num
,buf
,j
,num
);
309 case RSA_PKCS1_OAEP_PADDING
:
310 r
=RSA_padding_check_PKCS1_OAEP(to
,num
,buf
,j
,num
,NULL
,0);
313 case RSA_SSLV23_PADDING
:
314 r
=RSA_padding_check_SSLv23(to
,num
,buf
,j
,num
);
317 r
=RSA_padding_check_none(to
,num
,buf
,j
,num
);
320 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT
,RSA_R_UNKNOWN_PADDING_TYPE
);
324 RSAerr(RSA_F_RSA_EAY_PRIVATE_DECRYPT
,RSA_R_PADDING_CHECK_FAILED
);
327 if (ctx
!= NULL
) BN_CTX_free(ctx
);
338 static int RSA_eay_public_decrypt(int flen
, unsigned char *from
,
339 unsigned char *to
, RSA
*rsa
, int padding
)
344 unsigned char *buf
=NULL
;
350 if (ctx
== NULL
) goto err
;
352 num
=BN_num_bytes(rsa
->n
);
353 buf
=(unsigned char *)Malloc(num
);
356 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT
,ERR_R_MALLOC_FAILURE
);
360 /* This check was for equality but PGP does evil things
361 * and chops off the top '0' bytes */
364 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT
,RSA_R_DATA_GREATER_THAN_MOD_LEN
);
368 if (BN_bin2bn(from
,flen
,&f
) == NULL
) goto err
;
370 if ((rsa
->_method_mod_n
== NULL
) && (rsa
->flags
& RSA_FLAG_CACHE_PUBLIC
))
372 if ((rsa
->_method_mod_n
=BN_MONT_CTX_new()) != NULL
)
373 if (!BN_MONT_CTX_set(rsa
->_method_mod_n
,rsa
->n
,ctx
))
377 if (!rsa
->meth
->bn_mod_exp(&ret
,&f
,rsa
->e
,rsa
->n
,ctx
,
378 rsa
->_method_mod_n
)) goto err
;
385 case RSA_PKCS1_PADDING
:
386 r
=RSA_padding_check_PKCS1_type_1(to
,num
,buf
,i
,num
);
389 r
=RSA_padding_check_none(to
,num
,buf
,i
,num
);
392 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT
,RSA_R_UNKNOWN_PADDING_TYPE
);
396 RSAerr(RSA_F_RSA_EAY_PUBLIC_DECRYPT
,RSA_R_PADDING_CHECK_FAILED
);
399 if (ctx
!= NULL
) BN_CTX_free(ctx
);
410 static int RSA_eay_mod_exp(BIGNUM
*r0
, BIGNUM
*I
, RSA
*rsa
)
416 if ((ctx
=BN_CTX_new()) == NULL
) goto err
;
420 if (rsa
->flags
& RSA_FLAG_CACHE_PRIVATE
)
422 if (rsa
->_method_mod_p
== NULL
)
424 if ((rsa
->_method_mod_p
=BN_MONT_CTX_new()) != NULL
)
425 if (!BN_MONT_CTX_set(rsa
->_method_mod_p
,rsa
->p
,
429 if (rsa
->_method_mod_q
== NULL
)
431 if ((rsa
->_method_mod_q
=BN_MONT_CTX_new()) != NULL
)
432 if (!BN_MONT_CTX_set(rsa
->_method_mod_q
,rsa
->q
,
438 if (!BN_mod(&r1
,I
,rsa
->q
,ctx
)) goto err
;
439 if (!rsa
->meth
->bn_mod_exp(&m1
,&r1
,rsa
->dmq1
,rsa
->q
,ctx
,
440 rsa
->_method_mod_q
)) goto err
;
442 if (!BN_mod(&r1
,I
,rsa
->p
,ctx
)) goto err
;
443 if (!rsa
->meth
->bn_mod_exp(r0
,&r1
,rsa
->dmp1
,rsa
->p
,ctx
,
444 rsa
->_method_mod_p
)) goto err
;
446 if (!BN_sub(r0
,r0
,&m1
)) goto err
;
447 /* This will help stop the size of r0 increasing, which does
448 * affect the multiply if it optimised for a power of 2 size */
450 if (!BN_add(r0
,r0
,rsa
->p
)) goto err
;
452 if (!BN_mul(&r1
,r0
,rsa
->iqmp
,ctx
)) goto err
;
453 if (!BN_mod(r0
,&r1
,rsa
->p
,ctx
)) goto err
;
454 /* If p < q it is occasionally possible for the correction of
455 * adding 'p' if r0 is negative above to leave the result still
456 * negative. This can break the private key operations: the following
457 * second correction should *always* correct this rare occurrence.
458 * This will *never* happen with OpenSSL generated keys because
459 * they ensure p > q [steve]
462 if (!BN_add(r0
,r0
,rsa
->p
)) goto err
;
463 if (!BN_mul(&r1
,r0
,rsa
->q
,ctx
)) goto err
;
464 if (!BN_add(r0
,&r1
,&m1
)) goto err
;
474 static int RSA_eay_init(RSA
*rsa
)
476 rsa
->flags
|=RSA_FLAG_CACHE_PUBLIC
|RSA_FLAG_CACHE_PRIVATE
;
480 static int RSA_eay_finish(RSA
*rsa
)
482 if (rsa
->_method_mod_n
!= NULL
)
483 BN_MONT_CTX_free(rsa
->_method_mod_n
);
484 if (rsa
->_method_mod_p
!= NULL
)
485 BN_MONT_CTX_free(rsa
->_method_mod_p
);
486 if (rsa
->_method_mod_q
!= NULL
)
487 BN_MONT_CTX_free(rsa
->_method_mod_q
);