2 * Copyright 1995-2018 The OpenSSL Project Authors. All Rights Reserved.
4 * Licensed under the OpenSSL license (the "License"). You may not use
5 * this file except in compliance with the License. You can obtain a copy
6 * in the file LICENSE in the source distribution or at
7 * https://www.openssl.org/source/license.html
10 #include "internal/cryptlib.h"
11 #include "internal/constant_time_locl.h"
18 # define alloca _alloca
20 #elif defined(__GNUC__)
22 # define alloca(s) __builtin_alloca((s))
31 #if defined(OPENSSL_BN_ASM_MONT) && (defined(__sparc__) || defined(__sparc))
32 # include "sparc_arch.h"
33 extern unsigned int OPENSSL_sparcv9cap_P[];
34 # define SPARC_T4_MONT
37 /* maximum precomputation table size for *variable* sliding windows */
40 /* this one works - simple but works */
41 int BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
46 if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0
47 || BN_get_flags(a, BN_FLG_CONSTTIME) != 0) {
48 /* BN_FLG_CONSTTIME only supported by BN_mod_exp_mont() */
49 BNerr(BN_F_BN_EXP, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);
54 rr = ((r == a) || (r == p)) ? BN_CTX_get(ctx) : r;
56 if (rr == NULL || v == NULL)
59 if (BN_copy(v, a) == NULL)
61 bits = BN_num_bits(p);
64 if (BN_copy(rr, a) == NULL)
71 for (i = 1; i < bits; i++) {
72 if (!BN_sqr(v, v, ctx))
74 if (BN_is_bit_set(p, i)) {
75 if (!BN_mul(rr, rr, v, ctx))
79 if (r != rr && BN_copy(r, rr) == NULL)
89 int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
99 * For even modulus m = 2^k*m_odd, it might make sense to compute
100 * a^p mod m_odd and a^p mod 2^k separately (with Montgomery
101 * exponentiation for the odd part), using appropriate exponent
102 * reductions, and combine the results using the CRT.
104 * For now, we use Montgomery only if the modulus is odd; otherwise,
105 * exponentiation using the reciprocal-based quick remaindering
108 * (Timing obtained with expspeed.c [computations a^p mod m
109 * where a, p, m are of the same length: 256, 512, 1024, 2048,
110 * 4096, 8192 bits], compared to the running time of the
111 * standard algorithm:
113 * BN_mod_exp_mont 33 .. 40 % [AMD K6-2, Linux, debug configuration]
114 * 55 .. 77 % [UltraSparc processor, but
115 * debug-solaris-sparcv8-gcc conf.]
117 * BN_mod_exp_recp 50 .. 70 % [AMD K6-2, Linux, debug configuration]
118 * 62 .. 118 % [UltraSparc, debug-solaris-sparcv8-gcc]
120 * On the Sparc, BN_mod_exp_recp was faster than BN_mod_exp_mont
121 * at 2048 and more bits, but at 512 and 1024 bits, it was
122 * slower even than the standard algorithm!
124 * "Real" timings [linux-elf, solaris-sparcv9-gcc configurations]
125 * should be obtained when the new Montgomery reduction code
126 * has been integrated into OpenSSL.)
130 #define MONT_EXP_WORD
135 # ifdef MONT_EXP_WORD
136 if (a->top == 1 && !a->neg
137 && (BN_get_flags(p, BN_FLG_CONSTTIME) == 0)
138 && (BN_get_flags(a, BN_FLG_CONSTTIME) == 0)
139 && (BN_get_flags(m, BN_FLG_CONSTTIME) == 0)) {
140 BN_ULONG A = a->d[0];
141 ret = BN_mod_exp_mont_word(r, A, p, m, ctx, NULL);
144 ret = BN_mod_exp_mont(r, a, p, m, ctx, NULL);
149 ret = BN_mod_exp_recp(r, a, p, m, ctx);
153 ret = BN_mod_exp_simple(r, a, p, m, ctx);
161 int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
162 const BIGNUM *m, BN_CTX *ctx)
164 int i, j, bits, ret = 0, wstart, wend, window, wvalue;
167 /* Table of variables obtained from 'ctx' */
168 BIGNUM *val[TABLE_SIZE];
171 if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0
172 || BN_get_flags(a, BN_FLG_CONSTTIME) != 0
173 || BN_get_flags(m, BN_FLG_CONSTTIME) != 0) {
174 /* BN_FLG_CONSTTIME only supported by BN_mod_exp_mont() */
175 BNerr(BN_F_BN_MOD_EXP_RECP, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);
179 bits = BN_num_bits(p);
181 /* x**0 mod 1, or x**0 mod -1 is still zero. */
182 if (BN_abs_is_word(m, 1)) {
192 aa = BN_CTX_get(ctx);
193 val[0] = BN_CTX_get(ctx);
197 BN_RECP_CTX_init(&recp);
199 /* ignore sign of 'm' */
203 if (BN_RECP_CTX_set(&recp, aa, ctx) <= 0)
206 if (BN_RECP_CTX_set(&recp, m, ctx) <= 0)
210 if (!BN_nnmod(val[0], a, m, ctx))
212 if (BN_is_zero(val[0])) {
218 window = BN_window_bits_for_exponent_size(bits);
220 if (!BN_mod_mul_reciprocal(aa, val[0], val[0], &recp, ctx))
222 j = 1 << (window - 1);
223 for (i = 1; i < j; i++) {
224 if (((val[i] = BN_CTX_get(ctx)) == NULL) ||
225 !BN_mod_mul_reciprocal(val[i], val[i - 1], aa, &recp, ctx))
230 start = 1; /* This is used to avoid multiplication etc
231 * when there is only the value '1' in the
233 wvalue = 0; /* The 'value' of the window */
234 wstart = bits - 1; /* The top bit of the window */
235 wend = 0; /* The bottom bit of the window */
241 if (BN_is_bit_set(p, wstart) == 0) {
243 if (!BN_mod_mul_reciprocal(r, r, r, &recp, ctx))
251 * We now have wstart on a 'set' bit, we now need to work out how bit
252 * a window to do. To do this we need to scan forward until the last
253 * set bit before the end of the window
258 for (i = 1; i < window; i++) {
261 if (BN_is_bit_set(p, wstart - i)) {
262 wvalue <<= (i - wend);
268 /* wend is the size of the current window */
270 /* add the 'bytes above' */
272 for (i = 0; i < j; i++) {
273 if (!BN_mod_mul_reciprocal(r, r, r, &recp, ctx))
277 /* wvalue will be an odd number < 2^window */
278 if (!BN_mod_mul_reciprocal(r, r, val[wvalue >> 1], &recp, ctx))
281 /* move the 'window' down further */
291 BN_RECP_CTX_free(&recp);
296 int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
297 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
299 int i, j, bits, ret = 0, wstart, wend, window, wvalue;
303 /* Table of variables obtained from 'ctx' */
304 BIGNUM *val[TABLE_SIZE];
305 BN_MONT_CTX *mont = NULL;
307 if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0
308 || BN_get_flags(a, BN_FLG_CONSTTIME) != 0
309 || BN_get_flags(m, BN_FLG_CONSTTIME) != 0) {
310 return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
318 BNerr(BN_F_BN_MOD_EXP_MONT, BN_R_CALLED_WITH_EVEN_MODULUS);
321 bits = BN_num_bits(p);
323 /* x**0 mod 1, or x**0 mod -1 is still zero. */
324 if (BN_abs_is_word(m, 1)) {
336 val[0] = BN_CTX_get(ctx);
341 * If this is not done, things will break in the montgomery part
347 if ((mont = BN_MONT_CTX_new()) == NULL)
349 if (!BN_MONT_CTX_set(mont, m, ctx))
353 if (a->neg || BN_ucmp(a, m) >= 0) {
354 if (!BN_nnmod(val[0], a, m, ctx))
359 if (BN_is_zero(aa)) {
364 if (!BN_to_montgomery(val[0], aa, mont, ctx))
367 window = BN_window_bits_for_exponent_size(bits);
369 if (!BN_mod_mul_montgomery(d, val[0], val[0], mont, ctx))
371 j = 1 << (window - 1);
372 for (i = 1; i < j; i++) {
373 if (((val[i] = BN_CTX_get(ctx)) == NULL) ||
374 !BN_mod_mul_montgomery(val[i], val[i - 1], d, mont, ctx))
379 start = 1; /* This is used to avoid multiplication etc
380 * when there is only the value '1' in the
382 wvalue = 0; /* The 'value' of the window */
383 wstart = bits - 1; /* The top bit of the window */
384 wend = 0; /* The bottom bit of the window */
386 #if 1 /* by Shay Gueron's suggestion */
387 j = m->top; /* borrow j */
388 if (m->d[j - 1] & (((BN_ULONG)1) << (BN_BITS2 - 1))) {
389 if (bn_wexpand(r, j) == NULL)
391 /* 2^(top*BN_BITS2) - m */
392 r->d[0] = (0 - m->d[0]) & BN_MASK2;
393 for (i = 1; i < j; i++)
394 r->d[i] = (~m->d[i]) & BN_MASK2;
397 * Upper words will be zero if the corresponding words of 'm' were
398 * 0xfff[...], so decrement r->top accordingly.
403 if (!BN_to_montgomery(r, BN_value_one(), mont, ctx))
406 if (BN_is_bit_set(p, wstart) == 0) {
408 if (!BN_mod_mul_montgomery(r, r, r, mont, ctx))
417 * We now have wstart on a 'set' bit, we now need to work out how bit
418 * a window to do. To do this we need to scan forward until the last
419 * set bit before the end of the window
424 for (i = 1; i < window; i++) {
427 if (BN_is_bit_set(p, wstart - i)) {
428 wvalue <<= (i - wend);
434 /* wend is the size of the current window */
436 /* add the 'bytes above' */
438 for (i = 0; i < j; i++) {
439 if (!BN_mod_mul_montgomery(r, r, r, mont, ctx))
443 /* wvalue will be an odd number < 2^window */
444 if (!BN_mod_mul_montgomery(r, r, val[wvalue >> 1], mont, ctx))
447 /* move the 'window' down further */
454 #if defined(SPARC_T4_MONT)
455 if (OPENSSL_sparcv9cap_P[0] & (SPARCV9_VIS3 | SPARCV9_PREFER_FPU)) {
456 j = mont->N.top; /* borrow j */
457 val[0]->d[0] = 1; /* borrow val[0] */
458 for (i = 1; i < j; i++)
461 if (!BN_mod_mul_montgomery(rr, r, val[0], mont, ctx))
465 if (!BN_from_montgomery(rr, r, mont, ctx))
470 BN_MONT_CTX_free(mont);
476 static BN_ULONG bn_get_bits(const BIGNUM *a, int bitpos)
481 wordpos = bitpos / BN_BITS2;
483 if (wordpos >= 0 && wordpos < a->top) {
484 ret = a->d[wordpos] & BN_MASK2;
487 if (++wordpos < a->top)
488 ret |= a->d[wordpos] << (BN_BITS2 - bitpos);
492 return ret & BN_MASK2;
496 * BN_mod_exp_mont_consttime() stores the precomputed powers in a specific
497 * layout so that accessing any of these table values shows the same access
498 * pattern as far as cache lines are concerned. The following functions are
499 * used to transfer a BIGNUM from/to that table.
502 static int MOD_EXP_CTIME_COPY_TO_PREBUF(const BIGNUM *b, int top,
503 unsigned char *buf, int idx,
507 int width = 1 << window;
508 BN_ULONG *table = (BN_ULONG *)buf;
511 top = b->top; /* this works because 'buf' is explicitly
513 for (i = 0, j = idx; i < top; i++, j += width) {
520 static int MOD_EXP_CTIME_COPY_FROM_PREBUF(BIGNUM *b, int top,
521 unsigned char *buf, int idx,
525 int width = 1 << window;
527 * We declare table 'volatile' in order to discourage compiler
528 * from reordering loads from the table. Concern is that if
529 * reordered in specific manner loads might give away the
530 * information we are trying to conceal. Some would argue that
531 * compiler can reorder them anyway, but it can as well be
532 * argued that doing so would be violation of standard...
534 volatile BN_ULONG *table = (volatile BN_ULONG *)buf;
536 if (bn_wexpand(b, top) == NULL)
540 for (i = 0; i < top; i++, table += width) {
543 for (j = 0; j < width; j++) {
545 ((BN_ULONG)0 - (constant_time_eq_int(j,idx)&1));
551 int xstride = 1 << (window - 2);
552 BN_ULONG y0, y1, y2, y3;
554 i = idx >> (window - 2); /* equivalent of idx / xstride */
555 idx &= xstride - 1; /* equivalent of idx % xstride */
557 y0 = (BN_ULONG)0 - (constant_time_eq_int(i,0)&1);
558 y1 = (BN_ULONG)0 - (constant_time_eq_int(i,1)&1);
559 y2 = (BN_ULONG)0 - (constant_time_eq_int(i,2)&1);
560 y3 = (BN_ULONG)0 - (constant_time_eq_int(i,3)&1);
562 for (i = 0; i < top; i++, table += width) {
565 for (j = 0; j < xstride; j++) {
566 acc |= ( (table[j + 0 * xstride] & y0) |
567 (table[j + 1 * xstride] & y1) |
568 (table[j + 2 * xstride] & y2) |
569 (table[j + 3 * xstride] & y3) )
570 & ((BN_ULONG)0 - (constant_time_eq_int(j,idx)&1));
583 * Given a pointer value, compute the next address that is a cache line
586 #define MOD_EXP_CTIME_ALIGN(x_) \
587 ((unsigned char*)(x_) + (MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH - (((size_t)(x_)) & (MOD_EXP_CTIME_MIN_CACHE_LINE_MASK))))
590 * This variant of BN_mod_exp_mont() uses fixed windows and the special
591 * precomputation memory layout to limit data-dependency to a minimum to
592 * protect secret exponents (cf. the hyper-threading timing attacks pointed
593 * out by Colin Percival,
594 * http://www.daemonology.net/hyperthreading-considered-harmful/)
596 int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
597 const BIGNUM *m, BN_CTX *ctx,
598 BN_MONT_CTX *in_mont)
600 int i, bits, ret = 0, window, wvalue, wmask, window0;
602 BN_MONT_CTX *mont = NULL;
605 unsigned char *powerbufFree = NULL;
607 unsigned char *powerbuf = NULL;
609 #if defined(SPARC_T4_MONT)
618 BNerr(BN_F_BN_MOD_EXP_MONT_CONSTTIME, BN_R_CALLED_WITH_EVEN_MODULUS);
625 * Use all bits stored in |p|, rather than |BN_num_bits|, so we do not leak
626 * whether the top bits are zero.
628 bits = p->top * BN_BITS2;
630 /* x**0 mod 1, or x**0 mod -1 is still zero. */
631 if (BN_abs_is_word(m, 1)) {
643 * Allocate a montgomery context if it was not supplied by the caller. If
644 * this is not done, things will break in the montgomery part.
649 if ((mont = BN_MONT_CTX_new()) == NULL)
651 if (!BN_MONT_CTX_set(mont, m, ctx))
658 * If the size of the operands allow it, perform the optimized
659 * RSAZ exponentiation. For further information see
660 * crypto/bn/rsaz_exp.c and accompanying assembly modules.
662 if ((16 == a->top) && (16 == p->top) && (BN_num_bits(m) == 1024)
663 && rsaz_avx2_eligible()) {
664 if (NULL == bn_wexpand(rr, 16))
666 RSAZ_1024_mod_exp_avx2(rr->d, a->d, p->d, m->d, mont->RR.d,
673 } else if ((8 == a->top) && (8 == p->top) && (BN_num_bits(m) == 512)) {
674 if (NULL == bn_wexpand(rr, 8))
676 RSAZ_512_mod_exp(rr->d, a->d, p->d, m->d, mont->n0[0], mont->RR.d);
686 /* Get the window size to use with size of p. */
687 window = BN_window_bits_for_ctime_exponent_size(bits);
688 #if defined(SPARC_T4_MONT)
689 if (window >= 5 && (top & 15) == 0 && top <= 64 &&
690 (OPENSSL_sparcv9cap_P[1] & (CFR_MONTMUL | CFR_MONTSQR)) ==
691 (CFR_MONTMUL | CFR_MONTSQR) && (t4 = OPENSSL_sparcv9cap_P[0]))
695 #if defined(OPENSSL_BN_ASM_MONT5)
697 window = 5; /* ~5% improvement for RSA2048 sign, and even
699 /* reserve space for mont->N.d[] copy */
700 powerbufLen += top * sizeof(mont->N.d[0]);
706 * Allocate a buffer large enough to hold all of the pre-computed powers
707 * of am, am itself and tmp.
709 numPowers = 1 << window;
710 powerbufLen += sizeof(m->d[0]) * (top * numPowers +
712 numPowers ? (2 * top) : numPowers));
714 if (powerbufLen < 3072)
716 alloca(powerbufLen + MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH);
720 OPENSSL_malloc(powerbufLen + MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH))
724 powerbuf = MOD_EXP_CTIME_ALIGN(powerbufFree);
725 memset(powerbuf, 0, powerbufLen);
728 if (powerbufLen < 3072)
732 /* lay down tmp and am right after powers table */
733 tmp.d = (BN_ULONG *)(powerbuf + sizeof(m->d[0]) * top * numPowers);
735 tmp.top = am.top = 0;
736 tmp.dmax = am.dmax = top;
737 tmp.neg = am.neg = 0;
738 tmp.flags = am.flags = BN_FLG_STATIC_DATA;
740 /* prepare a^0 in Montgomery domain */
741 #if 1 /* by Shay Gueron's suggestion */
742 if (m->d[top - 1] & (((BN_ULONG)1) << (BN_BITS2 - 1))) {
743 /* 2^(top*BN_BITS2) - m */
744 tmp.d[0] = (0 - m->d[0]) & BN_MASK2;
745 for (i = 1; i < top; i++)
746 tmp.d[i] = (~m->d[i]) & BN_MASK2;
750 if (!BN_to_montgomery(&tmp, BN_value_one(), mont, ctx))
753 /* prepare a^1 in Montgomery domain */
754 if (a->neg || BN_ucmp(a, m) >= 0) {
755 if (!BN_nnmod(&am, a, m, ctx))
757 if (!BN_to_montgomery(&am, &am, mont, ctx))
759 } else if (!BN_to_montgomery(&am, a, mont, ctx))
762 #if defined(SPARC_T4_MONT)
764 typedef int (*bn_pwr5_mont_f) (BN_ULONG *tp, const BN_ULONG *np,
765 const BN_ULONG *n0, const void *table,
766 int power, int bits);
767 int bn_pwr5_mont_t4_8(BN_ULONG *tp, const BN_ULONG *np,
768 const BN_ULONG *n0, const void *table,
769 int power, int bits);
770 int bn_pwr5_mont_t4_16(BN_ULONG *tp, const BN_ULONG *np,
771 const BN_ULONG *n0, const void *table,
772 int power, int bits);
773 int bn_pwr5_mont_t4_24(BN_ULONG *tp, const BN_ULONG *np,
774 const BN_ULONG *n0, const void *table,
775 int power, int bits);
776 int bn_pwr5_mont_t4_32(BN_ULONG *tp, const BN_ULONG *np,
777 const BN_ULONG *n0, const void *table,
778 int power, int bits);
779 static const bn_pwr5_mont_f pwr5_funcs[4] = {
780 bn_pwr5_mont_t4_8, bn_pwr5_mont_t4_16,
781 bn_pwr5_mont_t4_24, bn_pwr5_mont_t4_32
783 bn_pwr5_mont_f pwr5_worker = pwr5_funcs[top / 16 - 1];
785 typedef int (*bn_mul_mont_f) (BN_ULONG *rp, const BN_ULONG *ap,
786 const void *bp, const BN_ULONG *np,
788 int bn_mul_mont_t4_8(BN_ULONG *rp, const BN_ULONG *ap, const void *bp,
789 const BN_ULONG *np, const BN_ULONG *n0);
790 int bn_mul_mont_t4_16(BN_ULONG *rp, const BN_ULONG *ap,
791 const void *bp, const BN_ULONG *np,
793 int bn_mul_mont_t4_24(BN_ULONG *rp, const BN_ULONG *ap,
794 const void *bp, const BN_ULONG *np,
796 int bn_mul_mont_t4_32(BN_ULONG *rp, const BN_ULONG *ap,
797 const void *bp, const BN_ULONG *np,
799 static const bn_mul_mont_f mul_funcs[4] = {
800 bn_mul_mont_t4_8, bn_mul_mont_t4_16,
801 bn_mul_mont_t4_24, bn_mul_mont_t4_32
803 bn_mul_mont_f mul_worker = mul_funcs[top / 16 - 1];
805 void bn_mul_mont_vis3(BN_ULONG *rp, const BN_ULONG *ap,
806 const void *bp, const BN_ULONG *np,
807 const BN_ULONG *n0, int num);
808 void bn_mul_mont_t4(BN_ULONG *rp, const BN_ULONG *ap,
809 const void *bp, const BN_ULONG *np,
810 const BN_ULONG *n0, int num);
811 void bn_mul_mont_gather5_t4(BN_ULONG *rp, const BN_ULONG *ap,
812 const void *table, const BN_ULONG *np,
813 const BN_ULONG *n0, int num, int power);
814 void bn_flip_n_scatter5_t4(const BN_ULONG *inp, size_t num,
815 void *table, size_t power);
816 void bn_gather5_t4(BN_ULONG *out, size_t num,
817 void *table, size_t power);
818 void bn_flip_t4(BN_ULONG *dst, BN_ULONG *src, size_t num);
820 BN_ULONG *np = mont->N.d, *n0 = mont->n0;
821 int stride = 5 * (6 - (top / 16 - 1)); /* multiple of 5, but less
825 * BN_to_montgomery can contaminate words above .top [in
826 * BN_DEBUG[_DEBUG] build]...
828 for (i = am.top; i < top; i++)
830 for (i = tmp.top; i < top; i++)
833 bn_flip_n_scatter5_t4(tmp.d, top, powerbuf, 0);
834 bn_flip_n_scatter5_t4(am.d, top, powerbuf, 1);
835 if (!(*mul_worker) (tmp.d, am.d, am.d, np, n0) &&
836 !(*mul_worker) (tmp.d, am.d, am.d, np, n0))
837 bn_mul_mont_vis3(tmp.d, am.d, am.d, np, n0, top);
838 bn_flip_n_scatter5_t4(tmp.d, top, powerbuf, 2);
840 for (i = 3; i < 32; i++) {
841 /* Calculate a^i = a^(i-1) * a */
842 if (!(*mul_worker) (tmp.d, tmp.d, am.d, np, n0) &&
843 !(*mul_worker) (tmp.d, tmp.d, am.d, np, n0))
844 bn_mul_mont_vis3(tmp.d, tmp.d, am.d, np, n0, top);
845 bn_flip_n_scatter5_t4(tmp.d, top, powerbuf, i);
848 /* switch to 64-bit domain */
849 np = alloca(top * sizeof(BN_ULONG));
851 bn_flip_t4(np, mont->N.d, top);
854 for (wvalue = 0, i = bits % 5; i >= 0; i--, bits--)
855 wvalue = (wvalue << 1) + BN_is_bit_set(p, bits);
856 bn_gather5_t4(tmp.d, top, powerbuf, wvalue);
859 * Scan the exponent one window at a time starting from the most
866 wvalue = bn_get_bits(p, bits + 1);
868 if ((*pwr5_worker) (tmp.d, np, n0, powerbuf, wvalue, stride))
870 /* retry once and fall back */
871 if ((*pwr5_worker) (tmp.d, np, n0, powerbuf, wvalue, stride))
875 wvalue >>= stride - 5;
877 bn_mul_mont_t4(tmp.d, tmp.d, tmp.d, np, n0, top);
878 bn_mul_mont_t4(tmp.d, tmp.d, tmp.d, np, n0, top);
879 bn_mul_mont_t4(tmp.d, tmp.d, tmp.d, np, n0, top);
880 bn_mul_mont_t4(tmp.d, tmp.d, tmp.d, np, n0, top);
881 bn_mul_mont_t4(tmp.d, tmp.d, tmp.d, np, n0, top);
882 bn_mul_mont_gather5_t4(tmp.d, tmp.d, powerbuf, np, n0, top,
886 bn_flip_t4(tmp.d, tmp.d, top);
888 /* back to 32-bit domain */
890 bn_correct_top(&tmp);
891 OPENSSL_cleanse(np, top * sizeof(BN_ULONG));
894 #if defined(OPENSSL_BN_ASM_MONT5)
895 if (window == 5 && top > 1) {
897 * This optimization uses ideas from http://eprint.iacr.org/2011/239,
898 * specifically optimization of cache-timing attack countermeasures
899 * and pre-computation optimization.
903 * Dedicated window==4 case improves 512-bit RSA sign by ~15%, but as
904 * 512-bit RSA is hardly relevant, we omit it to spare size...
906 void bn_mul_mont_gather5(BN_ULONG *rp, const BN_ULONG *ap,
907 const void *table, const BN_ULONG *np,
908 const BN_ULONG *n0, int num, int power);
909 void bn_scatter5(const BN_ULONG *inp, size_t num,
910 void *table, size_t power);
911 void bn_gather5(BN_ULONG *out, size_t num, void *table, size_t power);
912 void bn_power5(BN_ULONG *rp, const BN_ULONG *ap,
913 const void *table, const BN_ULONG *np,
914 const BN_ULONG *n0, int num, int power);
915 int bn_get_bits5(const BN_ULONG *ap, int off);
916 int bn_from_montgomery(BN_ULONG *rp, const BN_ULONG *ap,
917 const BN_ULONG *not_used, const BN_ULONG *np,
918 const BN_ULONG *n0, int num);
920 BN_ULONG *n0 = mont->n0, *np;
923 * BN_to_montgomery can contaminate words above .top [in
924 * BN_DEBUG[_DEBUG] build]...
926 for (i = am.top; i < top; i++)
928 for (i = tmp.top; i < top; i++)
932 * copy mont->N.d[] to improve cache locality
934 for (np = am.d + top, i = 0; i < top; i++)
935 np[i] = mont->N.d[i];
937 bn_scatter5(tmp.d, top, powerbuf, 0);
938 bn_scatter5(am.d, am.top, powerbuf, 1);
939 bn_mul_mont(tmp.d, am.d, am.d, np, n0, top);
940 bn_scatter5(tmp.d, top, powerbuf, 2);
943 for (i = 3; i < 32; i++) {
944 /* Calculate a^i = a^(i-1) * a */
945 bn_mul_mont_gather5(tmp.d, am.d, powerbuf, np, n0, top, i - 1);
946 bn_scatter5(tmp.d, top, powerbuf, i);
949 /* same as above, but uses squaring for 1/2 of operations */
950 for (i = 4; i < 32; i *= 2) {
951 bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top);
952 bn_scatter5(tmp.d, top, powerbuf, i);
954 for (i = 3; i < 8; i += 2) {
956 bn_mul_mont_gather5(tmp.d, am.d, powerbuf, np, n0, top, i - 1);
957 bn_scatter5(tmp.d, top, powerbuf, i);
958 for (j = 2 * i; j < 32; j *= 2) {
959 bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top);
960 bn_scatter5(tmp.d, top, powerbuf, j);
963 for (; i < 16; i += 2) {
964 bn_mul_mont_gather5(tmp.d, am.d, powerbuf, np, n0, top, i - 1);
965 bn_scatter5(tmp.d, top, powerbuf, i);
966 bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top);
967 bn_scatter5(tmp.d, top, powerbuf, 2 * i);
969 for (; i < 32; i += 2) {
970 bn_mul_mont_gather5(tmp.d, am.d, powerbuf, np, n0, top, i - 1);
971 bn_scatter5(tmp.d, top, powerbuf, i);
975 for (wvalue = 0, i = bits % 5; i >= 0; i--, bits--)
976 wvalue = (wvalue << 1) + BN_is_bit_set(p, bits);
977 bn_gather5(tmp.d, top, powerbuf, wvalue);
980 * Scan the exponent one window at a time starting from the most
985 for (wvalue = 0, i = 0; i < 5; i++, bits--)
986 wvalue = (wvalue << 1) + BN_is_bit_set(p, bits);
988 bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top);
989 bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top);
990 bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top);
991 bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top);
992 bn_mul_mont(tmp.d, tmp.d, tmp.d, np, n0, top);
993 bn_mul_mont_gather5(tmp.d, tmp.d, powerbuf, np, n0, top,
997 wvalue = bn_get_bits5(p->d, bits - 4);
999 bn_power5(tmp.d, tmp.d, powerbuf, np, n0, top, wvalue);
1003 ret = bn_from_montgomery(tmp.d, tmp.d, NULL, np, n0, top);
1005 bn_correct_top(&tmp);
1007 if (!BN_copy(rr, &tmp))
1009 goto err; /* non-zero ret means it's not error */
1014 if (!MOD_EXP_CTIME_COPY_TO_PREBUF(&tmp, top, powerbuf, 0, window))
1016 if (!MOD_EXP_CTIME_COPY_TO_PREBUF(&am, top, powerbuf, 1, window))
1020 * If the window size is greater than 1, then calculate
1021 * val[i=2..2^winsize-1]. Powers are computed as a*a^(i-1) (even
1022 * powers could instead be computed as (a^(i/2))^2 to use the slight
1023 * performance advantage of sqr over mul).
1026 if (!BN_mod_mul_montgomery(&tmp, &am, &am, mont, ctx))
1028 if (!MOD_EXP_CTIME_COPY_TO_PREBUF(&tmp, top, powerbuf, 2,
1031 for (i = 3; i < numPowers; i++) {
1032 /* Calculate a^i = a^(i-1) * a */
1033 if (!BN_mod_mul_montgomery(&tmp, &am, &tmp, mont, ctx))
1035 if (!MOD_EXP_CTIME_COPY_TO_PREBUF(&tmp, top, powerbuf, i,
1042 * The exponent may not have a whole number of fixed-size windows.
1043 * To simplify the main loop, the initial window has between 1 and
1044 * full-window-size bits such that what remains is always a whole
1047 window0 = (bits - 1) % window + 1;
1048 wmask = (1 << window0) - 1;
1050 wvalue = bn_get_bits(p, bits) & wmask;
1051 if (!MOD_EXP_CTIME_COPY_FROM_PREBUF(&tmp, top, powerbuf, wvalue,
1055 wmask = (1 << window) - 1;
1057 * Scan the exponent one window at a time starting from the most
1062 /* Square the result window-size times */
1063 for (i = 0; i < window; i++)
1064 if (!BN_mod_mul_montgomery(&tmp, &tmp, &tmp, mont, ctx))
1068 * Get a window's worth of bits from the exponent
1069 * This avoids calling BN_is_bit_set for each bit, which
1070 * is not only slower but also makes each bit vulnerable to
1071 * EM (and likely other) side-channel attacks like One&Done
1072 * (for details see "One&Done: A Single-Decryption EM-Based
1073 * Attack on OpenSSL’s Constant-Time Blinded RSA" by M. Alam,
1074 * H. Khan, M. Dey, N. Sinha, R. Callan, A. Zajic, and
1075 * M. Prvulovic, in USENIX Security'18)
1078 wvalue = bn_get_bits(p, bits) & wmask;
1080 * Fetch the appropriate pre-computed value from the pre-buf
1082 if (!MOD_EXP_CTIME_COPY_FROM_PREBUF(&am, top, powerbuf, wvalue,
1086 /* Multiply the result into the intermediate result */
1087 if (!BN_mod_mul_montgomery(&tmp, &tmp, &am, mont, ctx))
1092 /* Convert the final result from montgomery to standard format */
1093 #if defined(SPARC_T4_MONT)
1094 if (OPENSSL_sparcv9cap_P[0] & (SPARCV9_VIS3 | SPARCV9_PREFER_FPU)) {
1095 am.d[0] = 1; /* borrow am */
1096 for (i = 1; i < top; i++)
1098 if (!BN_mod_mul_montgomery(rr, &tmp, &am, mont, ctx))
1102 if (!BN_from_montgomery(rr, &tmp, mont, ctx))
1106 if (in_mont == NULL)
1107 BN_MONT_CTX_free(mont);
1108 if (powerbuf != NULL) {
1109 OPENSSL_cleanse(powerbuf, powerbufLen);
1110 OPENSSL_free(powerbufFree);
1116 int BN_mod_exp_mont_word(BIGNUM *rr, BN_ULONG a, const BIGNUM *p,
1117 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
1119 BN_MONT_CTX *mont = NULL;
1120 int b, bits, ret = 0;
1125 #define BN_MOD_MUL_WORD(r, w, m) \
1126 (BN_mul_word(r, (w)) && \
1127 (/* BN_ucmp(r, (m)) < 0 ? 1 :*/ \
1128 (BN_mod(t, r, m, ctx) && (swap_tmp = r, r = t, t = swap_tmp, 1))))
1130 * BN_MOD_MUL_WORD is only used with 'w' large, so the BN_ucmp test is
1131 * probably more overhead than always using BN_mod (which uses BN_copy if
1132 * a similar test returns true).
1135 * We can use BN_mod and do not need BN_nnmod because our accumulator is
1136 * never negative (the result of BN_mod does not depend on the sign of
1139 #define BN_TO_MONTGOMERY_WORD(r, w, mont) \
1140 (BN_set_word(r, (w)) && BN_to_montgomery(r, r, (mont), ctx))
1142 if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0
1143 || BN_get_flags(m, BN_FLG_CONSTTIME) != 0) {
1144 /* BN_FLG_CONSTTIME only supported by BN_mod_exp_mont() */
1145 BNerr(BN_F_BN_MOD_EXP_MONT_WORD, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);
1152 if (!BN_is_odd(m)) {
1153 BNerr(BN_F_BN_MOD_EXP_MONT_WORD, BN_R_CALLED_WITH_EVEN_MODULUS);
1157 a %= m->d[0]; /* make sure that 'a' is reduced */
1159 bits = BN_num_bits(p);
1161 /* x**0 mod 1, or x**0 mod -1 is still zero. */
1162 if (BN_abs_is_word(m, 1)) {
1177 r = BN_CTX_get(ctx);
1178 t = BN_CTX_get(ctx);
1182 if (in_mont != NULL)
1185 if ((mont = BN_MONT_CTX_new()) == NULL)
1187 if (!BN_MONT_CTX_set(mont, m, ctx))
1191 r_is_one = 1; /* except for Montgomery factor */
1195 /* The result is accumulated in the product r*w. */
1196 w = a; /* bit 'bits-1' of 'p' is always set */
1197 for (b = bits - 2; b >= 0; b--) {
1198 /* First, square r*w. */
1200 if ((next_w / w) != w) { /* overflow */
1202 if (!BN_TO_MONTGOMERY_WORD(r, w, mont))
1206 if (!BN_MOD_MUL_WORD(r, w, m))
1213 if (!BN_mod_mul_montgomery(r, r, r, mont, ctx))
1217 /* Second, multiply r*w by 'a' if exponent bit is set. */
1218 if (BN_is_bit_set(p, b)) {
1220 if ((next_w / a) != w) { /* overflow */
1222 if (!BN_TO_MONTGOMERY_WORD(r, w, mont))
1226 if (!BN_MOD_MUL_WORD(r, w, m))
1235 /* Finally, set r:=r*w. */
1238 if (!BN_TO_MONTGOMERY_WORD(r, w, mont))
1242 if (!BN_MOD_MUL_WORD(r, w, m))
1247 if (r_is_one) { /* can happen only if a == 1 */
1251 if (!BN_from_montgomery(rr, r, mont, ctx))
1256 if (in_mont == NULL)
1257 BN_MONT_CTX_free(mont);
1263 /* The old fallback, simple version :-) */
1264 int BN_mod_exp_simple(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
1265 const BIGNUM *m, BN_CTX *ctx)
1267 int i, j, bits, ret = 0, wstart, wend, window, wvalue;
1270 /* Table of variables obtained from 'ctx' */
1271 BIGNUM *val[TABLE_SIZE];
1273 if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0
1274 || BN_get_flags(a, BN_FLG_CONSTTIME) != 0
1275 || BN_get_flags(m, BN_FLG_CONSTTIME) != 0) {
1276 /* BN_FLG_CONSTTIME only supported by BN_mod_exp_mont() */
1277 BNerr(BN_F_BN_MOD_EXP_SIMPLE, ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);
1281 bits = BN_num_bits(p);
1283 /* x**0 mod 1, or x**0 mod -1 is still zero. */
1284 if (BN_abs_is_word(m, 1)) {
1294 d = BN_CTX_get(ctx);
1295 val[0] = BN_CTX_get(ctx);
1299 if (!BN_nnmod(val[0], a, m, ctx))
1301 if (BN_is_zero(val[0])) {
1307 window = BN_window_bits_for_exponent_size(bits);
1309 if (!BN_mod_mul(d, val[0], val[0], m, ctx))
1311 j = 1 << (window - 1);
1312 for (i = 1; i < j; i++) {
1313 if (((val[i] = BN_CTX_get(ctx)) == NULL) ||
1314 !BN_mod_mul(val[i], val[i - 1], d, m, ctx))
1319 start = 1; /* This is used to avoid multiplication etc
1320 * when there is only the value '1' in the
1322 wvalue = 0; /* The 'value' of the window */
1323 wstart = bits - 1; /* The top bit of the window */
1324 wend = 0; /* The bottom bit of the window */
1330 if (BN_is_bit_set(p, wstart) == 0) {
1332 if (!BN_mod_mul(r, r, r, m, ctx))
1340 * We now have wstart on a 'set' bit, we now need to work out how bit
1341 * a window to do. To do this we need to scan forward until the last
1342 * set bit before the end of the window
1347 for (i = 1; i < window; i++) {
1350 if (BN_is_bit_set(p, wstart - i)) {
1351 wvalue <<= (i - wend);
1357 /* wend is the size of the current window */
1359 /* add the 'bytes above' */
1361 for (i = 0; i < j; i++) {
1362 if (!BN_mod_mul(r, r, r, m, ctx))
1366 /* wvalue will be an odd number < 2^window */
1367 if (!BN_mod_mul(r, r, val[wvalue >> 1], m, ctx))
1370 /* move the 'window' down further */