summaryrefslogtreecommitdiff
path: root/src/lib/libcrypto/rsa/rsa_lib.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/lib/libcrypto/rsa/rsa_lib.c')
-rw-r--r--src/lib/libcrypto/rsa/rsa_lib.c333
1 files changed, 0 insertions, 333 deletions
diff --git a/src/lib/libcrypto/rsa/rsa_lib.c b/src/lib/libcrypto/rsa/rsa_lib.c
deleted file mode 100644
index 074a4f5074..0000000000
--- a/src/lib/libcrypto/rsa/rsa_lib.c
+++ /dev/null
@@ -1,333 +0,0 @@
1/* crypto/rsa/rsa_lib.c */
2/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
3 * All rights reserved.
4 *
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.
8 *
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).
15 *
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.
22 *
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
25 * are met:
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)"
40 *
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
51 * SUCH DAMAGE.
52 *
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.]
57 */
58
59#include <stdio.h>
60#include <openssl/crypto.h>
61#include "cryptlib.h"
62#include <openssl/lhash.h>
63#include <openssl/bn.h>
64#include <openssl/rsa.h>
65
66const char *RSA_version="RSA" OPENSSL_VERSION_PTEXT;
67
68static RSA_METHOD *default_RSA_meth=NULL;
69static int rsa_meth_num=0;
70static STACK_OF(CRYPTO_EX_DATA_FUNCS) *rsa_meth=NULL;
71
72RSA *RSA_new(void)
73 {
74 return(RSA_new_method(NULL));
75 }
76
77void RSA_set_default_method(RSA_METHOD *meth)
78 {
79 default_RSA_meth=meth;
80 }
81
82RSA_METHOD *RSA_get_default_method(void)
83{
84 return default_RSA_meth;
85}
86
87RSA_METHOD *RSA_get_method(RSA *rsa)
88{
89 return rsa->meth;
90}
91
92RSA_METHOD *RSA_set_method(RSA *rsa, RSA_METHOD *meth)
93{
94 RSA_METHOD *mtmp;
95 mtmp = rsa->meth;
96 if (mtmp->finish) mtmp->finish(rsa);
97 rsa->meth = meth;
98 if (meth->init) meth->init(rsa);
99 return mtmp;
100}
101
102RSA *RSA_new_method(RSA_METHOD *meth)
103 {
104 RSA *ret;
105
106 if (default_RSA_meth == NULL)
107 {
108#ifdef RSA_NULL
109 default_RSA_meth=RSA_null_method();
110#else
111#ifdef RSAref
112 default_RSA_meth=RSA_PKCS1_RSAref();
113#else
114 default_RSA_meth=RSA_PKCS1_SSLeay();
115#endif
116#endif
117 }
118 ret=(RSA *)Malloc(sizeof(RSA));
119 if (ret == NULL)
120 {
121 RSAerr(RSA_F_RSA_NEW_METHOD,ERR_R_MALLOC_FAILURE);
122 return(NULL);
123 }
124
125 if (meth == NULL)
126 ret->meth=default_RSA_meth;
127 else
128 ret->meth=meth;
129
130 ret->pad=0;
131 ret->version=0;
132 ret->n=NULL;
133 ret->e=NULL;
134 ret->d=NULL;
135 ret->p=NULL;
136 ret->q=NULL;
137 ret->dmp1=NULL;
138 ret->dmq1=NULL;
139 ret->iqmp=NULL;
140 ret->references=1;
141 ret->_method_mod_n=NULL;
142 ret->_method_mod_p=NULL;
143 ret->_method_mod_q=NULL;
144 ret->blinding=NULL;
145 ret->bignum_data=NULL;
146 ret->flags=ret->meth->flags;
147 if ((ret->meth->init != NULL) && !ret->meth->init(ret))
148 {
149 Free(ret);
150 ret=NULL;
151 }
152 else
153 CRYPTO_new_ex_data(rsa_meth,ret,&ret->ex_data);
154 return(ret);
155 }
156
157void RSA_free(RSA *r)
158 {
159 int i;
160
161 if (r == NULL) return;
162
163 i=CRYPTO_add(&r->references,-1,CRYPTO_LOCK_RSA);
164#ifdef REF_PRINT
165 REF_PRINT("RSA",r);
166#endif
167 if (i > 0) return;
168#ifdef REF_CHECK
169 if (i < 0)
170 {
171 fprintf(stderr,"RSA_free, bad reference count\n");
172 abort();
173 }
174#endif
175
176 CRYPTO_free_ex_data(rsa_meth,r,&r->ex_data);
177
178 if (r->meth->finish != NULL)
179 r->meth->finish(r);
180
181 if (r->n != NULL) BN_clear_free(r->n);
182 if (r->e != NULL) BN_clear_free(r->e);
183 if (r->d != NULL) BN_clear_free(r->d);
184 if (r->p != NULL) BN_clear_free(r->p);
185 if (r->q != NULL) BN_clear_free(r->q);
186 if (r->dmp1 != NULL) BN_clear_free(r->dmp1);
187 if (r->dmq1 != NULL) BN_clear_free(r->dmq1);
188 if (r->iqmp != NULL) BN_clear_free(r->iqmp);
189 if (r->blinding != NULL) BN_BLINDING_free(r->blinding);
190 if (r->bignum_data != NULL) Free_locked(r->bignum_data);
191 Free(r);
192 }
193
194int RSA_get_ex_new_index(long argl, void *argp, CRYPTO_EX_new *new_func,
195 CRYPTO_EX_dup *dup_func, CRYPTO_EX_free *free_func)
196 {
197 rsa_meth_num++;
198 return(CRYPTO_get_ex_new_index(rsa_meth_num-1,
199 &rsa_meth,argl,argp,new_func,dup_func,free_func));
200 }
201
202int RSA_set_ex_data(RSA *r, int idx, void *arg)
203 {
204 return(CRYPTO_set_ex_data(&r->ex_data,idx,arg));
205 }
206
207void *RSA_get_ex_data(RSA *r, int idx)
208 {
209 return(CRYPTO_get_ex_data(&r->ex_data,idx));
210 }
211
212int RSA_size(RSA *r)
213 {
214 return(BN_num_bytes(r->n));
215 }
216
217int RSA_public_encrypt(int flen, unsigned char *from, unsigned char *to,
218 RSA *rsa, int padding)
219 {
220 return(rsa->meth->rsa_pub_enc(flen, from, to, rsa, padding));
221 }
222
223int RSA_private_encrypt(int flen, unsigned char *from, unsigned char *to,
224 RSA *rsa, int padding)
225 {
226 return(rsa->meth->rsa_priv_enc(flen, from, to, rsa, padding));
227 }
228
229int RSA_private_decrypt(int flen, unsigned char *from, unsigned char *to,
230 RSA *rsa, int padding)
231 {
232 return(rsa->meth->rsa_priv_dec(flen, from, to, rsa, padding));
233 }
234
235int RSA_public_decrypt(int flen, unsigned char *from, unsigned char *to,
236 RSA *rsa, int padding)
237 {
238 return(rsa->meth->rsa_pub_dec(flen, from, to, rsa, padding));
239 }
240
241int RSA_flags(RSA *r)
242 {
243 return((r == NULL)?0:r->meth->flags);
244 }
245
246void RSA_blinding_off(RSA *rsa)
247 {
248 if (rsa->blinding != NULL)
249 {
250 BN_BLINDING_free(rsa->blinding);
251 rsa->blinding=NULL;
252 }
253 rsa->flags&= ~RSA_FLAG_BLINDING;
254 }
255
256int RSA_blinding_on(RSA *rsa, BN_CTX *p_ctx)
257 {
258 BIGNUM *A,*Ai;
259 BN_CTX *ctx;
260 int ret=0;
261
262 if (p_ctx == NULL)
263 {
264 if ((ctx=BN_CTX_new()) == NULL) goto err;
265 }
266 else
267 ctx=p_ctx;
268
269 if (rsa->blinding != NULL)
270 BN_BLINDING_free(rsa->blinding);
271
272 BN_CTX_start(ctx);
273 A = BN_CTX_get(ctx);
274 if (!BN_rand(A,BN_num_bits(rsa->n)-1,1,0)) goto err;
275 if ((Ai=BN_mod_inverse(NULL,A,rsa->n,ctx)) == NULL) goto err;
276
277 if (!rsa->meth->bn_mod_exp(A,A,rsa->e,rsa->n,ctx,rsa->_method_mod_n))
278 goto err;
279 rsa->blinding=BN_BLINDING_new(A,Ai,rsa->n);
280 rsa->flags|=RSA_FLAG_BLINDING;
281 BN_free(Ai);
282 ret=1;
283err:
284 BN_CTX_end(ctx);
285 if (ctx != p_ctx) BN_CTX_free(ctx);
286 return(ret);
287 }
288
289int RSA_memory_lock(RSA *r)
290 {
291 int i,j,k,off;
292 char *p;
293 BIGNUM *bn,**t[6],*b;
294 BN_ULONG *ul;
295
296 if (r->d == NULL) return(1);
297 t[0]= &r->d;
298 t[1]= &r->p;
299 t[2]= &r->q;
300 t[3]= &r->dmp1;
301 t[4]= &r->dmq1;
302 t[5]= &r->iqmp;
303 k=sizeof(BIGNUM)*6;
304 off=k/sizeof(BN_ULONG)+1;
305 j=1;
306 for (i=0; i<6; i++)
307 j+= (*t[i])->top;
308 if ((p=Malloc_locked((off+j)*sizeof(BN_ULONG))) == NULL)
309 {
310 RSAerr(RSA_F_MEMORY_LOCK,ERR_R_MALLOC_FAILURE);
311 return(0);
312 }
313 bn=(BIGNUM *)p;
314 ul=(BN_ULONG *)&(p[off]);
315 for (i=0; i<6; i++)
316 {
317 b= *(t[i]);
318 *(t[i])= &(bn[i]);
319 memcpy((char *)&(bn[i]),(char *)b,sizeof(BIGNUM));
320 bn[i].flags=BN_FLG_STATIC_DATA;
321 bn[i].d=ul;
322 memcpy((char *)ul,b->d,sizeof(BN_ULONG)*b->top);
323 ul+=b->top;
324 BN_clear_free(b);
325 }
326
327 /* I should fix this so it can still be done */
328 r->flags&= ~(RSA_FLAG_CACHE_PRIVATE|RSA_FLAG_CACHE_PUBLIC);
329
330 r->bignum_data=p;
331 return(1);
332 }
333
generated by cgit v1.2.3-55-g6feb (git 2.39.1) at 2025-05-03 18:05:18 +0000