crypto/openssl-0.9.7e/crypto/bn/bn_exp2.c

   1 /* crypto/bn/bn_exp2.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  * Copyright (c) 1998-2000 The OpenSSL Project.  All rights reserved.
  60  *
  61  * Redistribution and use in source and binary forms, with or without
  62  * modification, are permitted provided that the following conditions
  63  * are met:
  64  *
  65  * 1. Redistributions of source code must retain the above copyright
  66  *    notice, this list of conditions and the following disclaimer.
  67  *
  68  * 2. Redistributions in binary form must reproduce the above copyright
  69  *    notice, this list of conditions and the following disclaimer in
  70  *    the documentation and/or other materials provided with the
  71  *    distribution.
  72  *
  73  * 3. All advertising materials mentioning features or use of this
  74  *    software must display the following acknowledgment:
  75  *    "This product includes software developed by the OpenSSL Project
  76  *    for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
  77  *
  78  * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
  79  *    endorse or promote products derived from this software without
  80  *    prior written permission. For written permission, please contact
  81  *    openssl-core@openssl.org.
  82  *
  83  * 5. Products derived from this software may not be called "OpenSSL"
  84  *    nor may "OpenSSL" appear in their names without prior written
  85  *    permission of the OpenSSL Project.
  86  *
  87  * 6. Redistributions of any form whatsoever must retain the following
  88  *    acknowledgment:
  89  *    "This product includes software developed by the OpenSSL Project
  90  *    for use in the OpenSSL Toolkit (http://www.openssl.org/)"
  91  *
  92  * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
  93  * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  94  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
  95  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
  96  * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  97  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  98  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  99  * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 100  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
 101  * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
 102  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
 103  * OF THE POSSIBILITY OF SUCH DAMAGE.
 104  * ====================================================================
 105  *
 106  * This product includes cryptographic software written by Eric Young
 107  * (eay@cryptsoft.com).  This product includes software written by Tim
 108  * Hudson (tjh@cryptsoft.com).
 109  *
 110  */
 111
 112 #include <stdio.h>
 113 #include "cryptlib.h"
 114 #include "bn_lcl.h"
 115
 116 #define TABLE_SIZE      32
 117
 118 int BN_mod_exp2_mont(BIGNUM *rr, const BIGNUM *a1, const BIGNUM *p1,
 119         const BIGNUM *a2, const BIGNUM *p2, const BIGNUM *m,
 120         BN_CTX *ctx, BN_MONT_CTX *in_mont)
 121         {
 122         int i,j,bits,b,bits1,bits2,ret=0,wpos1,wpos2,window1,window2,wvalue1,wvalue2;
 123         int r_is_one=1,ts1=0,ts2=0;
 124         BIGNUM *d,*r;
 125         const BIGNUM *a_mod_m;
 126         BIGNUM val1[TABLE_SIZE], val2[TABLE_SIZE];
 127         BN_MONT_CTX *mont=NULL;
 128
 129         bn_check_top(a1);
 130         bn_check_top(p1);
 131         bn_check_top(a2);
 132         bn_check_top(p2);
 133         bn_check_top(m);
 134
 135         if (!(m->d[0] & 1))
 136                 {
 137                 BNerr(BN_F_BN_MOD_EXP2_MONT,BN_R_CALLED_WITH_EVEN_MODULUS);
 138                 return(0);
 139                 }
 140         bits1=BN_num_bits(p1);
 141         bits2=BN_num_bits(p2);
 142         if ((bits1 == 0) && (bits2 == 0))
 143                 {
 144                 ret = BN_one(rr);
 145                 return ret;
 146                 }
 147
 148         bits=(bits1 > bits2)?bits1:bits2;
 149
 150         BN_CTX_start(ctx);
 151         d = BN_CTX_get(ctx);
 152         r = BN_CTX_get(ctx);
 153         if (d == NULL || r == NULL) goto err;
 154
 155         if (in_mont != NULL)
 156                 mont=in_mont;
 157         else
 158                 {
 159                 if ((mont=BN_MONT_CTX_new()) == NULL) goto err;
 160                 if (!BN_MONT_CTX_set(mont,m,ctx)) goto err;
 161                 }
 162
 163         window1 = BN_window_bits_for_exponent_size(bits1);
 164         window2 = BN_window_bits_for_exponent_size(bits2);
 165
 166         /*
 167          * Build table for a1:   val1[i] := a1^(2*i + 1) mod m  for i = 0 .. 2^(window1-1)
 168          */
 169         BN_init(&val1[0]);
 170         ts1=1;
 171         if (a1->neg || BN_ucmp(a1,m) >= 0)
 172                 {
 173                 if (!BN_mod(&(val1[0]),a1,m,ctx))
 174                         goto err;
 175                 a_mod_m = &(val1[0]);
 176                 }
 177         else
 178                 a_mod_m = a1;
 179         if (BN_is_zero(a_mod_m))
 180                 {
 181                 ret = BN_zero(rr);
 182                 goto err;
 183                 }
 184
 185         if (!BN_to_montgomery(&(val1[0]),a_mod_m,mont,ctx)) goto err;
 186         if (window1 > 1)
 187                 {
 188                 if (!BN_mod_mul_montgomery(d,&(val1[0]),&(val1[0]),mont,ctx)) goto err;
 189
 190                 j=1<<(window1-1);
 191                 for (i=1; i<j; i++)
 192                         {
 193                         BN_init(&(val1[i]));
 194                         if (!BN_mod_mul_montgomery(&(val1[i]),&(val1[i-1]),d,mont,ctx))
 195                                 goto err;
 196                         }
 197                 ts1=i;
 198                 }
 199
 200
 201         /*
 202          * Build table for a2:   val2[i] := a2^(2*i + 1) mod m  for i = 0 .. 2^(window2-1)
 203          */
 204         BN_init(&val2[0]);
 205         ts2=1;
 206         if (a2->neg || BN_ucmp(a2,m) >= 0)
 207                 {
 208                 if (!BN_mod(&(val2[0]),a2,m,ctx))
 209                         goto err;
 210                 a_mod_m = &(val2[0]);
 211                 }
 212         else
 213                 a_mod_m = a2;
 214         if (BN_is_zero(a_mod_m))
 215                 {
 216                 ret = BN_zero(rr);
 217                 goto err;
 218                 }
 219         if (!BN_to_montgomery(&(val2[0]),a_mod_m,mont,ctx)) goto err;
 220         if (window2 > 1)
 221                 {
 222                 if (!BN_mod_mul_montgomery(d,&(val2[0]),&(val2[0]),mont,ctx)) goto err;
 223
 224                 j=1<<(window2-1);
 225                 for (i=1; i<j; i++)
 226                         {
 227                         BN_init(&(val2[i]));
 228                         if (!BN_mod_mul_montgomery(&(val2[i]),&(val2[i-1]),d,mont,ctx))
 229                                 goto err;
 230                         }
 231                 ts2=i;
 232                 }
 233
 234
 235         /* Now compute the power product, using independent windows. */
 236         r_is_one=1;
 237         wvalue1=0;  /* The 'value' of the first window */
 238         wvalue2=0;  /* The 'value' of the second window */
 239         wpos1=0;    /* If wvalue1 > 0, the bottom bit of the first window */
 240         wpos2=0;    /* If wvalue2 > 0, the bottom bit of the second window */
 241
 242         if (!BN_to_montgomery(r,BN_value_one(),mont,ctx)) goto err;
 243         for (b=bits-1; b>=0; b--)
 244                 {
 245                 if (!r_is_one)
 246                         {
 247                         if (!BN_mod_mul_montgomery(r,r,r,mont,ctx))
 248                                 goto err;
 249                         }
 250
 251                 if (!wvalue1)
 252                         if (BN_is_bit_set(p1, b))
 253                                 {
 254                                 /* consider bits b-window1+1 .. b for this window */
 255                                 i = b-window1+1;
 256                                 while (!BN_is_bit_set(p1, i)) /* works for i<0 */
 257                                         i++;
 258                                 wpos1 = i;
 259                                 wvalue1 = 1;
 260                                 for (i = b-1; i >= wpos1; i--)
 261                                         {
 262                                         wvalue1 <<= 1;
 263                                         if (BN_is_bit_set(p1, i))
 264                                                 wvalue1++;
 265                                         }
 266                                 }
 267
 268                 if (!wvalue2)
 269                         if (BN_is_bit_set(p2, b))
 270                                 {
 271                                 /* consider bits b-window2+1 .. b for this window */
 272                                 i = b-window2+1;
 273                                 while (!BN_is_bit_set(p2, i))
 274                                         i++;
 275                                 wpos2 = i;
 276                                 wvalue2 = 1;
 277                                 for (i = b-1; i >= wpos2; i--)
 278                                         {
 279                                         wvalue2 <<= 1;
 280                                         if (BN_is_bit_set(p2, i))
 281                                                 wvalue2++;
 282                                         }
 283                                 }
 284
 285                 if (wvalue1 && b == wpos1)
 286                         {
 287                         /* wvalue1 is odd and < 2^window1 */
 288                         if (!BN_mod_mul_montgomery(r,r,&(val1[wvalue1>>1]),mont,ctx))
 289                                 goto err;
 290                         wvalue1 = 0;
 291                         r_is_one = 0;
 292                         }
 293
 294                 if (wvalue2 && b == wpos2)
 295                         {
 296                         /* wvalue2 is odd and < 2^window2 */
 297                         if (!BN_mod_mul_montgomery(r,r,&(val2[wvalue2>>1]),mont,ctx))
 298                                 goto err;
 299                         wvalue2 = 0;
 300                         r_is_one = 0;
 301                         }
 302                 }
 303         BN_from_montgomery(rr,r,mont,ctx);
 304         ret=1;
 305 err:
 306         if ((in_mont == NULL) && (mont != NULL)) BN_MONT_CTX_free(mont);
 307         BN_CTX_end(ctx);
 308         for (i=0; i<ts1; i++)
 309                 BN_clear_free(&(val1[i]));
 310         for (i=0; i<ts2; i++)
 311                 BN_clear_free(&(val2[i]));
 312         return(ret);
 313         }