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-2005 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).
112 #include "cryptlib.h"
113 #include "constant_time_locl.h"
120 # define alloca _alloca
122 #elif defined(__GNUC__)
124 # define alloca(s) __builtin_alloca((s))
128 /* maximum precomputation table size for *variable* sliding windows */
129 #define TABLE_SIZE 32
131 /* this one works - simple but works */
132 int BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
134 int i, bits, ret = 0;
137 if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0) {
138 /* BN_FLG_CONSTTIME only supported by BN_mod_exp_mont() */
139 BNerr(BN_F_BN_EXP, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);
144 if ((r == a) || (r == p))
145 rr = BN_CTX_get(ctx);
149 if (rr == NULL || v == NULL)
152 if (BN_copy(v, a) == NULL)
154 bits = BN_num_bits(p);
157 if (BN_copy(rr, a) == NULL)
164 for (i = 1; i < bits; i++) {
165 if (!BN_sqr(v, v, ctx))
167 if (BN_is_bit_set(p, i)) {
168 if (!BN_mul(rr, rr, v, ctx))
181 int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
191 * For even modulus m = 2^k*m_odd, it might make sense to compute
192 * a^p mod m_odd and a^p mod 2^k separately (with Montgomery
193 * exponentiation for the odd part), using appropriate exponent
194 * reductions, and combine the results using the CRT.
196 * For now, we use Montgomery only if the modulus is odd; otherwise,
197 * exponentiation using the reciprocal-based quick remaindering
200 * (Timing obtained with expspeed.c [computations a^p mod m
201 * where a, p, m are of the same length: 256, 512, 1024, 2048,
202 * 4096, 8192 bits], compared to the running time of the
203 * standard algorithm:
205 * BN_mod_exp_mont 33 .. 40 % [AMD K6-2, Linux, debug configuration]
206 * 55 .. 77 % [UltraSparc processor, but
207 * debug-solaris-sparcv8-gcc conf.]
209 * BN_mod_exp_recp 50 .. 70 % [AMD K6-2, Linux, debug configuration]
210 * 62 .. 118 % [UltraSparc, debug-solaris-sparcv8-gcc]
212 * On the Sparc, BN_mod_exp_recp was faster than BN_mod_exp_mont
213 * at 2048 and more bits, but at 512 and 1024 bits, it was
214 * slower even than the standard algorithm!
216 * "Real" timings [linux-elf, solaris-sparcv9-gcc configurations]
217 * should be obtained when the new Montgomery reduction code
218 * has been integrated into OpenSSL.)
222 #define MONT_EXP_WORD
227 * I have finally been able to take out this pre-condition of the top bit
228 * being set. It was caused by an error in BN_div with negatives. There
229 * was also another problem when for a^b%m a >= m. eay 07-May-97
231 /* if ((m->d[m->top-1]&BN_TBIT) && BN_is_odd(m)) */
234 # ifdef MONT_EXP_WORD
235 if (a->top == 1 && !a->neg
236 && (BN_get_flags(p, BN_FLG_CONSTTIME) == 0)) {
237 BN_ULONG A = a->d[0];
238 ret = BN_mod_exp_mont_word(r, A, p, m, ctx, NULL);
241 ret = BN_mod_exp_mont(r, a, p, m, ctx, NULL);
246 ret = BN_mod_exp_recp(r, a, p, m, ctx);
250 ret = BN_mod_exp_simple(r, a, p, m, ctx);
258 int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
259 const BIGNUM *m, BN_CTX *ctx)
261 int i, j, bits, ret = 0, wstart, wend, window, wvalue;
264 /* Table of variables obtained from 'ctx' */
265 BIGNUM *val[TABLE_SIZE];
268 if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0) {
269 /* BN_FLG_CONSTTIME only supported by BN_mod_exp_mont() */
270 BNerr(BN_F_BN_MOD_EXP_RECP, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);
274 bits = BN_num_bits(p);
276 /* x**0 mod 1 is still zero. */
287 aa = BN_CTX_get(ctx);
288 val[0] = BN_CTX_get(ctx);
292 BN_RECP_CTX_init(&recp);
294 /* ignore sign of 'm' */
298 if (BN_RECP_CTX_set(&recp, aa, ctx) <= 0)
301 if (BN_RECP_CTX_set(&recp, m, ctx) <= 0)
305 if (!BN_nnmod(val[0], a, m, ctx))
307 if (BN_is_zero(val[0])) {
313 window = BN_window_bits_for_exponent_size(bits);
315 if (!BN_mod_mul_reciprocal(aa, val[0], val[0], &recp, ctx))
317 j = 1 << (window - 1);
318 for (i = 1; i < j; i++) {
319 if (((val[i] = BN_CTX_get(ctx)) == NULL) ||
320 !BN_mod_mul_reciprocal(val[i], val[i - 1], aa, &recp, ctx))
325 start = 1; /* This is used to avoid multiplication etc
326 * when there is only the value '1' in the
328 wvalue = 0; /* The 'value' of the window */
329 wstart = bits - 1; /* The top bit of the window */
330 wend = 0; /* The bottom bit of the window */
336 if (BN_is_bit_set(p, wstart) == 0) {
338 if (!BN_mod_mul_reciprocal(r, r, r, &recp, ctx))
346 * We now have wstart on a 'set' bit, we now need to work out how bit
347 * a window to do. To do this we need to scan forward until the last
348 * set bit before the end of the window
353 for (i = 1; i < window; i++) {
356 if (BN_is_bit_set(p, wstart - i)) {
357 wvalue <<= (i - wend);
363 /* wend is the size of the current window */
365 /* add the 'bytes above' */
367 for (i = 0; i < j; i++) {
368 if (!BN_mod_mul_reciprocal(r, r, r, &recp, ctx))
372 /* wvalue will be an odd number < 2^window */
373 if (!BN_mod_mul_reciprocal(r, r, val[wvalue >> 1], &recp, ctx))
376 /* move the 'window' down further */
386 BN_RECP_CTX_free(&recp);
391 int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
392 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
394 int i, j, bits, ret = 0, wstart, wend, window, wvalue;
398 /* Table of variables obtained from 'ctx' */
399 BIGNUM *val[TABLE_SIZE];
400 BN_MONT_CTX *mont = NULL;
402 if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0) {
403 return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
411 BNerr(BN_F_BN_MOD_EXP_MONT, BN_R_CALLED_WITH_EVEN_MODULUS);
414 bits = BN_num_bits(p);
416 /* x**0 mod 1 is still zero. */
429 val[0] = BN_CTX_get(ctx);
430 if (!d || !r || !val[0])
434 * If this is not done, things will break in the montgomery part
440 if ((mont = BN_MONT_CTX_new()) == NULL)
442 if (!BN_MONT_CTX_set(mont, m, ctx))
446 if (a->neg || BN_ucmp(a, m) >= 0) {
447 if (!BN_nnmod(val[0], a, m, ctx))
452 if (BN_is_zero(aa)) {
457 if (!BN_to_montgomery(val[0], aa, mont, ctx))
460 window = BN_window_bits_for_exponent_size(bits);
462 if (!BN_mod_mul_montgomery(d, val[0], val[0], mont, ctx))
464 j = 1 << (window - 1);
465 for (i = 1; i < j; i++) {
466 if (((val[i] = BN_CTX_get(ctx)) == NULL) ||
467 !BN_mod_mul_montgomery(val[i], val[i - 1], d, mont, ctx))
472 start = 1; /* This is used to avoid multiplication etc
473 * when there is only the value '1' in the
475 wvalue = 0; /* The 'value' of the window */
476 wstart = bits - 1; /* The top bit of the window */
477 wend = 0; /* The bottom bit of the window */
479 if (!BN_to_montgomery(r, BN_value_one(), mont, ctx))
482 if (BN_is_bit_set(p, wstart) == 0) {
484 if (!BN_mod_mul_montgomery(r, r, r, mont, ctx))
493 * We now have wstart on a 'set' bit, we now need to work out how bit
494 * a window to do. To do this we need to scan forward until the last
495 * set bit before the end of the window
500 for (i = 1; i < window; i++) {
503 if (BN_is_bit_set(p, wstart - i)) {
504 wvalue <<= (i - wend);
510 /* wend is the size of the current window */
512 /* add the 'bytes above' */
514 for (i = 0; i < j; i++) {
515 if (!BN_mod_mul_montgomery(r, r, r, mont, ctx))
519 /* wvalue will be an odd number < 2^window */
520 if (!BN_mod_mul_montgomery(r, r, val[wvalue >> 1], mont, ctx))
523 /* move the 'window' down further */
530 if (!BN_from_montgomery(rr, r, mont, ctx))
534 if ((in_mont == NULL) && (mont != NULL))
535 BN_MONT_CTX_free(mont);
542 * BN_mod_exp_mont_consttime() stores the precomputed powers in a specific
543 * layout so that accessing any of these table values shows the same access
544 * pattern as far as cache lines are concerned. The following functions are
545 * used to transfer a BIGNUM from/to that table.
548 static int MOD_EXP_CTIME_COPY_TO_PREBUF(const BIGNUM *b, int top,
549 unsigned char *buf, int idx,
553 int width = 1 << window;
554 BN_ULONG *table = (BN_ULONG *)buf;
557 top = b->top; /* this works because 'buf' is explicitly
559 for (i = 0, j = idx; i < top; i++, j += width) {
566 static int MOD_EXP_CTIME_COPY_FROM_PREBUF(BIGNUM *b, int top,
567 unsigned char *buf, int idx,
571 int width = 1 << window;
572 volatile BN_ULONG *table = (volatile BN_ULONG *)buf;
574 if (bn_wexpand(b, top) == NULL)
578 for (i = 0; i < top; i++, table += width) {
581 for (j = 0; j < width; j++) {
583 ((BN_ULONG)0 - (constant_time_eq_int(j,idx)&1));
589 int xstride = 1 << (window - 2);
590 BN_ULONG y0, y1, y2, y3;
592 i = idx >> (window - 2); /* equivalent of idx / xstride */
593 idx &= xstride - 1; /* equivalent of idx % xstride */
595 y0 = (BN_ULONG)0 - (constant_time_eq_int(i,0)&1);
596 y1 = (BN_ULONG)0 - (constant_time_eq_int(i,1)&1);
597 y2 = (BN_ULONG)0 - (constant_time_eq_int(i,2)&1);
598 y3 = (BN_ULONG)0 - (constant_time_eq_int(i,3)&1);
600 for (i = 0; i < top; i++, table += width) {
603 for (j = 0; j < xstride; j++) {
604 acc |= ( (table[j + 0 * xstride] & y0) |
605 (table[j + 1 * xstride] & y1) |
606 (table[j + 2 * xstride] & y2) |
607 (table[j + 3 * xstride] & y3) )
608 & ((BN_ULONG)0 - (constant_time_eq_int(j,idx)&1));
621 * Given a pointer value, compute the next address that is a cache line
624 #define MOD_EXP_CTIME_ALIGN(x_) \
625 ((unsigned char*)(x_) + (MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH - (((size_t)(x_)) & (MOD_EXP_CTIME_MIN_CACHE_LINE_MASK))))
628 * This variant of BN_mod_exp_mont() uses fixed windows and the special
629 * precomputation memory layout to limit data-dependency to a minimum to
630 * protect secret exponents (cf. the hyper-threading timing attacks pointed
631 * out by Colin Percival,
632 * http://www.daemonology.net/hyperthreading-considered-harmful/)
634 int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
635 const BIGNUM *m, BN_CTX *ctx,
636 BN_MONT_CTX *in_mont)
638 int i, bits, ret = 0, window, wvalue;
640 BN_MONT_CTX *mont = NULL;
643 unsigned char *powerbufFree = NULL;
645 unsigned char *powerbuf = NULL;
653 BNerr(BN_F_BN_MOD_EXP_MONT_CONSTTIME, BN_R_CALLED_WITH_EVEN_MODULUS);
659 bits = BN_num_bits(p);
661 /* x**0 mod 1 is still zero. */
674 * Allocate a montgomery context if it was not supplied by the caller. If
675 * this is not done, things will break in the montgomery part.
680 if ((mont = BN_MONT_CTX_new()) == NULL)
682 if (!BN_MONT_CTX_set(mont, m, ctx))
686 /* Get the window size to use with size of p. */
687 window = BN_window_bits_for_ctime_exponent_size(bits);
688 #if defined(OPENSSL_BN_ASM_MONT5)
689 if (window == 6 && bits <= 1024)
690 window = 5; /* ~5% improvement of 2048-bit RSA sign */
694 * Allocate a buffer large enough to hold all of the pre-computed powers
695 * of am, am itself and tmp.
697 numPowers = 1 << window;
698 powerbufLen = sizeof(m->d[0]) * (top * numPowers +
700 numPowers ? (2 * top) : numPowers));
702 if (powerbufLen < 3072)
704 alloca(powerbufLen + MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH);
708 (unsigned char *)OPENSSL_malloc(powerbufLen +
709 MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH))
713 powerbuf = MOD_EXP_CTIME_ALIGN(powerbufFree);
714 memset(powerbuf, 0, powerbufLen);
717 if (powerbufLen < 3072)
721 /* lay down tmp and am right after powers table */
722 tmp.d = (BN_ULONG *)(powerbuf + sizeof(m->d[0]) * top * numPowers);
724 tmp.top = am.top = 0;
725 tmp.dmax = am.dmax = top;
726 tmp.neg = am.neg = 0;
727 tmp.flags = am.flags = BN_FLG_STATIC_DATA;
729 /* prepare a^0 in Montgomery domain */
731 if (!BN_to_montgomery(&tmp, BN_value_one(), mont, ctx))
734 tmp.d[0] = (0 - m->d[0]) & BN_MASK2; /* 2^(top*BN_BITS2) - m */
735 for (i = 1; i < top; i++)
736 tmp.d[i] = (~m->d[i]) & BN_MASK2;
740 /* prepare a^1 in Montgomery domain */
741 if (a->neg || BN_ucmp(a, m) >= 0) {
742 if (!BN_mod(&am, a, m, ctx))
744 if (!BN_to_montgomery(&am, &am, mont, ctx))
746 } else if (!BN_to_montgomery(&am, a, mont, ctx))
749 #if defined(OPENSSL_BN_ASM_MONT5)
750 if (window == 5 && top > 1) {
752 * This optimization uses ideas from http://eprint.iacr.org/2011/239,
753 * specifically optimization of cache-timing attack countermeasures
754 * and pre-computation optimization.
758 * Dedicated window==4 case improves 512-bit RSA sign by ~15%, but as
759 * 512-bit RSA is hardly relevant, we omit it to spare size...
761 void bn_mul_mont_gather5(BN_ULONG *rp, const BN_ULONG *ap,
762 const void *table, const BN_ULONG *np,
763 const BN_ULONG *n0, int num, int power);
764 void bn_scatter5(const BN_ULONG *inp, size_t num,
765 void *table, size_t power);
766 void bn_gather5(BN_ULONG *out, size_t num, void *table, size_t power);
768 BN_ULONG *np = mont->N.d, *n0 = mont->n0;
771 * BN_to_montgomery can contaminate words above .top [in
772 * BN_DEBUG[_DEBUG] build]...
774 for (i = am.top; i < top; i++)
776 for (i = tmp.top; i < top; i++)
779 bn_scatter5(tmp.d, top, powerbuf, 0);
780 bn_scatter5(am.d, am.top, powerbuf, 1);
781 bn_mul_mont(tmp.d, am.d, am.d, np, n0, top);
782 bn_scatter5(tmp.d, top, powerbuf, 2);
785 for (i = 3; i < 32; i++) {
786 /* Calculate a^i = a^(i-1) * a */
787 bn_mul_mont_gather5(tmp.d, am.d, powerbuf, np, n0, top, i - 1);
788 bn_scatter5(tmp.d, top, powerbuf, i);
791 /* same as above, but uses squaring for 1/2 of operations */
792 for (i = 4; i < 32; i *= 2) {
793 bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top);
794 bn_scatter5(tmp.d, top, powerbuf, i);
796 for (i = 3; i < 8; i += 2) {
798 bn_mul_mont_gather5(tmp.d, am.d, powerbuf, np, n0, top, i - 1);
799 bn_scatter5(tmp.d, top, powerbuf, i);
800 for (j = 2 * i; j < 32; j *= 2) {
801 bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top);
802 bn_scatter5(tmp.d, top, powerbuf, j);
805 for (; i < 16; i += 2) {
806 bn_mul_mont_gather5(tmp.d, am.d, powerbuf, np, n0, top, i - 1);
807 bn_scatter5(tmp.d, top, powerbuf, i);
808 bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top);
809 bn_scatter5(tmp.d, top, powerbuf, 2 * i);
811 for (; i < 32; i += 2) {
812 bn_mul_mont_gather5(tmp.d, am.d, powerbuf, np, n0, top, i - 1);
813 bn_scatter5(tmp.d, top, powerbuf, i);
817 for (wvalue = 0, i = bits % 5; i >= 0; i--, bits--)
818 wvalue = (wvalue << 1) + BN_is_bit_set(p, bits);
819 bn_gather5(tmp.d, top, powerbuf, wvalue);
822 * Scan the exponent one window at a time starting from the most
826 for (wvalue = 0, i = 0; i < 5; i++, bits--)
827 wvalue = (wvalue << 1) + BN_is_bit_set(p, bits);
829 bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top);
830 bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top);
831 bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top);
832 bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top);
833 bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top);
834 bn_mul_mont_gather5(tmp.d, tmp.d, powerbuf, np, n0, top, wvalue);
838 bn_correct_top(&tmp);
842 if (!MOD_EXP_CTIME_COPY_TO_PREBUF(&tmp, top, powerbuf, 0, window))
844 if (!MOD_EXP_CTIME_COPY_TO_PREBUF(&am, top, powerbuf, 1, window))
848 * If the window size is greater than 1, then calculate
849 * val[i=2..2^winsize-1]. Powers are computed as a*a^(i-1) (even
850 * powers could instead be computed as (a^(i/2))^2 to use the slight
851 * performance advantage of sqr over mul).
854 if (!BN_mod_mul_montgomery(&tmp, &am, &am, mont, ctx))
856 if (!MOD_EXP_CTIME_COPY_TO_PREBUF(&tmp, top, powerbuf, 2,
859 for (i = 3; i < numPowers; i++) {
860 /* Calculate a^i = a^(i-1) * a */
861 if (!BN_mod_mul_montgomery(&tmp, &am, &tmp, mont, ctx))
863 if (!MOD_EXP_CTIME_COPY_TO_PREBUF(&tmp, top, powerbuf, i,
870 for (wvalue = 0, i = bits % window; i >= 0; i--, bits--)
871 wvalue = (wvalue << 1) + BN_is_bit_set(p, bits);
872 if (!MOD_EXP_CTIME_COPY_FROM_PREBUF(&tmp, top, powerbuf, wvalue,
877 * Scan the exponent one window at a time starting from the most
881 wvalue = 0; /* The 'value' of the window */
883 /* Scan the window, squaring the result as we go */
884 for (i = 0; i < window; i++, bits--) {
885 if (!BN_mod_mul_montgomery(&tmp, &tmp, &tmp, mont, ctx))
887 wvalue = (wvalue << 1) + BN_is_bit_set(p, bits);
891 * Fetch the appropriate pre-computed value from the pre-buf
893 if (!MOD_EXP_CTIME_COPY_FROM_PREBUF(&am, top, powerbuf, wvalue,
897 /* Multiply the result into the intermediate result */
898 if (!BN_mod_mul_montgomery(&tmp, &tmp, &am, mont, ctx))
903 /* Convert the final result from montgomery to standard format */
904 if (!BN_from_montgomery(rr, &tmp, mont, ctx))
908 if ((in_mont == NULL) && (mont != NULL))
909 BN_MONT_CTX_free(mont);
910 if (powerbuf != NULL) {
911 OPENSSL_cleanse(powerbuf, powerbufLen);
913 OPENSSL_free(powerbufFree);
919 int BN_mod_exp_mont_word(BIGNUM *rr, BN_ULONG a, const BIGNUM *p,
920 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
922 BN_MONT_CTX *mont = NULL;
923 int b, bits, ret = 0;
928 #define BN_MOD_MUL_WORD(r, w, m) \
929 (BN_mul_word(r, (w)) && \
930 (/* BN_ucmp(r, (m)) < 0 ? 1 :*/ \
931 (BN_mod(t, r, m, ctx) && (swap_tmp = r, r = t, t = swap_tmp, 1))))
933 * BN_MOD_MUL_WORD is only used with 'w' large, so the BN_ucmp test is
934 * probably more overhead than always using BN_mod (which uses BN_copy if
935 * a similar test returns true).
938 * We can use BN_mod and do not need BN_nnmod because our accumulator is
939 * never negative (the result of BN_mod does not depend on the sign of
942 #define BN_TO_MONTGOMERY_WORD(r, w, mont) \
943 (BN_set_word(r, (w)) && BN_to_montgomery(r, r, (mont), ctx))
945 if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0) {
946 /* BN_FLG_CONSTTIME only supported by BN_mod_exp_mont() */
947 BNerr(BN_F_BN_MOD_EXP_MONT_WORD, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);
955 BNerr(BN_F_BN_MOD_EXP_MONT_WORD, BN_R_CALLED_WITH_EVEN_MODULUS);
959 a %= m->d[0]; /* make sure that 'a' is reduced */
961 bits = BN_num_bits(p);
963 /* x**0 mod 1 is still zero. */
982 if (d == NULL || r == NULL || t == NULL)
988 if ((mont = BN_MONT_CTX_new()) == NULL)
990 if (!BN_MONT_CTX_set(mont, m, ctx))
994 r_is_one = 1; /* except for Montgomery factor */
998 /* The result is accumulated in the product r*w. */
999 w = a; /* bit 'bits-1' of 'p' is always set */
1000 for (b = bits - 2; b >= 0; b--) {
1001 /* First, square r*w. */
1003 if ((next_w / w) != w) { /* overflow */
1005 if (!BN_TO_MONTGOMERY_WORD(r, w, mont))
1009 if (!BN_MOD_MUL_WORD(r, w, m))
1016 if (!BN_mod_mul_montgomery(r, r, r, mont, ctx))
1020 /* Second, multiply r*w by 'a' if exponent bit is set. */
1021 if (BN_is_bit_set(p, b)) {
1023 if ((next_w / a) != w) { /* overflow */
1025 if (!BN_TO_MONTGOMERY_WORD(r, w, mont))
1029 if (!BN_MOD_MUL_WORD(r, w, m))
1038 /* Finally, set r:=r*w. */
1041 if (!BN_TO_MONTGOMERY_WORD(r, w, mont))
1045 if (!BN_MOD_MUL_WORD(r, w, m))
1050 if (r_is_one) { /* can happen only if a == 1 */
1054 if (!BN_from_montgomery(rr, r, mont, ctx))
1059 if ((in_mont == NULL) && (mont != NULL))
1060 BN_MONT_CTX_free(mont);
1066 /* The old fallback, simple version :-) */
1067 int BN_mod_exp_simple(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
1068 const BIGNUM *m, BN_CTX *ctx)
1070 int i, j, bits, ret = 0, wstart, wend, window, wvalue;
1073 /* Table of variables obtained from 'ctx' */
1074 BIGNUM *val[TABLE_SIZE];
1076 if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0) {
1077 /* BN_FLG_CONSTTIME only supported by BN_mod_exp_mont() */
1078 BNerr(BN_F_BN_MOD_EXP_SIMPLE, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);
1082 bits = BN_num_bits(p);
1084 /* x**0 mod 1 is still zero. */
1095 d = BN_CTX_get(ctx);
1096 val[0] = BN_CTX_get(ctx);
1100 if (!BN_nnmod(val[0], a, m, ctx))
1102 if (BN_is_zero(val[0])) {
1108 window = BN_window_bits_for_exponent_size(bits);
1110 if (!BN_mod_mul(d, val[0], val[0], m, ctx))
1112 j = 1 << (window - 1);
1113 for (i = 1; i < j; i++) {
1114 if (((val[i] = BN_CTX_get(ctx)) == NULL) ||
1115 !BN_mod_mul(val[i], val[i - 1], d, m, ctx))
1120 start = 1; /* This is used to avoid multiplication etc
1121 * when there is only the value '1' in the
1123 wvalue = 0; /* The 'value' of the window */
1124 wstart = bits - 1; /* The top bit of the window */
1125 wend = 0; /* The bottom bit of the window */
1131 if (BN_is_bit_set(p, wstart) == 0) {
1133 if (!BN_mod_mul(r, r, r, m, ctx))
1141 * We now have wstart on a 'set' bit, we now need to work out how bit
1142 * a window to do. To do this we need to scan forward until the last
1143 * set bit before the end of the window
1148 for (i = 1; i < window; i++) {
1151 if (BN_is_bit_set(p, wstart - i)) {
1152 wvalue <<= (i - wend);
1158 /* wend is the size of the current window */
1160 /* add the 'bytes above' */
1162 for (i = 0; i < j; i++) {
1163 if (!BN_mod_mul(r, r, r, m, ctx))
1167 /* wvalue will be an odd number < 2^window */
1168 if (!BN_mod_mul(r, r, val[wvalue >> 1], m, ctx))
1171 /* move the 'window' down further */