1 /* crypto/bn/bn_exp.c */
2 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
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.
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).
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.
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
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)"
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
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.]
58 /* ====================================================================
59 * Copyright (c) 1998-2000 The OpenSSL Project. All rights reserved.
61 * Redistribution and use in source and binary forms, with or without
62 * modification, are permitted provided that the following conditions
65 * 1. Redistributions of source code must retain the above copyright
66 * notice, this list of conditions and the following disclaimer.
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
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/)"
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.
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.
87 * 6. Redistributions of any form whatsoever must retain the following
89 * "This product includes software developed by the OpenSSL Project
90 * for use in the OpenSSL Toolkit (http://www.openssl.org/)"
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 * ====================================================================
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).
113 #include "cryptlib.h"
116 #define TABLE_SIZE 32
118 /* this one works - simple but works */
119 int BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
125 if ((r == a) || (r == p))
126 rr = BN_CTX_get(ctx);
129 if ((v = BN_CTX_get(ctx)) == NULL) goto err;
131 if (BN_copy(v,a) == NULL) goto err;
135 { if (BN_copy(rr,a) == NULL) goto err; }
136 else { if (!BN_one(rr)) goto err; }
138 for (i=1; i<bits; i++)
140 if (!BN_sqr(v,v,ctx)) goto err;
141 if (BN_is_bit_set(p,i))
143 if (!BN_mul(rr,rr,v,ctx)) goto err;
148 if (r != rr) BN_copy(r,rr);
154 int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
163 /* For even modulus m = 2^k*m_odd, it might make sense to compute
164 * a^p mod m_odd and a^p mod 2^k separately (with Montgomery
165 * exponentiation for the odd part), using appropriate exponent
166 * reductions, and combine the results using the CRT.
168 * For now, we use Montgomery only if the modulus is odd; otherwise,
169 * exponentiation using the reciprocal-based quick remaindering
172 * (Timing obtained with expspeed.c [computations a^p mod m
173 * where a, p, m are of the same length: 256, 512, 1024, 2048,
174 * 4096, 8192 bits], compared to the running time of the
175 * standard algorithm:
177 * BN_mod_exp_mont 33 .. 40 % [AMD K6-2, Linux, debug configuration]
178 * 55 .. 77 % [UltraSparc processor, but
179 * debug-solaris-sparcv8-gcc conf.]
181 * BN_mod_exp_recp 50 .. 70 % [AMD K6-2, Linux, debug configuration]
182 * 62 .. 118 % [UltraSparc, debug-solaris-sparcv8-gcc]
184 * On the Sparc, BN_mod_exp_recp was faster than BN_mod_exp_mont
185 * at 2048 and more bits, but at 512 and 1024 bits, it was
186 * slower even than the standard algorithm!
188 * "Real" timings [linux-elf, solaris-sparcv9-gcc configurations]
189 * should be obtained when the new Montgomery reduction code
190 * has been integrated into OpenSSL.)
197 /* I have finally been able to take out this pre-condition of
198 * the top bit being set. It was caused by an error in BN_div
199 * with negatives. There was also another problem when for a^b%m
200 * a >= m. eay 07-May-97 */
201 /* if ((m->d[m->top-1]&BN_TBIT) && BN_is_odd(m)) */
205 if (a->top == 1 && !a->neg)
207 BN_ULONG A = a->d[0];
209 A %= m->d[0]; /* make sure that A is reduced */
210 ret=BN_mod_exp_mont_word(r,A,p,m,ctx,NULL);
213 ret=BN_mod_exp_mont(r,a,p,m,ctx,NULL);
218 { ret=BN_mod_exp_recp(r,a,p,m,ctx); }
220 { ret=BN_mod_exp_simple(r,a,p,m,ctx); }
227 int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
228 const BIGNUM *m, BN_CTX *ctx)
230 int i,j,bits,ret=0,wstart,wend,window,wvalue;
233 BIGNUM val[TABLE_SIZE];
250 if ((aa = BN_CTX_get(ctx)) == NULL) goto err;
252 BN_RECP_CTX_init(&recp);
253 if (BN_RECP_CTX_set(&recp,m,ctx) <= 0) goto err;
258 if (!BN_nnmod(&(val[0]),a,m,ctx)) goto err; /* 1 */
260 window = BN_window_bits_for_exponent_size(bits);
263 if (!BN_mod_mul_reciprocal(aa,&(val[0]),&(val[0]),&recp,ctx))
269 if (!BN_mod_mul_reciprocal(&(val[i]),&(val[i-1]),aa,&recp,ctx))
275 start=1; /* This is used to avoid multiplication etc
276 * when there is only the value '1' in the
278 wvalue=0; /* The 'value' of the window */
279 wstart=bits-1; /* The top bit of the window */
280 wend=0; /* The bottom bit of the window */
282 if (!BN_one(r)) goto err;
286 if (BN_is_bit_set(p,wstart) == 0)
289 if (!BN_mod_mul_reciprocal(r,r,r,&recp,ctx))
291 if (wstart == 0) break;
295 /* We now have wstart on a 'set' bit, we now need to work out
296 * how bit a window to do. To do this we need to scan
297 * forward until the last set bit before the end of the
302 for (i=1; i<window; i++)
304 if (wstart-i < 0) break;
305 if (BN_is_bit_set(p,wstart-i))
313 /* wend is the size of the current window */
315 /* add the 'bytes above' */
319 if (!BN_mod_mul_reciprocal(r,r,r,&recp,ctx))
323 /* wvalue will be an odd number < 2^window */
324 if (!BN_mod_mul_reciprocal(r,r,&(val[wvalue>>1]),&recp,ctx))
327 /* move the 'window' down further */
331 if (wstart < 0) break;
337 BN_clear_free(&(val[i]));
338 BN_RECP_CTX_free(&recp);
343 int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
344 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
346 int i,j,bits,ret=0,wstart,wend,window,wvalue;
350 BIGNUM val[TABLE_SIZE];
351 BN_MONT_CTX *mont=NULL;
359 BNerr(BN_F_BN_MOD_EXP_MONT,BN_R_CALLED_WITH_EVEN_MODULUS);
376 if (d == NULL || r == NULL) goto err;
378 /* If this is not done, things will break in the montgomery
385 if ((mont=BN_MONT_CTX_new()) == NULL) goto err;
386 if (!BN_MONT_CTX_set(mont,m,ctx)) goto err;
391 if (a->neg || BN_ucmp(a,m) >= 0)
393 if (!BN_nnmod(&(val[0]),a,m,ctx))
399 if (!BN_to_montgomery(&(val[0]),aa,mont,ctx)) goto err; /* 1 */
401 window = BN_window_bits_for_exponent_size(bits);
404 if (!BN_mod_mul_montgomery(d,&(val[0]),&(val[0]),mont,ctx)) goto err; /* 2 */
409 if (!BN_mod_mul_montgomery(&(val[i]),&(val[i-1]),d,mont,ctx))
415 start=1; /* This is used to avoid multiplication etc
416 * when there is only the value '1' in the
418 wvalue=0; /* The 'value' of the window */
419 wstart=bits-1; /* The top bit of the window */
420 wend=0; /* The bottom bit of the window */
422 if (!BN_to_montgomery(r,BN_value_one(),mont,ctx)) goto err;
425 if (BN_is_bit_set(p,wstart) == 0)
429 if (!BN_mod_mul_montgomery(r,r,r,mont,ctx))
432 if (wstart == 0) break;
436 /* We now have wstart on a 'set' bit, we now need to work out
437 * how bit a window to do. To do this we need to scan
438 * forward until the last set bit before the end of the
443 for (i=1; i<window; i++)
445 if (wstart-i < 0) break;
446 if (BN_is_bit_set(p,wstart-i))
454 /* wend is the size of the current window */
456 /* add the 'bytes above' */
460 if (!BN_mod_mul_montgomery(r,r,r,mont,ctx))
464 /* wvalue will be an odd number < 2^window */
465 if (!BN_mod_mul_montgomery(r,r,&(val[wvalue>>1]),mont,ctx))
468 /* move the 'window' down further */
472 if (wstart < 0) break;
474 if (!BN_from_montgomery(rr,r,mont,ctx)) goto err;
477 if ((in_mont == NULL) && (mont != NULL)) BN_MONT_CTX_free(mont);
480 BN_clear_free(&(val[i]));
484 int BN_mod_exp_mont_word(BIGNUM *rr, BN_ULONG a, const BIGNUM *p,
485 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
487 BN_MONT_CTX *mont = NULL;
493 #define BN_MOD_MUL_WORD(r, w, m) \
494 (BN_mul_word(r, (w)) && \
495 (/* BN_ucmp(r, (m)) < 0 ? 1 :*/ \
496 (BN_mod(t, r, m, ctx) && (swap_tmp = r, r = t, t = swap_tmp, 1))))
497 /* BN_MOD_MUL_WORD is only used with 'w' large,
498 * so the BN_ucmp test is probably more overhead
499 * than always using BN_mod (which uses BN_copy if
500 * a similar test returns true). */
501 #define BN_TO_MONTGOMERY_WORD(r, w, mont) \
502 (BN_set_word(r, (w)) && BN_to_montgomery(r, r, (mont), ctx))
509 BNerr(BN_F_BN_MOD_EXP_MONT_WORD,BN_R_CALLED_WITH_EVEN_MODULUS);
512 bits = BN_num_bits(p);
528 if (d == NULL || r == NULL || t == NULL) goto err;
534 if ((mont = BN_MONT_CTX_new()) == NULL) goto err;
535 if (!BN_MONT_CTX_set(mont, m, ctx)) goto err;
538 r_is_one = 1; /* except for Montgomery factor */
542 /* The result is accumulated in the product r*w. */
543 w = a; /* bit 'bits-1' of 'p' is always set */
544 for (b = bits-2; b >= 0; b--)
546 /* First, square r*w. */
548 if ((next_w/w) != w) /* overflow */
552 if (!BN_TO_MONTGOMERY_WORD(r, w, mont)) goto err;
557 if (!BN_MOD_MUL_WORD(r, w, m)) goto err;
564 if (!BN_mod_mul_montgomery(r, r, r, mont, ctx)) goto err;
567 /* Second, multiply r*w by 'a' if exponent bit is set. */
568 if (BN_is_bit_set(p, b))
571 if ((next_w/a) != w) /* overflow */
575 if (!BN_TO_MONTGOMERY_WORD(r, w, mont)) goto err;
580 if (!BN_MOD_MUL_WORD(r, w, m)) goto err;
588 /* Finally, set r:=r*w. */
593 if (!BN_TO_MONTGOMERY_WORD(r, w, mont)) goto err;
598 if (!BN_MOD_MUL_WORD(r, w, m)) goto err;
602 if (r_is_one) /* can happen only if a == 1*/
604 if (!BN_one(rr)) goto err;
608 if (!BN_from_montgomery(rr, r, mont, ctx)) goto err;
612 if ((in_mont == NULL) && (mont != NULL)) BN_MONT_CTX_free(mont);
618 /* The old fallback, simple version :-) */
619 int BN_mod_exp_simple(BIGNUM *r,
620 const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
623 int i,j,bits,ret=0,wstart,wend,window,wvalue,ts=0;
626 BIGNUM val[TABLE_SIZE];
642 if ((d = BN_CTX_get(ctx)) == NULL) goto err;
646 if (!BN_nnmod(&(val[0]),a,m,ctx)) goto err; /* 1 */
648 window = BN_window_bits_for_exponent_size(bits);
651 if (!BN_mod_mul(d,&(val[0]),&(val[0]),m,ctx))
657 if (!BN_mod_mul(&(val[i]),&(val[i-1]),d,m,ctx))
663 start=1; /* This is used to avoid multiplication etc
664 * when there is only the value '1' in the
666 wvalue=0; /* The 'value' of the window */
667 wstart=bits-1; /* The top bit of the window */
668 wend=0; /* The bottom bit of the window */
670 if (!BN_one(r)) goto err;
674 if (BN_is_bit_set(p,wstart) == 0)
677 if (!BN_mod_mul(r,r,r,m,ctx))
679 if (wstart == 0) break;
683 /* We now have wstart on a 'set' bit, we now need to work out
684 * how bit a window to do. To do this we need to scan
685 * forward until the last set bit before the end of the
690 for (i=1; i<window; i++)
692 if (wstart-i < 0) break;
693 if (BN_is_bit_set(p,wstart-i))
701 /* wend is the size of the current window */
703 /* add the 'bytes above' */
707 if (!BN_mod_mul(r,r,r,m,ctx))
711 /* wvalue will be an odd number < 2^window */
712 if (!BN_mod_mul(r,r,&(val[wvalue>>1]),m,ctx))
715 /* move the 'window' down further */
719 if (wstart < 0) break;
725 BN_clear_free(&(val[i]));