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).
113 #include "cryptlib.h"
120 # define alloca _alloca
122 #elif defined(__GNUC__)
124 # define alloca(s) __builtin_alloca((s))
131 #if defined(OPENSSL_BN_ASM_MONT) && \
132 (defined(__x86_64) || defined(__x86_64__) || \
133 defined(_M_AMD64) || defined(_M_X64))
134 # include "rsaz_exp.h"
135 # define RSAZ_ENABLED
139 #if defined(OPENSSL_BN_ASM_MONT) && (defined(__sparc__) || defined(__sparc))
140 # include "sparc_arch.h"
141 extern unsigned int OPENSSL_sparcv9cap_P[];
142 # define SPARC_T4_MONT
145 /* maximum precomputation table size for *variable* sliding windows */
146 #define TABLE_SIZE 32
148 /* this one works - simple but works */
149 int BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
154 if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0)
156 /* BN_FLG_CONSTTIME only supported by BN_mod_exp_mont() */
157 BNerr(BN_F_BN_EXP,ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);
162 if ((r == a) || (r == p))
163 rr = BN_CTX_get(ctx);
167 if (rr == NULL || v == NULL) goto err;
169 if (BN_copy(v,a) == NULL) goto err;
173 { if (BN_copy(rr,a) == NULL) goto err; }
174 else { if (!BN_one(rr)) goto err; }
176 for (i=1; i<bits; i++)
178 if (!BN_sqr(v,v,ctx)) goto err;
179 if (BN_is_bit_set(p,i))
181 if (!BN_mul(rr,rr,v,ctx)) goto err;
186 if (r != rr) BN_copy(r,rr);
193 int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
202 /* For even modulus m = 2^k*m_odd, it might make sense to compute
203 * a^p mod m_odd and a^p mod 2^k separately (with Montgomery
204 * exponentiation for the odd part), using appropriate exponent
205 * reductions, and combine the results using the CRT.
207 * For now, we use Montgomery only if the modulus is odd; otherwise,
208 * exponentiation using the reciprocal-based quick remaindering
211 * (Timing obtained with expspeed.c [computations a^p mod m
212 * where a, p, m are of the same length: 256, 512, 1024, 2048,
213 * 4096, 8192 bits], compared to the running time of the
214 * standard algorithm:
216 * BN_mod_exp_mont 33 .. 40 % [AMD K6-2, Linux, debug configuration]
217 * 55 .. 77 % [UltraSparc processor, but
218 * debug-solaris-sparcv8-gcc conf.]
220 * BN_mod_exp_recp 50 .. 70 % [AMD K6-2, Linux, debug configuration]
221 * 62 .. 118 % [UltraSparc, debug-solaris-sparcv8-gcc]
223 * On the Sparc, BN_mod_exp_recp was faster than BN_mod_exp_mont
224 * at 2048 and more bits, but at 512 and 1024 bits, it was
225 * slower even than the standard algorithm!
227 * "Real" timings [linux-elf, solaris-sparcv9-gcc configurations]
228 * should be obtained when the new Montgomery reduction code
229 * has been integrated into OpenSSL.)
233 #define MONT_EXP_WORD
237 /* I have finally been able to take out this pre-condition of
238 * the top bit being set. It was caused by an error in BN_div
239 * with negatives. There was also another problem when for a^b%m
240 * a >= m. eay 07-May-97 */
241 /* if ((m->d[m->top-1]&BN_TBIT) && BN_is_odd(m)) */
245 # ifdef MONT_EXP_WORD
246 if (a->top == 1 && !a->neg && (BN_get_flags(p, BN_FLG_CONSTTIME) == 0))
248 BN_ULONG A = a->d[0];
249 ret=BN_mod_exp_mont_word(r,A,p,m,ctx,NULL);
253 ret=BN_mod_exp_mont(r,a,p,m,ctx,NULL);
258 { ret=BN_mod_exp_recp(r,a,p,m,ctx); }
260 { ret=BN_mod_exp_simple(r,a,p,m,ctx); }
268 int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
269 const BIGNUM *m, BN_CTX *ctx)
271 int i,j,bits,ret=0,wstart,wend,window,wvalue;
274 /* Table of variables obtained from 'ctx' */
275 BIGNUM *val[TABLE_SIZE];
278 if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0)
280 /* BN_FLG_CONSTTIME only supported by BN_mod_exp_mont() */
281 BNerr(BN_F_BN_MOD_EXP_RECP,ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);
294 aa = BN_CTX_get(ctx);
295 val[0] = BN_CTX_get(ctx);
296 if(!aa || !val[0]) goto err;
298 BN_RECP_CTX_init(&recp);
301 /* ignore sign of 'm' */
302 if (!BN_copy(aa, m)) goto err;
304 if (BN_RECP_CTX_set(&recp,aa,ctx) <= 0) goto err;
308 if (BN_RECP_CTX_set(&recp,m,ctx) <= 0) goto err;
311 if (!BN_nnmod(val[0],a,m,ctx)) goto err; /* 1 */
312 if (BN_is_zero(val[0]))
319 window = BN_window_bits_for_exponent_size(bits);
322 if (!BN_mod_mul_reciprocal(aa,val[0],val[0],&recp,ctx))
327 if(((val[i] = BN_CTX_get(ctx)) == NULL) ||
328 !BN_mod_mul_reciprocal(val[i],val[i-1],
334 start=1; /* This is used to avoid multiplication etc
335 * when there is only the value '1' in the
337 wvalue=0; /* The 'value' of the window */
338 wstart=bits-1; /* The top bit of the window */
339 wend=0; /* The bottom bit of the window */
341 if (!BN_one(r)) goto err;
345 if (BN_is_bit_set(p,wstart) == 0)
348 if (!BN_mod_mul_reciprocal(r,r,r,&recp,ctx))
350 if (wstart == 0) break;
354 /* We now have wstart on a 'set' bit, we now need to work out
355 * how bit a window to do. To do this we need to scan
356 * forward until the last set bit before the end of the
361 for (i=1; i<window; i++)
363 if (wstart-i < 0) break;
364 if (BN_is_bit_set(p,wstart-i))
372 /* wend is the size of the current window */
374 /* add the 'bytes above' */
378 if (!BN_mod_mul_reciprocal(r,r,r,&recp,ctx))
382 /* wvalue will be an odd number < 2^window */
383 if (!BN_mod_mul_reciprocal(r,r,val[wvalue>>1],&recp,ctx))
386 /* move the 'window' down further */
390 if (wstart < 0) break;
395 BN_RECP_CTX_free(&recp);
401 int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
402 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
404 int i,j,bits,ret=0,wstart,wend,window,wvalue;
408 /* Table of variables obtained from 'ctx' */
409 BIGNUM *val[TABLE_SIZE];
410 BN_MONT_CTX *mont=NULL;
412 if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0)
414 return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
423 BNerr(BN_F_BN_MOD_EXP_MONT,BN_R_CALLED_WITH_EVEN_MODULUS);
436 val[0] = BN_CTX_get(ctx);
437 if (!d || !r || !val[0]) goto err;
439 /* If this is not done, things will break in the montgomery
446 if ((mont=BN_MONT_CTX_new()) == NULL) goto err;
447 if (!BN_MONT_CTX_set(mont,m,ctx)) goto err;
450 if (a->neg || BN_ucmp(a,m) >= 0)
452 if (!BN_nnmod(val[0],a,m,ctx))
464 if (!BN_to_montgomery(val[0],aa,mont,ctx)) goto err; /* 1 */
466 window = BN_window_bits_for_exponent_size(bits);
469 if (!BN_mod_mul_montgomery(d,val[0],val[0],mont,ctx)) goto err; /* 2 */
473 if(((val[i] = BN_CTX_get(ctx)) == NULL) ||
474 !BN_mod_mul_montgomery(val[i],val[i-1],
480 start=1; /* This is used to avoid multiplication etc
481 * when there is only the value '1' in the
483 wvalue=0; /* The 'value' of the window */
484 wstart=bits-1; /* The top bit of the window */
485 wend=0; /* The bottom bit of the window */
487 #if 1 /* by Shay Gueron's suggestion */
488 j = m->top; /* borrow j */
489 if (m->d[j-1] & (((BN_ULONG)1)<<(BN_BITS2-1)))
491 if (bn_wexpand(r,j) == NULL) goto err;
492 /* 2^(top*BN_BITS2) - m */
493 r->d[0] = (0-m->d[0])&BN_MASK2;
494 for(i=1;i<j;i++) r->d[i] = (~m->d[i])&BN_MASK2;
499 if (!BN_to_montgomery(r,BN_value_one(),mont,ctx)) goto err;
502 if (BN_is_bit_set(p,wstart) == 0)
506 if (!BN_mod_mul_montgomery(r,r,r,mont,ctx))
509 if (wstart == 0) break;
513 /* We now have wstart on a 'set' bit, we now need to work out
514 * how bit a window to do. To do this we need to scan
515 * forward until the last set bit before the end of the
520 for (i=1; i<window; i++)
522 if (wstart-i < 0) break;
523 if (BN_is_bit_set(p,wstart-i))
531 /* wend is the size of the current window */
533 /* add the 'bytes above' */
537 if (!BN_mod_mul_montgomery(r,r,r,mont,ctx))
541 /* wvalue will be an odd number < 2^window */
542 if (!BN_mod_mul_montgomery(r,r,val[wvalue>>1],mont,ctx))
545 /* move the 'window' down further */
549 if (wstart < 0) break;
551 #if defined(SPARC_T4_MONT)
552 if (OPENSSL_sparcv9cap_P[0]&(SPARCV9_VIS3|SPARCV9_PREFER_FPU))
554 j = mont->N.top; /* borrow j */
555 val[0]->d[0] = 1; /* borrow val[0] */
556 for (i=1;i<j;i++) val[0]->d[i] = 0;
558 if (!BN_mod_mul_montgomery(rr,r,val[0],mont,ctx)) goto err;
562 if (!BN_from_montgomery(rr,r,mont,ctx)) goto err;
565 if ((in_mont == NULL) && (mont != NULL)) BN_MONT_CTX_free(mont);
571 #if defined(SPARC_T4_MONT)
572 static BN_ULONG bn_get_bits(const BIGNUM *a, int bitpos)
577 wordpos = bitpos/BN_BITS2;
579 if (wordpos>=0 && wordpos < a->top)
581 ret = a->d[wordpos]&BN_MASK2;
585 if (++wordpos < a->top)
586 ret |= a->d[wordpos]<<(BN_BITS2-bitpos);
594 /* BN_mod_exp_mont_consttime() stores the precomputed powers in a specific layout
595 * so that accessing any of these table values shows the same access pattern as far
596 * as cache lines are concerned. The following functions are used to transfer a BIGNUM
597 * from/to that table. */
599 static int MOD_EXP_CTIME_COPY_TO_PREBUF(const BIGNUM *b, int top, unsigned char *buf, int idx, int width)
604 top = b->top; /* this works because 'buf' is explicitly zeroed */
605 for (i = 0, j=idx; i < top * sizeof b->d[0]; i++, j+=width)
607 buf[j] = ((unsigned char*)b->d)[i];
613 static int MOD_EXP_CTIME_COPY_FROM_PREBUF(BIGNUM *b, int top, unsigned char *buf, int idx, int width)
617 if (bn_wexpand(b, top) == NULL)
620 for (i=0, j=idx; i < top * sizeof b->d[0]; i++, j+=width)
622 ((unsigned char*)b->d)[i] = buf[j];
630 /* Given a pointer value, compute the next address that is a cache line multiple. */
631 #define MOD_EXP_CTIME_ALIGN(x_) \
632 ((unsigned char*)(x_) + (MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH - (((size_t)(x_)) & (MOD_EXP_CTIME_MIN_CACHE_LINE_MASK))))
634 /* This variant of BN_mod_exp_mont() uses fixed windows and the special
635 * precomputation memory layout to limit data-dependency to a minimum
636 * to protect secret exponents (cf. the hyper-threading timing attacks
637 * pointed out by Colin Percival,
638 * http://www.daemonology.net/hyperthreading-considered-harmful/)
640 int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
641 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
643 int i,bits,ret=0,window,wvalue;
645 BN_MONT_CTX *mont=NULL;
648 unsigned char *powerbufFree=NULL;
650 unsigned char *powerbuf=NULL;
652 #if defined(SPARC_T4_MONT)
664 BNerr(BN_F_BN_MOD_EXP_MONT_CONSTTIME,BN_R_CALLED_WITH_EVEN_MODULUS);
676 /* Allocate a montgomery context if it was not supplied by the caller.
677 * If this is not done, things will break in the montgomery part.
683 if ((mont=BN_MONT_CTX_new()) == NULL) goto err;
684 if (!BN_MONT_CTX_set(mont,m,ctx)) goto err;
689 * If the size of the operands allow it, perform the optimized
690 * RSAZ exponentiation. For further information see
691 * crypto/bn/rsaz_exp.c and accompanying assembly modules.
693 if ((16 == a->top) && (16 == p->top) && (BN_num_bits(m) == 1024)
694 && rsaz_avx2_eligible())
696 if (NULL == bn_wexpand(rr, 16)) goto err;
697 RSAZ_1024_mod_exp_avx2(rr->d, a->d, p->d, m->d, mont->RR.d, mont->n0[0]);
704 else if ((8 == a->top) && (8 == p->top) && (BN_num_bits(m) == 512))
706 if (NULL == bn_wexpand(rr,8)) goto err;
707 RSAZ_512_mod_exp(rr->d, a->d, p->d, m->d, mont->n0[0], mont->RR.d);
716 /* Get the window size to use with size of p. */
717 window = BN_window_bits_for_ctime_exponent_size(bits);
718 #if defined(SPARC_T4_MONT)
719 if (window>=5 && (top&15)==0 && top<=64 &&
720 (OPENSSL_sparcv9cap_P[1]&(CFR_MONTMUL|CFR_MONTSQR))==
721 (CFR_MONTMUL|CFR_MONTSQR) &&
722 (t4=OPENSSL_sparcv9cap_P[0]))
726 #if defined(OPENSSL_BN_ASM_MONT5)
727 if (window==6 && bits<=1024) window=5; /* ~5% improvement of 2048-bit RSA sign */
731 /* Allocate a buffer large enough to hold all of the pre-computed
732 * powers of am, am itself and tmp.
734 numPowers = 1 << window;
735 powerbufLen = sizeof(m->d[0])*(top*numPowers +
736 ((2*top)>numPowers?(2*top):numPowers));
738 if (powerbufLen < 3072)
739 powerbufFree = alloca(powerbufLen+MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH);
742 if ((powerbufFree=(unsigned char*)OPENSSL_malloc(powerbufLen+MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH)) == NULL)
745 powerbuf = MOD_EXP_CTIME_ALIGN(powerbufFree);
746 memset(powerbuf, 0, powerbufLen);
749 if (powerbufLen < 3072)
753 /* lay down tmp and am right after powers table */
754 tmp.d = (BN_ULONG *)(powerbuf + sizeof(m->d[0])*top*numPowers);
756 tmp.top = am.top = 0;
757 tmp.dmax = am.dmax = top;
758 tmp.neg = am.neg = 0;
759 tmp.flags = am.flags = BN_FLG_STATIC_DATA;
761 /* prepare a^0 in Montgomery domain */
762 #if 1 /* by Shay Gueron's suggestion */
763 if (m->d[top-1] & (((BN_ULONG)1)<<(BN_BITS2-1)))
765 /* 2^(top*BN_BITS2) - m */
766 tmp.d[0] = (0-m->d[0])&BN_MASK2;
767 for (i=1;i<top;i++) tmp.d[i] = (~m->d[i])&BN_MASK2;
772 if (!BN_to_montgomery(&tmp,BN_value_one(),mont,ctx)) goto err;
774 /* prepare a^1 in Montgomery domain */
775 if (a->neg || BN_ucmp(a,m) >= 0)
777 if (!BN_mod(&am,a,m,ctx)) goto err;
778 if (!BN_to_montgomery(&am,&am,mont,ctx)) goto err;
780 else if (!BN_to_montgomery(&am,a,mont,ctx)) goto err;
782 #if defined(SPARC_T4_MONT)
785 typedef int (*bn_pwr5_mont_f)(BN_ULONG *tp,const BN_ULONG *np,
786 const BN_ULONG *n0,const void *table,int power,int bits);
787 int bn_pwr5_mont_t4_8(BN_ULONG *tp,const BN_ULONG *np,
788 const BN_ULONG *n0,const void *table,int power,int bits);
789 int bn_pwr5_mont_t4_16(BN_ULONG *tp,const BN_ULONG *np,
790 const BN_ULONG *n0,const void *table,int power,int bits);
791 int bn_pwr5_mont_t4_24(BN_ULONG *tp,const BN_ULONG *np,
792 const BN_ULONG *n0,const void *table,int power,int bits);
793 int bn_pwr5_mont_t4_32(BN_ULONG *tp,const BN_ULONG *np,
794 const BN_ULONG *n0,const void *table,int power,int bits);
795 static const bn_pwr5_mont_f pwr5_funcs[4] = {
796 bn_pwr5_mont_t4_8, bn_pwr5_mont_t4_16,
797 bn_pwr5_mont_t4_24, bn_pwr5_mont_t4_32 };
798 bn_pwr5_mont_f pwr5_worker = pwr5_funcs[top/16-1];
800 typedef int (*bn_mul_mont_f)(BN_ULONG *rp,const BN_ULONG *ap,
801 const void *bp,const BN_ULONG *np,const BN_ULONG *n0);
802 int bn_mul_mont_t4_8(BN_ULONG *rp,const BN_ULONG *ap,
803 const void *bp,const BN_ULONG *np,const BN_ULONG *n0);
804 int bn_mul_mont_t4_16(BN_ULONG *rp,const BN_ULONG *ap,
805 const void *bp,const BN_ULONG *np,const BN_ULONG *n0);
806 int bn_mul_mont_t4_24(BN_ULONG *rp,const BN_ULONG *ap,
807 const void *bp,const BN_ULONG *np,const BN_ULONG *n0);
808 int bn_mul_mont_t4_32(BN_ULONG *rp,const BN_ULONG *ap,
809 const void *bp,const BN_ULONG *np,const BN_ULONG *n0);
810 static const bn_mul_mont_f mul_funcs[4] = {
811 bn_mul_mont_t4_8, bn_mul_mont_t4_16,
812 bn_mul_mont_t4_24, bn_mul_mont_t4_32 };
813 bn_mul_mont_f mul_worker = mul_funcs[top/16-1];
815 void bn_mul_mont_vis3(BN_ULONG *rp,const BN_ULONG *ap,
816 const void *bp,const BN_ULONG *np,
817 const BN_ULONG *n0,int num);
818 void bn_mul_mont_t4(BN_ULONG *rp,const BN_ULONG *ap,
819 const void *bp,const BN_ULONG *np,
820 const BN_ULONG *n0,int num);
821 void bn_mul_mont_gather5_t4(BN_ULONG *rp,const BN_ULONG *ap,
822 const void *table,const BN_ULONG *np,
823 const BN_ULONG *n0,int num,int power);
824 void bn_flip_n_scatter5_t4(const BN_ULONG *inp,size_t num,
825 void *table,size_t power);
826 void bn_gather5_t4(BN_ULONG *out,size_t num,
827 void *table,size_t power);
828 void bn_flip_t4(BN_ULONG *dst,BN_ULONG *src,size_t num);
830 BN_ULONG *np=mont->N.d, *n0=mont->n0;
831 int stride = 5*(6-(top/16-1)); /* multiple of 5, but less than 32 */
833 /* BN_to_montgomery can contaminate words above .top
834 * [in BN_DEBUG[_DEBUG] build]... */
835 for (i=am.top; i<top; i++) am.d[i]=0;
836 for (i=tmp.top; i<top; i++) tmp.d[i]=0;
838 bn_flip_n_scatter5_t4(tmp.d,top,powerbuf,0);
839 bn_flip_n_scatter5_t4(am.d,top,powerbuf,1);
840 if (!(*mul_worker)(tmp.d,am.d,am.d,np,n0) &&
841 !(*mul_worker)(tmp.d,am.d,am.d,np,n0))
842 bn_mul_mont_vis3(tmp.d,am.d,am.d,np,n0,top);
843 bn_flip_n_scatter5_t4(tmp.d,top,powerbuf,2);
847 /* Calculate a^i = a^(i-1) * a */
848 if (!(*mul_worker)(tmp.d,tmp.d,am.d,np,n0) &&
849 !(*mul_worker)(tmp.d,tmp.d,am.d,np,n0))
850 bn_mul_mont_vis3(tmp.d,tmp.d,am.d,np,n0,top);
851 bn_flip_n_scatter5_t4(tmp.d,top,powerbuf,i);
854 /* switch to 64-bit domain */
855 np = alloca(top*sizeof(BN_ULONG));
857 bn_flip_t4(np,mont->N.d,top);
860 for (wvalue=0, i=bits%5; i>=0; i--,bits--)
861 wvalue = (wvalue<<1)+BN_is_bit_set(p,bits);
862 bn_gather5_t4(tmp.d,top,powerbuf,wvalue);
864 /* Scan the exponent one window at a time starting from the most
869 if (bits < stride) stride = bits+1;
871 wvalue = bn_get_bits(p,bits+1);
873 if ((*pwr5_worker)(tmp.d,np,n0,powerbuf,wvalue,stride)) continue;
874 /* retry once and fall back */
875 if ((*pwr5_worker)(tmp.d,np,n0,powerbuf,wvalue,stride)) continue;
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_t4(tmp.d,tmp.d,tmp.d,np,n0,top);
883 bn_mul_mont_t4(tmp.d,tmp.d,tmp.d,np,n0,top);
884 bn_mul_mont_t4(tmp.d,tmp.d,tmp.d,np,n0,top);
885 bn_mul_mont_gather5_t4(tmp.d,tmp.d,powerbuf,np,n0,top,wvalue);
888 bn_flip_t4(tmp.d,tmp.d,top);
890 /* back to 32-bit domain */
892 bn_correct_top(&tmp);
893 OPENSSL_cleanse(np,top*sizeof(BN_ULONG));
897 #if defined(OPENSSL_BN_ASM_MONT5)
898 /* This optimization uses ideas from http://eprint.iacr.org/2011/239,
899 * specifically optimization of cache-timing attack countermeasures
900 * and pre-computation optimization. */
902 /* Dedicated window==4 case improves 512-bit RSA sign by ~15%, but as
903 * 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,
912 void *table,size_t power);
914 BN_ULONG *np=mont->N.d, *n0=mont->n0;
916 /* BN_to_montgomery can contaminate words above .top
917 * [in BN_DEBUG[_DEBUG] build]... */
918 for (i=am.top; i<top; i++) am.d[i]=0;
919 for (i=tmp.top; i<top; i++) tmp.d[i]=0;
921 bn_scatter5(tmp.d,top,powerbuf,0);
922 bn_scatter5(am.d,am.top,powerbuf,1);
923 bn_mul_mont(tmp.d,am.d,am.d,np,n0,top);
924 bn_scatter5(tmp.d,top,powerbuf,2);
929 /* Calculate a^i = a^(i-1) * a */
930 bn_mul_mont_gather5(tmp.d,am.d,powerbuf,np,n0,top,i-1);
931 bn_scatter5(tmp.d,top,powerbuf,i);
934 /* same as above, but uses squaring for 1/2 of operations */
935 for (i=4; i<32; i*=2)
937 bn_mul_mont(tmp.d,tmp.d,tmp.d,np,n0,top);
938 bn_scatter5(tmp.d,top,powerbuf,i);
943 bn_mul_mont_gather5(tmp.d,am.d,powerbuf,np,n0,top,i-1);
944 bn_scatter5(tmp.d,top,powerbuf,i);
945 for (j=2*i; j<32; j*=2)
947 bn_mul_mont(tmp.d,tmp.d,tmp.d,np,n0,top);
948 bn_scatter5(tmp.d,top,powerbuf,j);
953 bn_mul_mont_gather5(tmp.d,am.d,powerbuf,np,n0,top,i-1);
954 bn_scatter5(tmp.d,top,powerbuf,i);
955 bn_mul_mont(tmp.d,tmp.d,tmp.d,np,n0,top);
956 bn_scatter5(tmp.d,top,powerbuf,2*i);
960 bn_mul_mont_gather5(tmp.d,am.d,powerbuf,np,n0,top,i-1);
961 bn_scatter5(tmp.d,top,powerbuf,i);
965 for (wvalue=0, i=bits%5; i>=0; i--,bits--)
966 wvalue = (wvalue<<1)+BN_is_bit_set(p,bits);
967 bn_gather5(tmp.d,top,powerbuf,wvalue);
969 /* Scan the exponent one window at a time starting from the most
974 for (wvalue=0, i=0; i<5; i++,bits--)
975 wvalue = (wvalue<<1)+BN_is_bit_set(p,bits);
977 bn_mul_mont(tmp.d,tmp.d,tmp.d,np,n0,top);
978 bn_mul_mont(tmp.d,tmp.d,tmp.d,np,n0,top);
979 bn_mul_mont(tmp.d,tmp.d,tmp.d,np,n0,top);
980 bn_mul_mont(tmp.d,tmp.d,tmp.d,np,n0,top);
981 bn_mul_mont(tmp.d,tmp.d,tmp.d,np,n0,top);
982 bn_mul_mont_gather5(tmp.d,tmp.d,powerbuf,np,n0,top,wvalue);
986 bn_correct_top(&tmp);
991 if (!MOD_EXP_CTIME_COPY_TO_PREBUF(&tmp, top, powerbuf, 0, numPowers)) goto err;
992 if (!MOD_EXP_CTIME_COPY_TO_PREBUF(&am, top, powerbuf, 1, numPowers)) goto err;
994 /* If the window size is greater than 1, then calculate
995 * val[i=2..2^winsize-1]. Powers are computed as a*a^(i-1)
996 * (even powers could instead be computed as (a^(i/2))^2
997 * to use the slight performance advantage of sqr over mul).
1001 if (!BN_mod_mul_montgomery(&tmp,&am,&am,mont,ctx)) goto err;
1002 if (!MOD_EXP_CTIME_COPY_TO_PREBUF(&tmp, top, powerbuf, 2, numPowers)) goto err;
1003 for (i=3; i<numPowers; i++)
1005 /* Calculate a^i = a^(i-1) * a */
1006 if (!BN_mod_mul_montgomery(&tmp,&am,&tmp,mont,ctx))
1008 if (!MOD_EXP_CTIME_COPY_TO_PREBUF(&tmp, top, powerbuf, i, numPowers)) goto err;
1013 for (wvalue=0, i=bits%window; i>=0; i--,bits--)
1014 wvalue = (wvalue<<1)+BN_is_bit_set(p,bits);
1015 if (!MOD_EXP_CTIME_COPY_FROM_PREBUF(&tmp,top,powerbuf,wvalue,numPowers)) goto err;
1017 /* Scan the exponent one window at a time starting from the most
1022 wvalue=0; /* The 'value' of the window */
1024 /* Scan the window, squaring the result as we go */
1025 for (i=0; i<window; i++,bits--)
1027 if (!BN_mod_mul_montgomery(&tmp,&tmp,&tmp,mont,ctx)) goto err;
1028 wvalue = (wvalue<<1)+BN_is_bit_set(p,bits);
1031 /* Fetch the appropriate pre-computed value from the pre-buf */
1032 if (!MOD_EXP_CTIME_COPY_FROM_PREBUF(&am, top, powerbuf, wvalue, numPowers)) goto err;
1034 /* Multiply the result into the intermediate result */
1035 if (!BN_mod_mul_montgomery(&tmp,&tmp,&am,mont,ctx)) goto err;
1039 /* Convert the final result from montgomery to standard format */
1040 #if defined(SPARC_T4_MONT)
1041 if (OPENSSL_sparcv9cap_P[0]&(SPARCV9_VIS3|SPARCV9_PREFER_FPU))
1043 am.d[0] = 1; /* borrow am */
1044 for (i=1;i<top;i++) am.d[i] = 0;
1045 if (!BN_mod_mul_montgomery(rr,&tmp,&am,mont,ctx)) goto err;
1049 if (!BN_from_montgomery(rr,&tmp,mont,ctx)) goto err;
1052 if ((in_mont == NULL) && (mont != NULL)) BN_MONT_CTX_free(mont);
1055 OPENSSL_cleanse(powerbuf,powerbufLen);
1056 if (powerbufFree) OPENSSL_free(powerbufFree);
1062 int BN_mod_exp_mont_word(BIGNUM *rr, BN_ULONG a, const BIGNUM *p,
1063 const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
1065 BN_MONT_CTX *mont = NULL;
1071 #define BN_MOD_MUL_WORD(r, w, m) \
1072 (BN_mul_word(r, (w)) && \
1073 (/* BN_ucmp(r, (m)) < 0 ? 1 :*/ \
1074 (BN_mod(t, r, m, ctx) && (swap_tmp = r, r = t, t = swap_tmp, 1))))
1075 /* BN_MOD_MUL_WORD is only used with 'w' large,
1076 * so the BN_ucmp test is probably more overhead
1077 * than always using BN_mod (which uses BN_copy if
1078 * a similar test returns true). */
1079 /* We can use BN_mod and do not need BN_nnmod because our
1080 * accumulator is never negative (the result of BN_mod does
1081 * not depend on the sign of the modulus).
1083 #define BN_TO_MONTGOMERY_WORD(r, w, mont) \
1084 (BN_set_word(r, (w)) && BN_to_montgomery(r, r, (mont), ctx))
1086 if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0)
1088 /* BN_FLG_CONSTTIME only supported by BN_mod_exp_mont() */
1089 BNerr(BN_F_BN_MOD_EXP_MONT_WORD,ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);
1098 BNerr(BN_F_BN_MOD_EXP_MONT_WORD,BN_R_CALLED_WITH_EVEN_MODULUS);
1102 a %= m->d[0]; /* make sure that 'a' is reduced */
1104 bits = BN_num_bits(p);
1118 d = BN_CTX_get(ctx);
1119 r = BN_CTX_get(ctx);
1120 t = BN_CTX_get(ctx);
1121 if (d == NULL || r == NULL || t == NULL) goto err;
1123 if (in_mont != NULL)
1127 if ((mont = BN_MONT_CTX_new()) == NULL) goto err;
1128 if (!BN_MONT_CTX_set(mont, m, ctx)) goto err;
1131 r_is_one = 1; /* except for Montgomery factor */
1135 /* The result is accumulated in the product r*w. */
1136 w = a; /* bit 'bits-1' of 'p' is always set */
1137 for (b = bits-2; b >= 0; b--)
1139 /* First, square r*w. */
1141 if ((next_w/w) != w) /* overflow */
1145 if (!BN_TO_MONTGOMERY_WORD(r, w, mont)) goto err;
1150 if (!BN_MOD_MUL_WORD(r, w, m)) goto err;
1157 if (!BN_mod_mul_montgomery(r, r, r, mont, ctx)) goto err;
1160 /* Second, multiply r*w by 'a' if exponent bit is set. */
1161 if (BN_is_bit_set(p, b))
1164 if ((next_w/a) != w) /* overflow */
1168 if (!BN_TO_MONTGOMERY_WORD(r, w, mont)) goto err;
1173 if (!BN_MOD_MUL_WORD(r, w, m)) goto err;
1181 /* Finally, set r:=r*w. */
1186 if (!BN_TO_MONTGOMERY_WORD(r, w, mont)) goto err;
1191 if (!BN_MOD_MUL_WORD(r, w, m)) goto err;
1195 if (r_is_one) /* can happen only if a == 1*/
1197 if (!BN_one(rr)) goto err;
1201 if (!BN_from_montgomery(rr, r, mont, ctx)) goto err;
1205 if ((in_mont == NULL) && (mont != NULL)) BN_MONT_CTX_free(mont);
1212 /* The old fallback, simple version :-) */
1213 int BN_mod_exp_simple(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
1214 const BIGNUM *m, BN_CTX *ctx)
1216 int i,j,bits,ret=0,wstart,wend,window,wvalue;
1219 /* Table of variables obtained from 'ctx' */
1220 BIGNUM *val[TABLE_SIZE];
1222 if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0)
1224 /* BN_FLG_CONSTTIME only supported by BN_mod_exp_mont() */
1225 BNerr(BN_F_BN_MOD_EXP_SIMPLE,ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);
1229 bits=BN_num_bits(p);
1238 d = BN_CTX_get(ctx);
1239 val[0] = BN_CTX_get(ctx);
1240 if(!d || !val[0]) goto err;
1242 if (!BN_nnmod(val[0],a,m,ctx)) goto err; /* 1 */
1243 if (BN_is_zero(val[0]))
1250 window = BN_window_bits_for_exponent_size(bits);
1253 if (!BN_mod_mul(d,val[0],val[0],m,ctx))
1258 if(((val[i] = BN_CTX_get(ctx)) == NULL) ||
1259 !BN_mod_mul(val[i],val[i-1],d,m,ctx))
1264 start=1; /* This is used to avoid multiplication etc
1265 * when there is only the value '1' in the
1267 wvalue=0; /* The 'value' of the window */
1268 wstart=bits-1; /* The top bit of the window */
1269 wend=0; /* The bottom bit of the window */
1271 if (!BN_one(r)) goto err;
1275 if (BN_is_bit_set(p,wstart) == 0)
1278 if (!BN_mod_mul(r,r,r,m,ctx))
1280 if (wstart == 0) break;
1284 /* We now have wstart on a 'set' bit, we now need to work out
1285 * how bit a window to do. To do this we need to scan
1286 * forward until the last set bit before the end of the
1291 for (i=1; i<window; i++)
1293 if (wstart-i < 0) break;
1294 if (BN_is_bit_set(p,wstart-i))
1302 /* wend is the size of the current window */
1304 /* add the 'bytes above' */
1308 if (!BN_mod_mul(r,r,r,m,ctx))
1312 /* wvalue will be an odd number < 2^window */
1313 if (!BN_mod_mul(r,r,val[wvalue>>1],m,ctx))
1316 /* move the 'window' down further */
1320 if (wstart < 0) break;