bn_blind.c revision 280297
153913Sarchie/* crypto/bn/bn_blind.c */
253913Sarchie/* ====================================================================
353913Sarchie * Copyright (c) 1998-2006 The OpenSSL Project.  All rights reserved.
453913Sarchie *
553913Sarchie * Redistribution and use in source and binary forms, with or without
653913Sarchie * modification, are permitted provided that the following conditions
753913Sarchie * are met:
853913Sarchie *
953913Sarchie * 1. Redistributions of source code must retain the above copyright
1053913Sarchie *    notice, this list of conditions and the following disclaimer.
1153913Sarchie *
1253913Sarchie * 2. Redistributions in binary form must reproduce the above copyright
1353913Sarchie *    notice, this list of conditions and the following disclaimer in
1453913Sarchie *    the documentation and/or other materials provided with the
1553913Sarchie *    distribution.
1653913Sarchie *
1753913Sarchie * 3. All advertising materials mentioning features or use of this
1853913Sarchie *    software must display the following acknowledgment:
1953913Sarchie *    "This product includes software developed by the OpenSSL Project
2053913Sarchie *    for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
2153913Sarchie *
2253913Sarchie * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
2353913Sarchie *    endorse or promote products derived from this software without
2453913Sarchie *    prior written permission. For written permission, please contact
2553913Sarchie *    openssl-core@openssl.org.
2653913Sarchie *
2753913Sarchie * 5. Products derived from this software may not be called "OpenSSL"
2853913Sarchie *    nor may "OpenSSL" appear in their names without prior written
2953913Sarchie *    permission of the OpenSSL Project.
3053913Sarchie *
3153913Sarchie * 6. Redistributions of any form whatsoever must retain the following
3253913Sarchie *    acknowledgment:
3353913Sarchie *    "This product includes software developed by the OpenSSL Project
3453913Sarchie *    for use in the OpenSSL Toolkit (http://www.openssl.org/)"
3553913Sarchie *
3653913Sarchie * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
3753913Sarchie * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
3853913Sarchie * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
3953913Sarchie * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
4053913Sarchie * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
4153913Sarchie * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
4253913Sarchie * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
4361880Sarchie * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
4453913Sarchie * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
4553913Sarchie * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
4653913Sarchie * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
4753913Sarchie * OF THE POSSIBILITY OF SUCH DAMAGE.
4853913Sarchie * ====================================================================
4953913Sarchie *
5053913Sarchie * This product includes cryptographic software written by Eric Young
5153913Sarchie * (eay@cryptsoft.com).  This product includes software written by Tim
5253913Sarchie * Hudson (tjh@cryptsoft.com).
5353913Sarchie *
5458018Sarchie */
5553913Sarchie/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
5653913Sarchie * All rights reserved.
5753913Sarchie *
5853913Sarchie * This package is an SSL implementation written
5953913Sarchie * by Eric Young (eay@cryptsoft.com).
6053913Sarchie * The implementation was written so as to conform with Netscapes SSL.
6153913Sarchie *
6253913Sarchie * This library is free for commercial and non-commercial use as long as
6353913Sarchie * the following conditions are aheared to.  The following conditions
6453913Sarchie * apply to all code found in this distribution, be it the RC4, RSA,
6553913Sarchie * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
6653913Sarchie * included with this distribution is covered by the same copyright terms
6753913Sarchie * except that the holder is Tim Hudson (tjh@cryptsoft.com).
6853913Sarchie *
6953913Sarchie * Copyright remains Eric Young's, and as such any Copyright notices in
7053913Sarchie * the code are not to be removed.
7153913Sarchie * If this package is used in a product, Eric Young should be given attribution
7253913Sarchie * as the author of the parts of the library used.
7353913Sarchie * This can be in the form of a textual message at program startup or
7453913Sarchie * in documentation (online or textual) provided with the package.
7553913Sarchie *
7653913Sarchie * Redistribution and use in source and binary forms, with or without
7753913Sarchie * modification, are permitted provided that the following conditions
7853913Sarchie * are met:
7953913Sarchie * 1. Redistributions of source code must retain the copyright
8053913Sarchie *    notice, this list of conditions and the following disclaimer.
8153913Sarchie * 2. Redistributions in binary form must reproduce the above copyright
8253913Sarchie *    notice, this list of conditions and the following disclaimer in the
8361880Sarchie *    documentation and/or other materials provided with the distribution.
8461880Sarchie * 3. All advertising materials mentioning features or use of this software
8561880Sarchie *    must display the following acknowledgement:
8661880Sarchie *    "This product includes cryptographic software written by
8761880Sarchie *     Eric Young (eay@cryptsoft.com)"
8861880Sarchie *    The word 'cryptographic' can be left out if the rouines from the library
8961880Sarchie *    being used are not cryptographic related :-).
9061880Sarchie * 4. If you include any Windows specific code (or a derivative thereof) from
9161880Sarchie *    the apps directory (application code) you must include an acknowledgement:
9261880Sarchie *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
9361880Sarchie *
9461880Sarchie * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
9561880Sarchie * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
9661880Sarchie * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
9761880Sarchie * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
9861880Sarchie * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
9961880Sarchie * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
10061880Sarchie * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
10161880Sarchie * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
10253913Sarchie * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
10353913Sarchie * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
10453913Sarchie * SUCH DAMAGE.
10553913Sarchie *
10661880Sarchie * The licence and distribution terms for any publically available version or
10761880Sarchie * derivative of this code cannot be changed.  i.e. this code cannot simply be
10861880Sarchie * copied and put under another distribution licence
10961880Sarchie * [including the GNU Public Licence.]
11061880Sarchie */
11161880Sarchie
11261880Sarchie#include <stdio.h>
11361880Sarchie#include "cryptlib.h"
11461880Sarchie#include "bn_lcl.h"
115122556Sharti
11661880Sarchie#define BN_BLINDING_COUNTER     32
11761880Sarchie
11861880Sarchiestruct bn_blinding_st {
11961880Sarchie    BIGNUM *A;
12061880Sarchie    BIGNUM *Ai;
12161880Sarchie    BIGNUM *e;
12261880Sarchie    BIGNUM *mod;                /* just a reference */
12361880Sarchie#ifndef OPENSSL_NO_DEPRECATED
12461880Sarchie    unsigned long thread_id;    /* added in OpenSSL 0.9.6j and 0.9.7b; used
12561880Sarchie                                 * only by crypto/rsa/rsa_eay.c, rsa_lib.c */
12661880Sarchie#endif
12761880Sarchie    CRYPTO_THREADID tid;
12861880Sarchie    int counter;
12961880Sarchie    unsigned long flags;
13061880Sarchie    BN_MONT_CTX *m_ctx;
13161880Sarchie    int (*bn_mod_exp) (BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
13261880Sarchie                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *m_ctx);
13361880Sarchie};
13461880Sarchie
13561880SarchieBN_BLINDING *BN_BLINDING_new(const BIGNUM *A, const BIGNUM *Ai, BIGNUM *mod)
13661880Sarchie{
13761880Sarchie    BN_BLINDING *ret = NULL;
13861880Sarchie
13961880Sarchie    bn_check_top(mod);
14061880Sarchie
14161880Sarchie    if ((ret = (BN_BLINDING *)OPENSSL_malloc(sizeof(BN_BLINDING))) == NULL) {
14261880Sarchie        BNerr(BN_F_BN_BLINDING_NEW, ERR_R_MALLOC_FAILURE);
14361880Sarchie        return (NULL);
14461880Sarchie    }
14561880Sarchie    memset(ret, 0, sizeof(BN_BLINDING));
14661880Sarchie    if (A != NULL) {
147        if ((ret->A = BN_dup(A)) == NULL)
148            goto err;
149    }
150    if (Ai != NULL) {
151        if ((ret->Ai = BN_dup(Ai)) == NULL)
152            goto err;
153    }
154
155    /* save a copy of mod in the BN_BLINDING structure */
156    if ((ret->mod = BN_dup(mod)) == NULL)
157        goto err;
158    if (BN_get_flags(mod, BN_FLG_CONSTTIME) != 0)
159        BN_set_flags(ret->mod, BN_FLG_CONSTTIME);
160
161    /*
162     * Set the counter to the special value -1 to indicate that this is
163     * never-used fresh blinding that does not need updating before first
164     * use.
165     */
166    ret->counter = -1;
167    CRYPTO_THREADID_current(&ret->tid);
168    return (ret);
169 err:
170    if (ret != NULL)
171        BN_BLINDING_free(ret);
172    return (NULL);
173}
174
175void BN_BLINDING_free(BN_BLINDING *r)
176{
177    if (r == NULL)
178        return;
179
180    if (r->A != NULL)
181        BN_free(r->A);
182    if (r->Ai != NULL)
183        BN_free(r->Ai);
184    if (r->e != NULL)
185        BN_free(r->e);
186    if (r->mod != NULL)
187        BN_free(r->mod);
188    OPENSSL_free(r);
189}
190
191int BN_BLINDING_update(BN_BLINDING *b, BN_CTX *ctx)
192{
193    int ret = 0;
194
195    if ((b->A == NULL) || (b->Ai == NULL)) {
196        BNerr(BN_F_BN_BLINDING_UPDATE, BN_R_NOT_INITIALIZED);
197        goto err;
198    }
199
200    if (b->counter == -1)
201        b->counter = 0;
202
203    if (++b->counter == BN_BLINDING_COUNTER && b->e != NULL &&
204        !(b->flags & BN_BLINDING_NO_RECREATE)) {
205        /* re-create blinding parameters */
206        if (!BN_BLINDING_create_param(b, NULL, NULL, ctx, NULL, NULL))
207            goto err;
208    } else if (!(b->flags & BN_BLINDING_NO_UPDATE)) {
209        if (!BN_mod_mul(b->A, b->A, b->A, b->mod, ctx))
210            goto err;
211        if (!BN_mod_mul(b->Ai, b->Ai, b->Ai, b->mod, ctx))
212            goto err;
213    }
214
215    ret = 1;
216 err:
217    if (b->counter == BN_BLINDING_COUNTER)
218        b->counter = 0;
219    return (ret);
220}
221
222int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx)
223{
224    return BN_BLINDING_convert_ex(n, NULL, b, ctx);
225}
226
227int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *ctx)
228{
229    int ret = 1;
230
231    bn_check_top(n);
232
233    if ((b->A == NULL) || (b->Ai == NULL)) {
234        BNerr(BN_F_BN_BLINDING_CONVERT_EX, BN_R_NOT_INITIALIZED);
235        return (0);
236    }
237
238    if (b->counter == -1)
239        /* Fresh blinding, doesn't need updating. */
240        b->counter = 0;
241    else if (!BN_BLINDING_update(b, ctx))
242        return (0);
243
244    if (r != NULL) {
245        if (!BN_copy(r, b->Ai))
246            ret = 0;
247    }
248
249    if (!BN_mod_mul(n, n, b->A, b->mod, ctx))
250        ret = 0;
251
252    return ret;
253}
254
255int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx)
256{
257    return BN_BLINDING_invert_ex(n, NULL, b, ctx);
258}
259
260int BN_BLINDING_invert_ex(BIGNUM *n, const BIGNUM *r, BN_BLINDING *b,
261                          BN_CTX *ctx)
262{
263    int ret;
264
265    bn_check_top(n);
266
267    if (r != NULL)
268        ret = BN_mod_mul(n, n, r, b->mod, ctx);
269    else {
270        if (b->Ai == NULL) {
271            BNerr(BN_F_BN_BLINDING_INVERT_EX, BN_R_NOT_INITIALIZED);
272            return (0);
273        }
274        ret = BN_mod_mul(n, n, b->Ai, b->mod, ctx);
275    }
276
277    bn_check_top(n);
278    return (ret);
279}
280
281#ifndef OPENSSL_NO_DEPRECATED
282unsigned long BN_BLINDING_get_thread_id(const BN_BLINDING *b)
283{
284    return b->thread_id;
285}
286
287void BN_BLINDING_set_thread_id(BN_BLINDING *b, unsigned long n)
288{
289    b->thread_id = n;
290}
291#endif
292
293CRYPTO_THREADID *BN_BLINDING_thread_id(BN_BLINDING *b)
294{
295    return &b->tid;
296}
297
298unsigned long BN_BLINDING_get_flags(const BN_BLINDING *b)
299{
300    return b->flags;
301}
302
303void BN_BLINDING_set_flags(BN_BLINDING *b, unsigned long flags)
304{
305    b->flags = flags;
306}
307
308BN_BLINDING *BN_BLINDING_create_param(BN_BLINDING *b,
309                                      const BIGNUM *e, BIGNUM *m, BN_CTX *ctx,
310                                      int (*bn_mod_exp) (BIGNUM *r,
311                                                         const BIGNUM *a,
312                                                         const BIGNUM *p,
313                                                         const BIGNUM *m,
314                                                         BN_CTX *ctx,
315                                                         BN_MONT_CTX *m_ctx),
316                                      BN_MONT_CTX *m_ctx)
317{
318    int retry_counter = 32;
319    BN_BLINDING *ret = NULL;
320
321    if (b == NULL)
322        ret = BN_BLINDING_new(NULL, NULL, m);
323    else
324        ret = b;
325
326    if (ret == NULL)
327        goto err;
328
329    if (ret->A == NULL && (ret->A = BN_new()) == NULL)
330        goto err;
331    if (ret->Ai == NULL && (ret->Ai = BN_new()) == NULL)
332        goto err;
333
334    if (e != NULL) {
335        if (ret->e != NULL)
336            BN_free(ret->e);
337        ret->e = BN_dup(e);
338    }
339    if (ret->e == NULL)
340        goto err;
341
342    if (bn_mod_exp != NULL)
343        ret->bn_mod_exp = bn_mod_exp;
344    if (m_ctx != NULL)
345        ret->m_ctx = m_ctx;
346
347    do {
348        if (!BN_rand_range(ret->A, ret->mod))
349            goto err;
350        if (BN_mod_inverse(ret->Ai, ret->A, ret->mod, ctx) == NULL) {
351            /*
352             * this should almost never happen for good RSA keys
353             */
354            unsigned long error = ERR_peek_last_error();
355            if (ERR_GET_REASON(error) == BN_R_NO_INVERSE) {
356                if (retry_counter-- == 0) {
357                    BNerr(BN_F_BN_BLINDING_CREATE_PARAM,
358                          BN_R_TOO_MANY_ITERATIONS);
359                    goto err;
360                }
361                ERR_clear_error();
362            } else
363                goto err;
364        } else
365            break;
366    } while (1);
367
368    if (ret->bn_mod_exp != NULL && ret->m_ctx != NULL) {
369        if (!ret->bn_mod_exp
370            (ret->A, ret->A, ret->e, ret->mod, ctx, ret->m_ctx))
371            goto err;
372    } else {
373        if (!BN_mod_exp(ret->A, ret->A, ret->e, ret->mod, ctx))
374            goto err;
375    }
376
377    return ret;
378 err:
379    if (b == NULL && ret != NULL) {
380        BN_BLINDING_free(ret);
381        ret = NULL;
382    }
383
384    return ret;
385}
386