1 /* ====================================================================
2 * Copyright (c) 1998-2006 The OpenSSL Project. All rights reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in
13 * the documentation and/or other materials provided with the
16 * 3. All advertising materials mentioning features or use of this
17 * software must display the following acknowledgment:
18 * "This product includes software developed by the OpenSSL Project
19 * for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
21 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
22 * endorse or promote products derived from this software without
23 * prior written permission. For written permission, please contact
24 * openssl-core@openssl.org.
26 * 5. Products derived from this software may not be called "OpenSSL"
27 * nor may "OpenSSL" appear in their names without prior written
28 * permission of the OpenSSL Project.
30 * 6. Redistributions of any form whatsoever must retain the following
32 * "This product includes software developed by the OpenSSL Project
33 * for use in the OpenSSL Toolkit (http://www.openssl.org/)"
35 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
36 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
37 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
38 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
39 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
40 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
41 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
42 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
43 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
44 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
45 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
46 * OF THE POSSIBILITY OF SUCH DAMAGE.
47 * ====================================================================
49 * This product includes cryptographic software written by Eric Young
50 * (eay@cryptsoft.com). This product includes software written by Tim
51 * Hudson (tjh@cryptsoft.com).
54 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
55 * All rights reserved.
57 * This package is an SSL implementation written
58 * by Eric Young (eay@cryptsoft.com).
59 * The implementation was written so as to conform with Netscapes SSL.
61 * This library is free for commercial and non-commercial use as long as
62 * the following conditions are aheared to. The following conditions
63 * apply to all code found in this distribution, be it the RC4, RSA,
64 * lhash, DES, etc., code; not just the SSL code. The SSL documentation
65 * included with this distribution is covered by the same copyright terms
66 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
68 * Copyright remains Eric Young's, and as such any Copyright notices in
69 * the code are not to be removed.
70 * If this package is used in a product, Eric Young should be given attribution
71 * as the author of the parts of the library used.
72 * This can be in the form of a textual message at program startup or
73 * in documentation (online or textual) provided with the package.
75 * Redistribution and use in source and binary forms, with or without
76 * modification, are permitted provided that the following conditions
78 * 1. Redistributions of source code must retain the copyright
79 * notice, this list of conditions and the following disclaimer.
80 * 2. Redistributions in binary form must reproduce the above copyright
81 * notice, this list of conditions and the following disclaimer in the
82 * documentation and/or other materials provided with the distribution.
83 * 3. All advertising materials mentioning features or use of this software
84 * must display the following acknowledgement:
85 * "This product includes cryptographic software written by
86 * Eric Young (eay@cryptsoft.com)"
87 * The word 'cryptographic' can be left out if the rouines from the library
88 * being used are not cryptographic related :-).
89 * 4. If you include any Windows specific code (or a derivative thereof) from
90 * the apps directory (application code) you must include an acknowledgement:
91 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
93 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
94 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
95 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
96 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
97 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
98 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
99 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
100 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
101 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
102 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
105 * The licence and distribution terms for any publically available version or
106 * derivative of this code cannot be changed. i.e. this code cannot simply be
107 * copied and put under another distribution licence
108 * [including the GNU Public Licence.]
111 #include <openssl/opensslconf.h>
112 #include "internal/cryptlib.h"
113 #include "internal/threads.h"
116 #define BN_BLINDING_COUNTER 32
118 struct bn_blinding_st {
122 BIGNUM *mod; /* just a reference */
123 CRYPTO_THREAD_ID tid;
127 int (*bn_mod_exp) (BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
128 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);
132 BN_BLINDING *BN_BLINDING_new(const BIGNUM *A, const BIGNUM *Ai, BIGNUM *mod)
134 BN_BLINDING *ret = NULL;
138 if ((ret = OPENSSL_zalloc(sizeof(*ret))) == NULL) {
139 BNerr(BN_F_BN_BLINDING_NEW, ERR_R_MALLOC_FAILURE);
143 ret->lock = CRYPTO_THREAD_lock_new();
144 if (ret->lock == NULL) {
145 BNerr(BN_F_BN_BLINDING_NEW, ERR_R_MALLOC_FAILURE);
150 BN_BLINDING_set_current_thread(ret);
153 if ((ret->A = BN_dup(A)) == NULL)
158 if ((ret->Ai = BN_dup(Ai)) == NULL)
162 /* save a copy of mod in the BN_BLINDING structure */
163 if ((ret->mod = BN_dup(mod)) == NULL)
166 if (BN_get_flags(mod, BN_FLG_CONSTTIME) != 0)
167 BN_set_flags(ret->mod, BN_FLG_CONSTTIME);
170 * Set the counter to the special value -1 to indicate that this is
171 * never-used fresh blinding that does not need updating before first
179 BN_BLINDING_free(ret);
183 void BN_BLINDING_free(BN_BLINDING *r)
192 CRYPTO_THREAD_lock_free(r->lock);
196 int BN_BLINDING_update(BN_BLINDING *b, BN_CTX *ctx)
200 if ((b->A == NULL) || (b->Ai == NULL)) {
201 BNerr(BN_F_BN_BLINDING_UPDATE, BN_R_NOT_INITIALIZED);
205 if (b->counter == -1)
208 if (++b->counter == BN_BLINDING_COUNTER && b->e != NULL &&
209 !(b->flags & BN_BLINDING_NO_RECREATE)) {
210 /* re-create blinding parameters */
211 if (!BN_BLINDING_create_param(b, NULL, NULL, ctx, NULL, NULL))
213 } else if (!(b->flags & BN_BLINDING_NO_UPDATE)) {
214 if (!BN_mod_mul(b->A, b->A, b->A, b->mod, ctx))
216 if (!BN_mod_mul(b->Ai, b->Ai, b->Ai, b->mod, ctx))
222 if (b->counter == BN_BLINDING_COUNTER)
227 int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx)
229 return BN_BLINDING_convert_ex(n, NULL, b, ctx);
232 int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *ctx)
238 if ((b->A == NULL) || (b->Ai == NULL)) {
239 BNerr(BN_F_BN_BLINDING_CONVERT_EX, BN_R_NOT_INITIALIZED);
243 if (b->counter == -1)
244 /* Fresh blinding, doesn't need updating. */
246 else if (!BN_BLINDING_update(b, ctx))
250 if (!BN_copy(r, b->Ai))
254 if (!BN_mod_mul(n, n, b->A, b->mod, ctx))
260 int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx)
262 return BN_BLINDING_invert_ex(n, NULL, b, ctx);
265 int BN_BLINDING_invert_ex(BIGNUM *n, const BIGNUM *r, BN_BLINDING *b,
273 ret = BN_mod_mul(n, n, r, b->mod, ctx);
276 BNerr(BN_F_BN_BLINDING_INVERT_EX, BN_R_NOT_INITIALIZED);
279 ret = BN_mod_mul(n, n, b->Ai, b->mod, ctx);
286 int BN_BLINDING_is_current_thread(BN_BLINDING *b)
288 return CRYPTO_THREAD_compare_id(CRYPTO_THREAD_get_current_id(), b->tid);
291 void BN_BLINDING_set_current_thread(BN_BLINDING *b)
293 b->tid = CRYPTO_THREAD_get_current_id();
296 int BN_BLINDING_lock(BN_BLINDING *b)
298 return CRYPTO_THREAD_write_lock(b->lock);
301 int BN_BLINDING_unlock(BN_BLINDING *b)
303 return CRYPTO_THREAD_unlock(b->lock);
306 unsigned long BN_BLINDING_get_flags(const BN_BLINDING *b)
311 void BN_BLINDING_set_flags(BN_BLINDING *b, unsigned long flags)
316 BN_BLINDING *BN_BLINDING_create_param(BN_BLINDING *b,
317 const BIGNUM *e, BIGNUM *m, BN_CTX *ctx,
318 int (*bn_mod_exp) (BIGNUM *r,
326 int retry_counter = 32;
327 BN_BLINDING *ret = NULL;
330 ret = BN_BLINDING_new(NULL, NULL, m);
337 if (ret->A == NULL && (ret->A = BN_new()) == NULL)
339 if (ret->Ai == NULL && (ret->Ai = BN_new()) == NULL)
349 if (bn_mod_exp != NULL)
350 ret->bn_mod_exp = bn_mod_exp;
356 if (!BN_rand_range(ret->A, ret->mod))
358 if (!int_bn_mod_inverse(ret->Ai, ret->A, ret->mod, ctx, &rv)) {
360 * this should almost never happen for good RSA keys
363 if (retry_counter-- == 0) {
364 BNerr(BN_F_BN_BLINDING_CREATE_PARAM,
365 BN_R_TOO_MANY_ITERATIONS);
374 if (ret->bn_mod_exp != NULL && ret->m_ctx != NULL) {
376 (ret->A, ret->A, ret->e, ret->mod, ctx, ret->m_ctx))
379 if (!BN_mod_exp(ret->A, ret->A, ret->e, ret->mod, ctx))
386 BN_BLINDING_free(ret);