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).
53 * Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
54 * All rights reserved.
56 * This package is an SSL implementation written
57 * by Eric Young (eay@cryptsoft.com).
58 * The implementation was written so as to conform with Netscapes SSL.
60 * This library is free for commercial and non-commercial use as long as
61 * the following conditions are aheared to. The following conditions
62 * apply to all code found in this distribution, be it the RC4, RSA,
63 * lhash, DES, etc., code; not just the SSL code. The SSL documentation
64 * included with this distribution is covered by the same copyright terms
65 * except that the holder is Tim Hudson (tjh@cryptsoft.com).
67 * Copyright remains Eric Young's, and as such any Copyright notices in
68 * the code are not to be removed.
69 * If this package is used in a product, Eric Young should be given attribution
70 * as the author of the parts of the library used.
71 * This can be in the form of a textual message at program startup or
72 * in documentation (online or textual) provided with the package.
74 * Redistribution and use in source and binary forms, with or without
75 * modification, are permitted provided that the following conditions
77 * 1. Redistributions of source code must retain the copyright
78 * notice, this list of conditions and the following disclaimer.
79 * 2. Redistributions in binary form must reproduce the above copyright
80 * notice, this list of conditions and the following disclaimer in the
81 * documentation and/or other materials provided with the distribution.
82 * 3. All advertising materials mentioning features or use of this software
83 * must display the following acknowledgement:
84 * "This product includes cryptographic software written by
85 * Eric Young (eay@cryptsoft.com)"
86 * The word 'cryptographic' can be left out if the rouines from the library
87 * being used are not cryptographic related :-).
88 * 4. If you include any Windows specific code (or a derivative thereof) from
89 * the apps directory (application code) you must include an acknowledgement:
90 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
92 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
93 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
94 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
95 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
96 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
97 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
98 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
99 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
100 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
101 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
104 * The licence and distribution terms for any publically available version or
105 * derivative of this code cannot be changed. i.e. this code cannot simply be
106 * copied and put under another distribution licence
107 * [including the GNU Public Licence.] */
109 #include <openssl/rsa.h>
111 #include <openssl/bn.h>
112 #include <openssl/mem.h>
113 #include <openssl/err.h>
115 #include "internal.h"
117 #define BN_BLINDING_COUNTER 32
119 struct bn_blinding_st {
123 BIGNUM *mod; /* just a reference */
128 int (*bn_mod_exp)(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
129 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) {
133 BN_BLINDING *ret = NULL;
135 ret = (BN_BLINDING*) OPENSSL_malloc(sizeof(BN_BLINDING));
137 OPENSSL_PUT_ERROR(RSA, BN_BLINDING_new, ERR_R_MALLOC_FAILURE);
140 memset(ret, 0, sizeof(BN_BLINDING));
143 if (ret->A == NULL) {
148 ret->Ai = BN_dup(Ai);
149 if (ret->Ai == NULL) {
154 /* save a copy of mod in the BN_BLINDING structure */
155 ret->mod = BN_dup(mod);
156 if (ret->mod == NULL) {
159 if (BN_get_flags(mod, BN_FLG_CONSTTIME) != 0) {
160 BN_set_flags(ret->mod, BN_FLG_CONSTTIME);
163 /* Set the counter to the special value -1
164 * to indicate that this is never-used fresh blinding
165 * that does not need updating before first use. */
167 CRYPTO_THREADID_current(&ret->tid);
172 BN_BLINDING_free(ret);
177 void BN_BLINDING_free(BN_BLINDING *r) {
193 int BN_BLINDING_update(BN_BLINDING *b, BN_CTX *ctx) {
196 if (b->A == NULL || b->Ai == NULL) {
197 OPENSSL_PUT_ERROR(RSA, BN_BLINDING_update, RSA_R_BN_NOT_INITIALIZED);
201 if (b->counter == -1) {
205 if (++b->counter == BN_BLINDING_COUNTER && b->e != NULL &&
206 !(b->flags & BN_BLINDING_NO_RECREATE)) {
207 /* re-create blinding parameters */
208 if (!BN_BLINDING_create_param(b, NULL, NULL, ctx, NULL, NULL)) {
211 } else if (!(b->flags & BN_BLINDING_NO_UPDATE)) {
212 if (!BN_mod_mul(b->A, b->A, b->A, b->mod, ctx)) {
215 if (!BN_mod_mul(b->Ai, b->Ai, b->Ai, b->mod, ctx)) {
223 if (b->counter == BN_BLINDING_COUNTER) {
229 int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx) {
230 return BN_BLINDING_convert_ex(n, NULL, b, ctx);
233 int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *ctx) {
236 if (b->A == NULL || b->Ai == NULL) {
237 OPENSSL_PUT_ERROR(RSA, BN_BLINDING_convert_ex, RSA_R_BN_NOT_INITIALIZED);
241 if (b->counter == -1) {
242 /* Fresh blinding, doesn't need updating. */
244 } else if (!BN_BLINDING_update(b, ctx)) {
249 if (!BN_copy(r, b->Ai)) {
254 if (!BN_mod_mul(n, n, b->A, b->mod, ctx)) {
261 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,
270 ret = BN_mod_mul(n, n, r, b->mod, ctx);
273 OPENSSL_PUT_ERROR(RSA, BN_BLINDING_invert_ex, RSA_R_BN_NOT_INITIALIZED);
276 ret = BN_mod_mul(n, n, b->Ai, b->mod, ctx);
282 CRYPTO_THREADID *BN_BLINDING_thread_id(BN_BLINDING *b) { return &b->tid; }
284 unsigned long BN_BLINDING_get_flags(const BN_BLINDING *b) { return b->flags; }
286 void BN_BLINDING_set_flags(BN_BLINDING *b, unsigned long flags) {
290 BN_BLINDING *BN_BLINDING_create_param(
291 BN_BLINDING *b, const BIGNUM *e, BIGNUM *m, BN_CTX *ctx,
292 int (*bn_mod_exp)(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
293 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx),
294 BN_MONT_CTX *m_ctx) {
295 int retry_counter = 32;
296 BN_BLINDING *ret = NULL;
299 ret = BN_BLINDING_new(NULL, NULL, m);
308 if (ret->A == NULL && (ret->A = BN_new()) == NULL) {
311 if (ret->Ai == NULL && (ret->Ai = BN_new()) == NULL) {
316 if (ret->e != NULL) {
321 if (ret->e == NULL) {
325 if (bn_mod_exp != NULL) {
326 ret->bn_mod_exp = bn_mod_exp;
333 if (!BN_rand_range(ret->A, ret->mod)) {
336 if (BN_mod_inverse(ret->Ai, ret->A, ret->mod, ctx) == NULL) {
337 /* this should almost never happen for good RSA keys */
338 uint32_t error = ERR_peek_last_error();
339 if (ERR_GET_REASON(error) == BN_R_NO_INVERSE) {
340 if (retry_counter-- == 0) {
341 OPENSSL_PUT_ERROR(RSA, BN_BLINDING_create_param,
342 RSA_R_TOO_MANY_ITERATIONS);
354 if (ret->bn_mod_exp != NULL && ret->m_ctx != NULL) {
355 if (!ret->bn_mod_exp(ret->A, ret->A, ret->e, ret->mod, ctx, ret->m_ctx)) {
359 if (!BN_mod_exp(ret->A, ret->A, ret->e, ret->mod, ctx)) {
367 if (b == NULL && ret != NULL) {
368 BN_BLINDING_free(ret);
375 static BIGNUM *rsa_get_public_exp(const BIGNUM *d, const BIGNUM *p,
376 const BIGNUM *q, BN_CTX *ctx) {
377 BIGNUM *ret = NULL, *r0, *r1, *r2;
379 if (d == NULL || p == NULL || q == NULL) {
384 r0 = BN_CTX_get(ctx);
385 r1 = BN_CTX_get(ctx);
386 r2 = BN_CTX_get(ctx);
391 if (!BN_sub(r1, p, BN_value_one())) {
394 if (!BN_sub(r2, q, BN_value_one())) {
397 if (!BN_mul(r0, r1, r2, ctx)) {
401 ret = BN_mod_inverse(NULL, d, r0, ctx);
408 BN_BLINDING *rsa_setup_blinding(RSA *rsa, BN_CTX *in_ctx) {
412 BN_BLINDING *ret = NULL;
414 if (in_ctx == NULL) {
426 OPENSSL_PUT_ERROR(RSA, rsa_setup_blinding, ERR_R_MALLOC_FAILURE);
430 if (rsa->e == NULL) {
431 e = rsa_get_public_exp(rsa->d, rsa->p, rsa->q, ctx);
433 OPENSSL_PUT_ERROR(RSA, rsa_setup_blinding, RSA_R_NO_PUBLIC_EXPONENT);
441 BN_with_flags(n, rsa->n, BN_FLG_CONSTTIME);
443 if (rsa->flags & RSA_FLAG_CACHE_PUBLIC) {
444 if (!BN_MONT_CTX_set_locked(&rsa->_method_mod_n, CRYPTO_LOCK_RSA, rsa->n,
450 ret = BN_BLINDING_create_param(NULL, e, n, ctx, rsa->meth->bn_mod_exp,
453 OPENSSL_PUT_ERROR(RSA, rsa_setup_blinding, ERR_R_BN_LIB);
456 CRYPTO_THREADID_current(BN_BLINDING_thread_id(ret));
460 if (in_ctx == NULL) {
463 if (rsa->e == NULL) {