diff options
author | djm <> | 2008-09-06 12:17:54 +0000 |
---|---|---|
committer | djm <> | 2008-09-06 12:17:54 +0000 |
commit | 38ce604e3cc97706b876b0525ddff0121115456d (patch) | |
tree | 7ccc28afe1789ea3dbedf72365f955d5b8e105b5 /src/lib/libcrypto/bn/bn_blind.c | |
parent | 12867252827c8efaa8ddd1fa3b3d6e321e2bcdef (diff) | |
download | openbsd-38ce604e3cc97706b876b0525ddff0121115456d.tar.gz openbsd-38ce604e3cc97706b876b0525ddff0121115456d.tar.bz2 openbsd-38ce604e3cc97706b876b0525ddff0121115456d.zip |
resolve conflicts
Diffstat (limited to 'src/lib/libcrypto/bn/bn_blind.c')
-rw-r--r-- | src/lib/libcrypto/bn/bn_blind.c | 249 |
1 files changed, 235 insertions, 14 deletions
diff --git a/src/lib/libcrypto/bn/bn_blind.c b/src/lib/libcrypto/bn/bn_blind.c index 2d287e6d1b..c11fb4ccc2 100644 --- a/src/lib/libcrypto/bn/bn_blind.c +++ b/src/lib/libcrypto/bn/bn_blind.c | |||
@@ -1,4 +1,57 @@ | |||
1 | /* crypto/bn/bn_blind.c */ | 1 | /* crypto/bn/bn_blind.c */ |
2 | /* ==================================================================== | ||
3 | * Copyright (c) 1998-2005 The OpenSSL Project. All rights reserved. | ||
4 | * | ||
5 | * Redistribution and use in source and binary forms, with or without | ||
6 | * modification, are permitted provided that the following conditions | ||
7 | * are met: | ||
8 | * | ||
9 | * 1. Redistributions of source code must retain the above copyright | ||
10 | * notice, this list of conditions and the following disclaimer. | ||
11 | * | ||
12 | * 2. Redistributions in binary form must reproduce the above copyright | ||
13 | * notice, this list of conditions and the following disclaimer in | ||
14 | * the documentation and/or other materials provided with the | ||
15 | * distribution. | ||
16 | * | ||
17 | * 3. All advertising materials mentioning features or use of this | ||
18 | * software must display the following acknowledgment: | ||
19 | * "This product includes software developed by the OpenSSL Project | ||
20 | * for use in the OpenSSL Toolkit. (http://www.openssl.org/)" | ||
21 | * | ||
22 | * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to | ||
23 | * endorse or promote products derived from this software without | ||
24 | * prior written permission. For written permission, please contact | ||
25 | * openssl-core@openssl.org. | ||
26 | * | ||
27 | * 5. Products derived from this software may not be called "OpenSSL" | ||
28 | * nor may "OpenSSL" appear in their names without prior written | ||
29 | * permission of the OpenSSL Project. | ||
30 | * | ||
31 | * 6. Redistributions of any form whatsoever must retain the following | ||
32 | * acknowledgment: | ||
33 | * "This product includes software developed by the OpenSSL Project | ||
34 | * for use in the OpenSSL Toolkit (http://www.openssl.org/)" | ||
35 | * | ||
36 | * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY | ||
37 | * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | ||
38 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR | ||
39 | * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR | ||
40 | * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | ||
41 | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT | ||
42 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; | ||
43 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | ||
44 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | ||
45 | * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) | ||
46 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED | ||
47 | * OF THE POSSIBILITY OF SUCH DAMAGE. | ||
48 | * ==================================================================== | ||
49 | * | ||
50 | * This product includes cryptographic software written by Eric Young | ||
51 | * (eay@cryptsoft.com). This product includes software written by Tim | ||
52 | * Hudson (tjh@cryptsoft.com). | ||
53 | * | ||
54 | */ | ||
2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) | 55 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) |
3 | * All rights reserved. | 56 | * All rights reserved. |
4 | * | 57 | * |
@@ -60,11 +113,28 @@ | |||
60 | #include "cryptlib.h" | 113 | #include "cryptlib.h" |
61 | #include "bn_lcl.h" | 114 | #include "bn_lcl.h" |
62 | 115 | ||
63 | BN_BLINDING *BN_BLINDING_new(BIGNUM *A, BIGNUM *Ai, BIGNUM *mod) | 116 | #define BN_BLINDING_COUNTER 32 |
117 | |||
118 | struct bn_blinding_st | ||
119 | { | ||
120 | BIGNUM *A; | ||
121 | BIGNUM *Ai; | ||
122 | BIGNUM *e; | ||
123 | BIGNUM *mod; /* just a reference */ | ||
124 | unsigned long thread_id; /* added in OpenSSL 0.9.6j and 0.9.7b; | ||
125 | * used only by crypto/rsa/rsa_eay.c, rsa_lib.c */ | ||
126 | unsigned int counter; | ||
127 | unsigned long flags; | ||
128 | BN_MONT_CTX *m_ctx; | ||
129 | int (*bn_mod_exp)(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, | ||
130 | const BIGNUM *m, BN_CTX *ctx, | ||
131 | BN_MONT_CTX *m_ctx); | ||
132 | }; | ||
133 | |||
134 | BN_BLINDING *BN_BLINDING_new(const BIGNUM *A, const BIGNUM *Ai, /* const */ BIGNUM *mod) | ||
64 | { | 135 | { |
65 | BN_BLINDING *ret=NULL; | 136 | BN_BLINDING *ret=NULL; |
66 | 137 | ||
67 | bn_check_top(Ai); | ||
68 | bn_check_top(mod); | 138 | bn_check_top(mod); |
69 | 139 | ||
70 | if ((ret=(BN_BLINDING *)OPENSSL_malloc(sizeof(BN_BLINDING))) == NULL) | 140 | if ((ret=(BN_BLINDING *)OPENSSL_malloc(sizeof(BN_BLINDING))) == NULL) |
@@ -73,11 +143,21 @@ BN_BLINDING *BN_BLINDING_new(BIGNUM *A, BIGNUM *Ai, BIGNUM *mod) | |||
73 | return(NULL); | 143 | return(NULL); |
74 | } | 144 | } |
75 | memset(ret,0,sizeof(BN_BLINDING)); | 145 | memset(ret,0,sizeof(BN_BLINDING)); |
76 | if ((ret->A=BN_new()) == NULL) goto err; | 146 | if (A != NULL) |
77 | if ((ret->Ai=BN_new()) == NULL) goto err; | 147 | { |
78 | if (!BN_copy(ret->A,A)) goto err; | 148 | if ((ret->A = BN_dup(A)) == NULL) goto err; |
79 | if (!BN_copy(ret->Ai,Ai)) goto err; | 149 | } |
80 | ret->mod=mod; | 150 | if (Ai != NULL) |
151 | { | ||
152 | if ((ret->Ai = BN_dup(Ai)) == NULL) goto err; | ||
153 | } | ||
154 | |||
155 | /* save a copy of mod in the BN_BLINDING structure */ | ||
156 | if ((ret->mod = BN_dup(mod)) == NULL) goto err; | ||
157 | if (BN_get_flags(mod, BN_FLG_CONSTTIME) != 0) | ||
158 | BN_set_flags(ret->mod, BN_FLG_CONSTTIME); | ||
159 | |||
160 | ret->counter = BN_BLINDING_COUNTER; | ||
81 | return(ret); | 161 | return(ret); |
82 | err: | 162 | err: |
83 | if (ret != NULL) BN_BLINDING_free(ret); | 163 | if (ret != NULL) BN_BLINDING_free(ret); |
@@ -91,6 +171,8 @@ void BN_BLINDING_free(BN_BLINDING *r) | |||
91 | 171 | ||
92 | if (r->A != NULL) BN_free(r->A ); | 172 | if (r->A != NULL) BN_free(r->A ); |
93 | if (r->Ai != NULL) BN_free(r->Ai); | 173 | if (r->Ai != NULL) BN_free(r->Ai); |
174 | if (r->e != NULL) BN_free(r->e ); | ||
175 | if (r->mod != NULL) BN_free(r->mod); | ||
94 | OPENSSL_free(r); | 176 | OPENSSL_free(r); |
95 | } | 177 | } |
96 | 178 | ||
@@ -103,42 +185,181 @@ int BN_BLINDING_update(BN_BLINDING *b, BN_CTX *ctx) | |||
103 | BNerr(BN_F_BN_BLINDING_UPDATE,BN_R_NOT_INITIALIZED); | 185 | BNerr(BN_F_BN_BLINDING_UPDATE,BN_R_NOT_INITIALIZED); |
104 | goto err; | 186 | goto err; |
105 | } | 187 | } |
106 | 188 | ||
107 | if (!BN_mod_mul(b->A,b->A,b->A,b->mod,ctx)) goto err; | 189 | if (--(b->counter) == 0 && b->e != NULL && |
108 | if (!BN_mod_mul(b->Ai,b->Ai,b->Ai,b->mod,ctx)) goto err; | 190 | !(b->flags & BN_BLINDING_NO_RECREATE)) |
191 | { | ||
192 | /* re-create blinding parameters */ | ||
193 | if (!BN_BLINDING_create_param(b, NULL, NULL, ctx, NULL, NULL)) | ||
194 | goto err; | ||
195 | } | ||
196 | else if (!(b->flags & BN_BLINDING_NO_UPDATE)) | ||
197 | { | ||
198 | if (!BN_mod_mul(b->A,b->A,b->A,b->mod,ctx)) goto err; | ||
199 | if (!BN_mod_mul(b->Ai,b->Ai,b->Ai,b->mod,ctx)) goto err; | ||
200 | } | ||
109 | 201 | ||
110 | ret=1; | 202 | ret=1; |
111 | err: | 203 | err: |
204 | if (b->counter == 0) | ||
205 | b->counter = BN_BLINDING_COUNTER; | ||
112 | return(ret); | 206 | return(ret); |
113 | } | 207 | } |
114 | 208 | ||
115 | int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx) | 209 | int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx) |
116 | { | 210 | { |
211 | return BN_BLINDING_convert_ex(n, NULL, b, ctx); | ||
212 | } | ||
213 | |||
214 | int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *ctx) | ||
215 | { | ||
216 | int ret = 1; | ||
217 | |||
117 | bn_check_top(n); | 218 | bn_check_top(n); |
118 | 219 | ||
119 | if ((b->A == NULL) || (b->Ai == NULL)) | 220 | if ((b->A == NULL) || (b->Ai == NULL)) |
120 | { | 221 | { |
121 | BNerr(BN_F_BN_BLINDING_CONVERT,BN_R_NOT_INITIALIZED); | 222 | BNerr(BN_F_BN_BLINDING_CONVERT_EX,BN_R_NOT_INITIALIZED); |
122 | return(0); | 223 | return(0); |
123 | } | 224 | } |
124 | return(BN_mod_mul(n,n,b->A,b->mod,ctx)); | 225 | |
226 | if (r != NULL) | ||
227 | { | ||
228 | if (!BN_copy(r, b->Ai)) ret=0; | ||
229 | } | ||
230 | |||
231 | if (!BN_mod_mul(n,n,b->A,b->mod,ctx)) ret=0; | ||
232 | |||
233 | return ret; | ||
125 | } | 234 | } |
126 | 235 | ||
127 | int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx) | 236 | int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx) |
128 | { | 237 | { |
238 | return BN_BLINDING_invert_ex(n, NULL, b, ctx); | ||
239 | } | ||
240 | |||
241 | int BN_BLINDING_invert_ex(BIGNUM *n, const BIGNUM *r, BN_BLINDING *b, BN_CTX *ctx) | ||
242 | { | ||
129 | int ret; | 243 | int ret; |
130 | 244 | ||
131 | bn_check_top(n); | 245 | bn_check_top(n); |
132 | if ((b->A == NULL) || (b->Ai == NULL)) | 246 | if ((b->A == NULL) || (b->Ai == NULL)) |
133 | { | 247 | { |
134 | BNerr(BN_F_BN_BLINDING_INVERT,BN_R_NOT_INITIALIZED); | 248 | BNerr(BN_F_BN_BLINDING_INVERT_EX,BN_R_NOT_INITIALIZED); |
135 | return(0); | 249 | return(0); |
136 | } | 250 | } |
137 | if ((ret=BN_mod_mul(n,n,b->Ai,b->mod,ctx)) >= 0) | 251 | |
252 | if (r != NULL) | ||
253 | ret = BN_mod_mul(n, n, r, b->mod, ctx); | ||
254 | else | ||
255 | ret = BN_mod_mul(n, n, b->Ai, b->mod, ctx); | ||
256 | |||
257 | if (ret >= 0) | ||
138 | { | 258 | { |
139 | if (!BN_BLINDING_update(b,ctx)) | 259 | if (!BN_BLINDING_update(b,ctx)) |
140 | return(0); | 260 | return(0); |
141 | } | 261 | } |
262 | bn_check_top(n); | ||
142 | return(ret); | 263 | return(ret); |
143 | } | 264 | } |
144 | 265 | ||
266 | unsigned long BN_BLINDING_get_thread_id(const BN_BLINDING *b) | ||
267 | { | ||
268 | return b->thread_id; | ||
269 | } | ||
270 | |||
271 | void BN_BLINDING_set_thread_id(BN_BLINDING *b, unsigned long n) | ||
272 | { | ||
273 | b->thread_id = n; | ||
274 | } | ||
275 | |||
276 | unsigned long BN_BLINDING_get_flags(const BN_BLINDING *b) | ||
277 | { | ||
278 | return b->flags; | ||
279 | } | ||
280 | |||
281 | void BN_BLINDING_set_flags(BN_BLINDING *b, unsigned long flags) | ||
282 | { | ||
283 | b->flags = flags; | ||
284 | } | ||
285 | |||
286 | BN_BLINDING *BN_BLINDING_create_param(BN_BLINDING *b, | ||
287 | const BIGNUM *e, /* const */ BIGNUM *m, BN_CTX *ctx, | ||
288 | int (*bn_mod_exp)(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, | ||
289 | const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx), | ||
290 | BN_MONT_CTX *m_ctx) | ||
291 | { | ||
292 | int retry_counter = 32; | ||
293 | BN_BLINDING *ret = NULL; | ||
294 | |||
295 | if (b == NULL) | ||
296 | ret = BN_BLINDING_new(NULL, NULL, m); | ||
297 | else | ||
298 | ret = b; | ||
299 | |||
300 | if (ret == NULL) | ||
301 | goto err; | ||
302 | |||
303 | if (ret->A == NULL && (ret->A = BN_new()) == NULL) | ||
304 | goto err; | ||
305 | if (ret->Ai == NULL && (ret->Ai = BN_new()) == NULL) | ||
306 | goto err; | ||
307 | |||
308 | if (e != NULL) | ||
309 | { | ||
310 | if (ret->e != NULL) | ||
311 | BN_free(ret->e); | ||
312 | ret->e = BN_dup(e); | ||
313 | } | ||
314 | if (ret->e == NULL) | ||
315 | goto err; | ||
316 | |||
317 | if (bn_mod_exp != NULL) | ||
318 | ret->bn_mod_exp = bn_mod_exp; | ||
319 | if (m_ctx != NULL) | ||
320 | ret->m_ctx = m_ctx; | ||
321 | |||
322 | do { | ||
323 | if (!BN_rand_range(ret->A, ret->mod)) goto err; | ||
324 | if (BN_mod_inverse(ret->Ai, ret->A, ret->mod, ctx) == NULL) | ||
325 | { | ||
326 | /* this should almost never happen for good RSA keys */ | ||
327 | unsigned long error = ERR_peek_last_error(); | ||
328 | if (ERR_GET_REASON(error) == BN_R_NO_INVERSE) | ||
329 | { | ||
330 | if (retry_counter-- == 0) | ||
331 | { | ||
332 | BNerr(BN_F_BN_BLINDING_CREATE_PARAM, | ||
333 | BN_R_TOO_MANY_ITERATIONS); | ||
334 | goto err; | ||
335 | } | ||
336 | ERR_clear_error(); | ||
337 | } | ||
338 | else | ||
339 | goto err; | ||
340 | } | ||
341 | else | ||
342 | break; | ||
343 | } while (1); | ||
344 | |||
345 | if (ret->bn_mod_exp != NULL && ret->m_ctx != NULL) | ||
346 | { | ||
347 | if (!ret->bn_mod_exp(ret->A, ret->A, ret->e, ret->mod, ctx, ret->m_ctx)) | ||
348 | goto err; | ||
349 | } | ||
350 | else | ||
351 | { | ||
352 | if (!BN_mod_exp(ret->A, ret->A, ret->e, ret->mod, ctx)) | ||
353 | goto err; | ||
354 | } | ||
355 | |||
356 | return ret; | ||
357 | err: | ||
358 | if (b == NULL && ret != NULL) | ||
359 | { | ||
360 | BN_BLINDING_free(ret); | ||
361 | ret = NULL; | ||
362 | } | ||
363 | |||
364 | return ret; | ||
365 | } | ||