sl@0: /* crypto/bn/bn_exp.c */
sl@0: /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
sl@0:  * All rights reserved.
sl@0:  *
sl@0:  * This package is an SSL implementation written
sl@0:  * by Eric Young (eay@cryptsoft.com).
sl@0:  * The implementation was written so as to conform with Netscapes SSL.
sl@0:  * 
sl@0:  * This library is free for commercial and non-commercial use as long as
sl@0:  * the following conditions are aheared to.  The following conditions
sl@0:  * apply to all code found in this distribution, be it the RC4, RSA,
sl@0:  * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
sl@0:  * included with this distribution is covered by the same copyright terms
sl@0:  * except that the holder is Tim Hudson (tjh@cryptsoft.com).
sl@0:  * 
sl@0:  * Copyright remains Eric Young's, and as such any Copyright notices in
sl@0:  * the code are not to be removed.
sl@0:  * If this package is used in a product, Eric Young should be given attribution
sl@0:  * as the author of the parts of the library used.
sl@0:  * This can be in the form of a textual message at program startup or
sl@0:  * in documentation (online or textual) provided with the package.
sl@0:  * 
sl@0:  * Redistribution and use in source and binary forms, with or without
sl@0:  * modification, are permitted provided that the following conditions
sl@0:  * are met:
sl@0:  * 1. Redistributions of source code must retain the copyright
sl@0:  *    notice, this list of conditions and the following disclaimer.
sl@0:  * 2. Redistributions in binary form must reproduce the above copyright
sl@0:  *    notice, this list of conditions and the following disclaimer in the
sl@0:  *    documentation and/or other materials provided with the distribution.
sl@0:  * 3. All advertising materials mentioning features or use of this software
sl@0:  *    must display the following acknowledgement:
sl@0:  *    "This product includes cryptographic software written by
sl@0:  *     Eric Young (eay@cryptsoft.com)"
sl@0:  *    The word 'cryptographic' can be left out if the rouines from the library
sl@0:  *    being used are not cryptographic related :-).
sl@0:  * 4. If you include any Windows specific code (or a derivative thereof) from 
sl@0:  *    the apps directory (application code) you must include an acknowledgement:
sl@0:  *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
sl@0:  * 
sl@0:  * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
sl@0:  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
sl@0:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
sl@0:  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
sl@0:  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
sl@0:  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
sl@0:  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
sl@0:  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
sl@0:  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
sl@0:  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
sl@0:  * SUCH DAMAGE.
sl@0:  * 
sl@0:  * The licence and distribution terms for any publically available version or
sl@0:  * derivative of this code cannot be changed.  i.e. this code cannot simply be
sl@0:  * copied and put under another distribution licence
sl@0:  * [including the GNU Public Licence.]
sl@0:  */
sl@0: /* ====================================================================
sl@0:  * Copyright (c) 1998-2005 The OpenSSL Project.  All rights reserved.
sl@0:  *
sl@0:  * Redistribution and use in source and binary forms, with or without
sl@0:  * modification, are permitted provided that the following conditions
sl@0:  * are met:
sl@0:  *
sl@0:  * 1. Redistributions of source code must retain the above copyright
sl@0:  *    notice, this list of conditions and the following disclaimer. 
sl@0:  *
sl@0:  * 2. Redistributions in binary form must reproduce the above copyright
sl@0:  *    notice, this list of conditions and the following disclaimer in
sl@0:  *    the documentation and/or other materials provided with the
sl@0:  *    distribution.
sl@0:  *
sl@0:  * 3. All advertising materials mentioning features or use of this
sl@0:  *    software must display the following acknowledgment:
sl@0:  *    "This product includes software developed by the OpenSSL Project
sl@0:  *    for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
sl@0:  *
sl@0:  * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
sl@0:  *    endorse or promote products derived from this software without
sl@0:  *    prior written permission. For written permission, please contact
sl@0:  *    openssl-core@openssl.org.
sl@0:  *
sl@0:  * 5. Products derived from this software may not be called "OpenSSL"
sl@0:  *    nor may "OpenSSL" appear in their names without prior written
sl@0:  *    permission of the OpenSSL Project.
sl@0:  *
sl@0:  * 6. Redistributions of any form whatsoever must retain the following
sl@0:  *    acknowledgment:
sl@0:  *    "This product includes software developed by the OpenSSL Project
sl@0:  *    for use in the OpenSSL Toolkit (http://www.openssl.org/)"
sl@0:  *
sl@0:  * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
sl@0:  * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
sl@0:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
sl@0:  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
sl@0:  * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
sl@0:  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
sl@0:  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
sl@0:  * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
sl@0:  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
sl@0:  * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
sl@0:  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
sl@0:  * OF THE POSSIBILITY OF SUCH DAMAGE.
sl@0:  * ====================================================================
sl@0:  *
sl@0:  * This product includes cryptographic software written by Eric Young
sl@0:  * (eay@cryptsoft.com).  This product includes software written by Tim
sl@0:  * Hudson (tjh@cryptsoft.com).
sl@0:  *
sl@0:  */
sl@0: 
sl@0: 
sl@0: #include "cryptlib.h"
sl@0: #include "bn_lcl.h"
sl@0: 
sl@0: /* maximum precomputation table size for *variable* sliding windows */
sl@0: #define TABLE_SIZE	32
sl@0: 
sl@0: /* this one works - simple but works */
sl@0: EXPORT_C int BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
sl@0: 	{
sl@0: 	int i,bits,ret=0;
sl@0: 	BIGNUM *v,*rr;
sl@0: 
sl@0: 	if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0)
sl@0: 		{
sl@0: 		/* BN_FLG_CONSTTIME only supported by BN_mod_exp_mont() */
sl@0: 		BNerr(BN_F_BN_EXP,ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);
sl@0: 		return -1;
sl@0: 		}
sl@0: 
sl@0: 	BN_CTX_start(ctx);
sl@0: 	if ((r == a) || (r == p))
sl@0: 		rr = BN_CTX_get(ctx);
sl@0: 	else
sl@0: 		rr = r;
sl@0: 	if ((v = BN_CTX_get(ctx)) == NULL) goto err;
sl@0: 
sl@0: 	if (BN_copy(v,a) == NULL) goto err;
sl@0: 	bits=BN_num_bits(p);
sl@0: 
sl@0: 	if (BN_is_odd(p))
sl@0: 		{ if (BN_copy(rr,a) == NULL) goto err; }
sl@0: 	else	{ if (!BN_one(rr)) goto err; }
sl@0: 
sl@0: 	for (i=1; i<bits; i++)
sl@0: 		{
sl@0: 		if (!BN_sqr(v,v,ctx)) goto err;
sl@0: 		if (BN_is_bit_set(p,i))
sl@0: 			{
sl@0: 			if (!BN_mul(rr,rr,v,ctx)) goto err;
sl@0: 			}
sl@0: 		}
sl@0: 	ret=1;
sl@0: err:
sl@0: 	if (r != rr) BN_copy(r,rr);
sl@0: 	BN_CTX_end(ctx);
sl@0: 	bn_check_top(r);
sl@0: 	return(ret);
sl@0: 	}
sl@0: 
sl@0: 
sl@0: EXPORT_C int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
sl@0: 	       BN_CTX *ctx)
sl@0: 	{
sl@0: 	int ret;
sl@0: 
sl@0: 	bn_check_top(a);
sl@0: 	bn_check_top(p);
sl@0: 	bn_check_top(m);
sl@0: 
sl@0: 	/* For even modulus  m = 2^k*m_odd,  it might make sense to compute
sl@0: 	 * a^p mod m_odd  and  a^p mod 2^k  separately (with Montgomery
sl@0: 	 * exponentiation for the odd part), using appropriate exponent
sl@0: 	 * reductions, and combine the results using the CRT.
sl@0: 	 *
sl@0: 	 * For now, we use Montgomery only if the modulus is odd; otherwise,
sl@0: 	 * exponentiation using the reciprocal-based quick remaindering
sl@0: 	 * algorithm is used.
sl@0: 	 *
sl@0: 	 * (Timing obtained with expspeed.c [computations  a^p mod m
sl@0: 	 * where  a, p, m  are of the same length: 256, 512, 1024, 2048,
sl@0: 	 * 4096, 8192 bits], compared to the running time of the
sl@0: 	 * standard algorithm:
sl@0: 	 *
sl@0: 	 *   BN_mod_exp_mont   33 .. 40 %  [AMD K6-2, Linux, debug configuration]
sl@0:          *                     55 .. 77 %  [UltraSparc processor, but
sl@0: 	 *                                  debug-solaris-sparcv8-gcc conf.]
sl@0: 	 * 
sl@0: 	 *   BN_mod_exp_recp   50 .. 70 %  [AMD K6-2, Linux, debug configuration]
sl@0: 	 *                     62 .. 118 % [UltraSparc, debug-solaris-sparcv8-gcc]
sl@0: 	 *
sl@0: 	 * On the Sparc, BN_mod_exp_recp was faster than BN_mod_exp_mont
sl@0: 	 * at 2048 and more bits, but at 512 and 1024 bits, it was
sl@0: 	 * slower even than the standard algorithm!
sl@0: 	 *
sl@0: 	 * "Real" timings [linux-elf, solaris-sparcv9-gcc configurations]
sl@0: 	 * should be obtained when the new Montgomery reduction code
sl@0: 	 * has been integrated into OpenSSL.)
sl@0: 	 */
sl@0: 
sl@0: #define MONT_MUL_MOD
sl@0: #define MONT_EXP_WORD
sl@0: #define RECP_MUL_MOD
sl@0: 
sl@0: #ifdef MONT_MUL_MOD
sl@0: 	/* I have finally been able to take out this pre-condition of
sl@0: 	 * the top bit being set.  It was caused by an error in BN_div
sl@0: 	 * with negatives.  There was also another problem when for a^b%m
sl@0: 	 * a >= m.  eay 07-May-97 */
sl@0: /*	if ((m->d[m->top-1]&BN_TBIT) && BN_is_odd(m)) */
sl@0: 
sl@0: 	if (BN_is_odd(m))
sl@0: 		{
sl@0: #  ifdef MONT_EXP_WORD
sl@0: 		if (a->top == 1 && !a->neg && (BN_get_flags(p, BN_FLG_CONSTTIME) == 0))
sl@0: 			{
sl@0: 			BN_ULONG A = a->d[0];
sl@0: 			ret=BN_mod_exp_mont_word(r,A,p,m,ctx,NULL);
sl@0: 			}
sl@0: 		else
sl@0: #  endif
sl@0: 			ret=BN_mod_exp_mont(r,a,p,m,ctx,NULL);
sl@0: 		}
sl@0: 	else
sl@0: #endif
sl@0: #ifdef RECP_MUL_MOD
sl@0: 		{ ret=BN_mod_exp_recp(r,a,p,m,ctx); }
sl@0: #else
sl@0: 		{ ret=BN_mod_exp_simple(r,a,p,m,ctx); }
sl@0: #endif
sl@0: 
sl@0: 	bn_check_top(r);
sl@0: 	return(ret);
sl@0: 	}
sl@0: 
sl@0: 
sl@0: EXPORT_C int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
sl@0: 		    const BIGNUM *m, BN_CTX *ctx)
sl@0: 	{
sl@0: 	int i,j,bits,ret=0,wstart,wend,window,wvalue;
sl@0: 	int start=1;
sl@0: 	BIGNUM *aa;
sl@0: 	/* Table of variables obtained from 'ctx' */
sl@0: 	BIGNUM *val[TABLE_SIZE];
sl@0: 	BN_RECP_CTX recp;
sl@0: 
sl@0: 	if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0)
sl@0: 		{
sl@0: 		/* BN_FLG_CONSTTIME only supported by BN_mod_exp_mont() */
sl@0: 		BNerr(BN_F_BN_MOD_EXP_RECP,ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);
sl@0: 		return -1;
sl@0: 		}
sl@0: 
sl@0: 	bits=BN_num_bits(p);
sl@0: 
sl@0: 	if (bits == 0)
sl@0: 		{
sl@0: 		ret = BN_one(r);
sl@0: 		return ret;
sl@0: 		}
sl@0: 
sl@0: 	BN_CTX_start(ctx);
sl@0: 	aa = BN_CTX_get(ctx);
sl@0: 	val[0] = BN_CTX_get(ctx);
sl@0: 	if(!aa || !val[0]) goto err;
sl@0: 
sl@0: 	BN_RECP_CTX_init(&recp);
sl@0: 	if (m->neg)
sl@0: 		{
sl@0: 		/* ignore sign of 'm' */
sl@0: 		if (!BN_copy(aa, m)) goto err;
sl@0: 		aa->neg = 0;
sl@0: 		if (BN_RECP_CTX_set(&recp,aa,ctx) <= 0) goto err;
sl@0: 		}
sl@0: 	else
sl@0: 		{
sl@0: 		if (BN_RECP_CTX_set(&recp,m,ctx) <= 0) goto err;
sl@0: 		}
sl@0: 
sl@0: 	if (!BN_nnmod(val[0],a,m,ctx)) goto err;		/* 1 */
sl@0: 	if (BN_is_zero(val[0]))
sl@0: 		{
sl@0: 		BN_zero(r);
sl@0: 		ret = 1;
sl@0: 		goto err;
sl@0: 		}
sl@0: 
sl@0: 	window = BN_window_bits_for_exponent_size(bits);
sl@0: 	if (window > 1)
sl@0: 		{
sl@0: 		if (!BN_mod_mul_reciprocal(aa,val[0],val[0],&recp,ctx))
sl@0: 			goto err;				/* 2 */
sl@0: 		j=1<<(window-1);
sl@0: 		for (i=1; i<j; i++)
sl@0: 			{
sl@0: 			if(((val[i] = BN_CTX_get(ctx)) == NULL) ||
sl@0: 					!BN_mod_mul_reciprocal(val[i],val[i-1],
sl@0: 						aa,&recp,ctx))
sl@0: 				goto err;
sl@0: 			}
sl@0: 		}
sl@0: 		
sl@0: 	start=1;	/* This is used to avoid multiplication etc
sl@0: 			 * when there is only the value '1' in the
sl@0: 			 * buffer. */
sl@0: 	wvalue=0;	/* The 'value' of the window */
sl@0: 	wstart=bits-1;	/* The top bit of the window */
sl@0: 	wend=0;		/* The bottom bit of the window */
sl@0: 
sl@0: 	if (!BN_one(r)) goto err;
sl@0: 
sl@0: 	for (;;)
sl@0: 		{
sl@0: 		if (BN_is_bit_set(p,wstart) == 0)
sl@0: 			{
sl@0: 			if (!start)
sl@0: 				if (!BN_mod_mul_reciprocal(r,r,r,&recp,ctx))
sl@0: 				goto err;
sl@0: 			if (wstart == 0) break;
sl@0: 			wstart--;
sl@0: 			continue;
sl@0: 			}
sl@0: 		/* We now have wstart on a 'set' bit, we now need to work out
sl@0: 		 * how bit a window to do.  To do this we need to scan
sl@0: 		 * forward until the last set bit before the end of the
sl@0: 		 * window */
sl@0: 		j=wstart;
sl@0: 		wvalue=1;
sl@0: 		wend=0;
sl@0: 		for (i=1; i<window; i++)
sl@0: 			{
sl@0: 			if (wstart-i < 0) break;
sl@0: 			if (BN_is_bit_set(p,wstart-i))
sl@0: 				{
sl@0: 				wvalue<<=(i-wend);
sl@0: 				wvalue|=1;
sl@0: 				wend=i;
sl@0: 				}
sl@0: 			}
sl@0: 
sl@0: 		/* wend is the size of the current window */
sl@0: 		j=wend+1;
sl@0: 		/* add the 'bytes above' */
sl@0: 		if (!start)
sl@0: 			for (i=0; i<j; i++)
sl@0: 				{
sl@0: 				if (!BN_mod_mul_reciprocal(r,r,r,&recp,ctx))
sl@0: 					goto err;
sl@0: 				}
sl@0: 		
sl@0: 		/* wvalue will be an odd number < 2^window */
sl@0: 		if (!BN_mod_mul_reciprocal(r,r,val[wvalue>>1],&recp,ctx))
sl@0: 			goto err;
sl@0: 
sl@0: 		/* move the 'window' down further */
sl@0: 		wstart-=wend+1;
sl@0: 		wvalue=0;
sl@0: 		start=0;
sl@0: 		if (wstart < 0) break;
sl@0: 		}
sl@0: 	ret=1;
sl@0: err:
sl@0: 	BN_CTX_end(ctx);
sl@0: 	BN_RECP_CTX_free(&recp);
sl@0: 	bn_check_top(r);
sl@0: 	return(ret);
sl@0: 	}
sl@0: 
sl@0: 
sl@0: EXPORT_C int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
sl@0: 		    const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
sl@0: 	{
sl@0: 	int i,j,bits,ret=0,wstart,wend,window,wvalue;
sl@0: 	int start=1;
sl@0: 	BIGNUM *d,*r;
sl@0: 	const BIGNUM *aa;
sl@0: 	/* Table of variables obtained from 'ctx' */
sl@0: 	BIGNUM *val[TABLE_SIZE];
sl@0: 	BN_MONT_CTX *mont=NULL;
sl@0: 
sl@0: 	if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0)
sl@0: 		{
sl@0: 		return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
sl@0: 		}
sl@0: 
sl@0: 	bn_check_top(a);
sl@0: 	bn_check_top(p);
sl@0: 	bn_check_top(m);
sl@0: 
sl@0: 	if (!BN_is_odd(m))
sl@0: 		{
sl@0: 		BNerr(BN_F_BN_MOD_EXP_MONT,BN_R_CALLED_WITH_EVEN_MODULUS);
sl@0: 		return(0);
sl@0: 		}
sl@0: 	bits=BN_num_bits(p);
sl@0: 	if (bits == 0)
sl@0: 		{
sl@0: 		ret = BN_one(rr);
sl@0: 		return ret;
sl@0: 		}
sl@0: 
sl@0: 	BN_CTX_start(ctx);
sl@0: 	d = BN_CTX_get(ctx);
sl@0: 	r = BN_CTX_get(ctx);
sl@0: 	val[0] = BN_CTX_get(ctx);
sl@0: 	if (!d || !r || !val[0]) goto err;
sl@0: 
sl@0: 	/* If this is not done, things will break in the montgomery
sl@0: 	 * part */
sl@0: 
sl@0: 	if (in_mont != NULL)
sl@0: 		mont=in_mont;
sl@0: 	else
sl@0: 		{
sl@0: 		if ((mont=BN_MONT_CTX_new()) == NULL) goto err;
sl@0: 		if (!BN_MONT_CTX_set(mont,m,ctx)) goto err;
sl@0: 		}
sl@0: 
sl@0: 	if (a->neg || BN_ucmp(a,m) >= 0)
sl@0: 		{
sl@0: 		if (!BN_nnmod(val[0],a,m,ctx))
sl@0: 			goto err;
sl@0: 		aa= val[0];
sl@0: 		}
sl@0: 	else
sl@0: 		aa=a;
sl@0: 	if (BN_is_zero(aa))
sl@0: 		{
sl@0: 		BN_zero(rr);
sl@0: 		ret = 1;
sl@0: 		goto err;
sl@0: 		}
sl@0: 	if (!BN_to_montgomery(val[0],aa,mont,ctx)) goto err; /* 1 */
sl@0: 
sl@0: 	window = BN_window_bits_for_exponent_size(bits);
sl@0: 	if (window > 1)
sl@0: 		{
sl@0: 		if (!BN_mod_mul_montgomery(d,val[0],val[0],mont,ctx)) goto err; /* 2 */
sl@0: 		j=1<<(window-1);
sl@0: 		for (i=1; i<j; i++)
sl@0: 			{
sl@0: 			if(((val[i] = BN_CTX_get(ctx)) == NULL) ||
sl@0: 					!BN_mod_mul_montgomery(val[i],val[i-1],
sl@0: 						d,mont,ctx))
sl@0: 				goto err;
sl@0: 			}
sl@0: 		}
sl@0: 
sl@0: 	start=1;	/* This is used to avoid multiplication etc
sl@0: 			 * when there is only the value '1' in the
sl@0: 			 * buffer. */
sl@0: 	wvalue=0;	/* The 'value' of the window */
sl@0: 	wstart=bits-1;	/* The top bit of the window */
sl@0: 	wend=0;		/* The bottom bit of the window */
sl@0: 
sl@0: 	if (!BN_to_montgomery(r,BN_value_one(),mont,ctx)) goto err;
sl@0: 	for (;;)
sl@0: 		{
sl@0: 		if (BN_is_bit_set(p,wstart) == 0)
sl@0: 			{
sl@0: 			if (!start)
sl@0: 				{
sl@0: 				if (!BN_mod_mul_montgomery(r,r,r,mont,ctx))
sl@0: 				goto err;
sl@0: 				}
sl@0: 			if (wstart == 0) break;
sl@0: 			wstart--;
sl@0: 			continue;
sl@0: 			}
sl@0: 		/* We now have wstart on a 'set' bit, we now need to work out
sl@0: 		 * how bit a window to do.  To do this we need to scan
sl@0: 		 * forward until the last set bit before the end of the
sl@0: 		 * window */
sl@0: 		j=wstart;
sl@0: 		wvalue=1;
sl@0: 		wend=0;
sl@0: 		for (i=1; i<window; i++)
sl@0: 			{
sl@0: 			if (wstart-i < 0) break;
sl@0: 			if (BN_is_bit_set(p,wstart-i))
sl@0: 				{
sl@0: 				wvalue<<=(i-wend);
sl@0: 				wvalue|=1;
sl@0: 				wend=i;
sl@0: 				}
sl@0: 			}
sl@0: 
sl@0: 		/* wend is the size of the current window */
sl@0: 		j=wend+1;
sl@0: 		/* add the 'bytes above' */
sl@0: 		if (!start)
sl@0: 			for (i=0; i<j; i++)
sl@0: 				{
sl@0: 				if (!BN_mod_mul_montgomery(r,r,r,mont,ctx))
sl@0: 					goto err;
sl@0: 				}
sl@0: 		
sl@0: 		/* wvalue will be an odd number < 2^window */
sl@0: 		if (!BN_mod_mul_montgomery(r,r,val[wvalue>>1],mont,ctx))
sl@0: 			goto err;
sl@0: 
sl@0: 		/* move the 'window' down further */
sl@0: 		wstart-=wend+1;
sl@0: 		wvalue=0;
sl@0: 		start=0;
sl@0: 		if (wstart < 0) break;
sl@0: 		}
sl@0: 	if (!BN_from_montgomery(rr,r,mont,ctx)) goto err;
sl@0: 	ret=1;
sl@0: err:
sl@0: 	if ((in_mont == NULL) && (mont != NULL)) BN_MONT_CTX_free(mont);
sl@0: 	BN_CTX_end(ctx);
sl@0: 	bn_check_top(rr);
sl@0: 	return(ret);
sl@0: 	}
sl@0: 
sl@0: 
sl@0: /* BN_mod_exp_mont_consttime() stores the precomputed powers in a specific layout
sl@0:  * so that accessing any of these table values shows the same access pattern as far
sl@0:  * as cache lines are concerned.  The following functions are used to transfer a BIGNUM
sl@0:  * from/to that table. */
sl@0: 
sl@0: static int MOD_EXP_CTIME_COPY_TO_PREBUF(BIGNUM *b, int top, unsigned char *buf, int idx, int width)
sl@0: 	{
sl@0: 	size_t i, j;
sl@0: 
sl@0: 	if (bn_wexpand(b, top) == NULL)
sl@0: 		return 0;
sl@0: 	while (b->top < top)
sl@0: 		{
sl@0: 		b->d[b->top++] = 0;
sl@0: 		}
sl@0: 	
sl@0: 	for (i = 0, j=idx; i < top * sizeof b->d[0]; i++, j+=width)
sl@0: 		{
sl@0: 		buf[j] = ((unsigned char*)b->d)[i];
sl@0: 		}
sl@0: 
sl@0: 	bn_correct_top(b);
sl@0: 	return 1;
sl@0: 	}
sl@0: 
sl@0: static int MOD_EXP_CTIME_COPY_FROM_PREBUF(BIGNUM *b, int top, unsigned char *buf, int idx, int width)
sl@0: 	{
sl@0: 	size_t i, j;
sl@0: 
sl@0: 	if (bn_wexpand(b, top) == NULL)
sl@0: 		return 0;
sl@0: 
sl@0: 	for (i=0, j=idx; i < top * sizeof b->d[0]; i++, j+=width)
sl@0: 		{
sl@0: 		((unsigned char*)b->d)[i] = buf[j];
sl@0: 		}
sl@0: 
sl@0: 	b->top = top;
sl@0: 	bn_correct_top(b);
sl@0: 	return 1;
sl@0: 	}	
sl@0: 
sl@0: /* Given a pointer value, compute the next address that is a cache line multiple. */
sl@0: #define MOD_EXP_CTIME_ALIGN(x_) \
sl@0: 	((unsigned char*)(x_) + (MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH - (((BN_ULONG)(x_)) & (MOD_EXP_CTIME_MIN_CACHE_LINE_MASK))))
sl@0: 
sl@0: /* This variant of BN_mod_exp_mont() uses fixed windows and the special
sl@0:  * precomputation memory layout to limit data-dependency to a minimum
sl@0:  * to protect secret exponents (cf. the hyper-threading timing attacks
sl@0:  * pointed out by Colin Percival,
sl@0:  * http://www.daemonology.net/hyperthreading-considered-harmful/)
sl@0:  */
sl@0: EXPORT_C int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
sl@0: 		    const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
sl@0: 	{
sl@0: 	int i,bits,ret=0,idx,window,wvalue;
sl@0: 	int top;
sl@0:  	BIGNUM *r;
sl@0: 	const BIGNUM *aa;
sl@0: 	BN_MONT_CTX *mont=NULL;
sl@0: 
sl@0: 	int numPowers;
sl@0: 	unsigned char *powerbufFree=NULL;
sl@0: 	int powerbufLen = 0;
sl@0: 	unsigned char *powerbuf=NULL;
sl@0: 	BIGNUM *computeTemp=NULL, *am=NULL;
sl@0: 
sl@0: 	bn_check_top(a);
sl@0: 	bn_check_top(p);
sl@0: 	bn_check_top(m);
sl@0: 
sl@0: 	top = m->top;
sl@0: 
sl@0: 	if (!(m->d[0] & 1))
sl@0: 		{
sl@0: 		BNerr(BN_F_BN_MOD_EXP_MONT_CONSTTIME,BN_R_CALLED_WITH_EVEN_MODULUS);
sl@0: 		return(0);
sl@0: 		}
sl@0: 	bits=BN_num_bits(p);
sl@0: 	if (bits == 0)
sl@0: 		{
sl@0: 		ret = BN_one(rr);
sl@0: 		return ret;
sl@0: 		}
sl@0: 
sl@0:  	/* Initialize BIGNUM context and allocate intermediate result */
sl@0: 	BN_CTX_start(ctx);
sl@0: 	r = BN_CTX_get(ctx);
sl@0: 	if (r == NULL) goto err;
sl@0: 
sl@0: 	/* Allocate a montgomery context if it was not supplied by the caller.
sl@0: 	 * If this is not done, things will break in the montgomery part.
sl@0:  	 */
sl@0: 	if (in_mont != NULL)
sl@0: 		mont=in_mont;
sl@0: 	else
sl@0: 		{
sl@0: 		if ((mont=BN_MONT_CTX_new()) == NULL) goto err;
sl@0: 		if (!BN_MONT_CTX_set(mont,m,ctx)) goto err;
sl@0: 		}
sl@0: 
sl@0: 	/* Get the window size to use with size of p. */
sl@0: 	window = BN_window_bits_for_ctime_exponent_size(bits);
sl@0: 
sl@0: 	/* Allocate a buffer large enough to hold all of the pre-computed
sl@0: 	 * powers of a.
sl@0: 	 */
sl@0: 	numPowers = 1 << window;
sl@0: 	powerbufLen = sizeof(m->d[0])*top*numPowers;
sl@0: 	if ((powerbufFree=(unsigned char*)OPENSSL_malloc(powerbufLen+MOD_EXP_CTIME_MIN_CACHE_LINE_WIDTH)) == NULL)
sl@0: 		goto err;
sl@0: 		
sl@0: 	powerbuf = MOD_EXP_CTIME_ALIGN(powerbufFree);
sl@0: 	memset(powerbuf, 0, powerbufLen);
sl@0: 
sl@0:  	/* Initialize the intermediate result. Do this early to save double conversion,
sl@0: 	 * once each for a^0 and intermediate result.
sl@0: 	 */
sl@0:  	if (!BN_to_montgomery(r,BN_value_one(),mont,ctx)) goto err;
sl@0: 	if (!MOD_EXP_CTIME_COPY_TO_PREBUF(r, top, powerbuf, 0, numPowers)) goto err;
sl@0: 
sl@0: 	/* Initialize computeTemp as a^1 with montgomery precalcs */
sl@0: 	computeTemp = BN_CTX_get(ctx);
sl@0: 	am = BN_CTX_get(ctx);
sl@0: 	if (computeTemp==NULL || am==NULL) goto err;
sl@0: 
sl@0: 	if (a->neg || BN_ucmp(a,m) >= 0)
sl@0: 		{
sl@0: 		if (!BN_mod(am,a,m,ctx))
sl@0: 			goto err;
sl@0: 		aa= am;
sl@0: 		}
sl@0: 	else
sl@0: 		aa=a;
sl@0: 	if (!BN_to_montgomery(am,aa,mont,ctx)) goto err;
sl@0: 	if (!BN_copy(computeTemp, am)) goto err;
sl@0: 	if (!MOD_EXP_CTIME_COPY_TO_PREBUF(am, top, powerbuf, 1, numPowers)) goto err;
sl@0: 
sl@0: 	/* If the window size is greater than 1, then calculate
sl@0: 	 * val[i=2..2^winsize-1]. Powers are computed as a*a^(i-1)
sl@0: 	 * (even powers could instead be computed as (a^(i/2))^2
sl@0: 	 * to use the slight performance advantage of sqr over mul).
sl@0: 	 */
sl@0: 	if (window > 1)
sl@0: 		{
sl@0: 		for (i=2; i<numPowers; i++)
sl@0: 			{
sl@0: 			/* Calculate a^i = a^(i-1) * a */
sl@0: 			if (!BN_mod_mul_montgomery(computeTemp,am,computeTemp,mont,ctx))
sl@0: 				goto err;
sl@0: 			if (!MOD_EXP_CTIME_COPY_TO_PREBUF(computeTemp, top, powerbuf, i, numPowers)) goto err;
sl@0: 			}
sl@0: 		}
sl@0: 
sl@0:  	/* Adjust the number of bits up to a multiple of the window size.
sl@0:  	 * If the exponent length is not a multiple of the window size, then
sl@0:  	 * this pads the most significant bits with zeros to normalize the
sl@0:  	 * scanning loop to there's no special cases.
sl@0:  	 *
sl@0:  	 * * NOTE: Making the window size a power of two less than the native
sl@0: 	 * * word size ensures that the padded bits won't go past the last
sl@0:  	 * * word in the internal BIGNUM structure. Going past the end will
sl@0:  	 * * still produce the correct result, but causes a different branch
sl@0:  	 * * to be taken in the BN_is_bit_set function.
sl@0:  	 */
sl@0:  	bits = ((bits+window-1)/window)*window;
sl@0:  	idx=bits-1;	/* The top bit of the window */
sl@0: 
sl@0:  	/* Scan the exponent one window at a time starting from the most
sl@0:  	 * significant bits.
sl@0:  	 */
sl@0:  	while (idx >= 0)
sl@0:   		{
sl@0:  		wvalue=0; /* The 'value' of the window */
sl@0:  		
sl@0:  		/* Scan the window, squaring the result as we go */
sl@0:  		for (i=0; i<window; i++,idx--)
sl@0:  			{
sl@0: 			if (!BN_mod_mul_montgomery(r,r,r,mont,ctx))	goto err;
sl@0: 			wvalue = (wvalue<<1)+BN_is_bit_set(p,idx);
sl@0:   			}
sl@0:  		
sl@0: 		/* Fetch the appropriate pre-computed value from the pre-buf */
sl@0: 		if (!MOD_EXP_CTIME_COPY_FROM_PREBUF(computeTemp, top, powerbuf, wvalue, numPowers)) goto err;
sl@0: 
sl@0:  		/* Multiply the result into the intermediate result */
sl@0:  		if (!BN_mod_mul_montgomery(r,r,computeTemp,mont,ctx)) goto err;
sl@0:   		}
sl@0: 
sl@0:  	/* Convert the final result from montgomery to standard format */
sl@0: 	if (!BN_from_montgomery(rr,r,mont,ctx)) goto err;
sl@0: 	ret=1;
sl@0: err:
sl@0: 	if ((in_mont == NULL) && (mont != NULL)) BN_MONT_CTX_free(mont);
sl@0: 	if (powerbuf!=NULL)
sl@0: 		{
sl@0: 		OPENSSL_cleanse(powerbuf,powerbufLen);
sl@0: 		OPENSSL_free(powerbufFree);
sl@0: 		}
sl@0:  	if (am!=NULL) BN_clear(am);
sl@0:  	if (computeTemp!=NULL) BN_clear(computeTemp);
sl@0: 	BN_CTX_end(ctx);
sl@0: 	return(ret);
sl@0: 	}
sl@0: 
sl@0: EXPORT_C int BN_mod_exp_mont_word(BIGNUM *rr, BN_ULONG a, const BIGNUM *p,
sl@0:                          const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
sl@0: 	{
sl@0: 	BN_MONT_CTX *mont = NULL;
sl@0: 	int b, bits, ret=0;
sl@0: 	int r_is_one;
sl@0: 	BN_ULONG w, next_w;
sl@0: 	BIGNUM *d, *r, *t;
sl@0: 	BIGNUM *swap_tmp;
sl@0: #define BN_MOD_MUL_WORD(r, w, m) \
sl@0: 		(BN_mul_word(r, (w)) && \
sl@0: 		(/* BN_ucmp(r, (m)) < 0 ? 1 :*/  \
sl@0: 			(BN_mod(t, r, m, ctx) && (swap_tmp = r, r = t, t = swap_tmp, 1))))
sl@0: 		/* BN_MOD_MUL_WORD is only used with 'w' large,
sl@0: 		 * so the BN_ucmp test is probably more overhead
sl@0: 		 * than always using BN_mod (which uses BN_copy if
sl@0: 		 * a similar test returns true). */
sl@0: 		/* We can use BN_mod and do not need BN_nnmod because our
sl@0: 		 * accumulator is never negative (the result of BN_mod does
sl@0: 		 * not depend on the sign of the modulus).
sl@0: 		 */
sl@0: #define BN_TO_MONTGOMERY_WORD(r, w, mont) \
sl@0: 		(BN_set_word(r, (w)) && BN_to_montgomery(r, r, (mont), ctx))
sl@0: 
sl@0: 	if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0)
sl@0: 		{
sl@0: 		/* BN_FLG_CONSTTIME only supported by BN_mod_exp_mont() */
sl@0: 		BNerr(BN_F_BN_MOD_EXP_MONT_WORD,ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);
sl@0: 		return -1;
sl@0: 		}
sl@0: 
sl@0: 	bn_check_top(p);
sl@0: 	bn_check_top(m);
sl@0: 
sl@0: 	if (!BN_is_odd(m))
sl@0: 		{
sl@0: 		BNerr(BN_F_BN_MOD_EXP_MONT_WORD,BN_R_CALLED_WITH_EVEN_MODULUS);
sl@0: 		return(0);
sl@0: 		}
sl@0: 	if (m->top == 1)
sl@0: 		a %= m->d[0]; /* make sure that 'a' is reduced */
sl@0: 
sl@0: 	bits = BN_num_bits(p);
sl@0: 	if (bits == 0)
sl@0: 		{
sl@0: 		ret = BN_one(rr);
sl@0: 		return ret;
sl@0: 		}
sl@0: 	if (a == 0)
sl@0: 		{
sl@0: 		BN_zero(rr);
sl@0: 		ret = 1;
sl@0: 		return ret;
sl@0: 		}
sl@0: 
sl@0: 	BN_CTX_start(ctx);
sl@0: 	d = BN_CTX_get(ctx);
sl@0: 	r = BN_CTX_get(ctx);
sl@0: 	t = BN_CTX_get(ctx);
sl@0: 	if (d == NULL || r == NULL || t == NULL) goto err;
sl@0: 
sl@0: 	if (in_mont != NULL)
sl@0: 		mont=in_mont;
sl@0: 	else
sl@0: 		{
sl@0: 		if ((mont = BN_MONT_CTX_new()) == NULL) goto err;
sl@0: 		if (!BN_MONT_CTX_set(mont, m, ctx)) goto err;
sl@0: 		}
sl@0: 
sl@0: 	r_is_one = 1; /* except for Montgomery factor */
sl@0: 
sl@0: 	/* bits-1 >= 0 */
sl@0: 
sl@0: 	/* The result is accumulated in the product r*w. */
sl@0: 	w = a; /* bit 'bits-1' of 'p' is always set */
sl@0: 	for (b = bits-2; b >= 0; b--)
sl@0: 		{
sl@0: 		/* First, square r*w. */
sl@0: 		next_w = w*w;
sl@0: 		if ((next_w/w) != w) /* overflow */
sl@0: 			{
sl@0: 			if (r_is_one)
sl@0: 				{
sl@0: 				if (!BN_TO_MONTGOMERY_WORD(r, w, mont)) goto err;
sl@0: 				r_is_one = 0;
sl@0: 				}
sl@0: 			else
sl@0: 				{
sl@0: 				if (!BN_MOD_MUL_WORD(r, w, m)) goto err;
sl@0: 				}
sl@0: 			next_w = 1;
sl@0: 			}
sl@0: 		w = next_w;
sl@0: 		if (!r_is_one)
sl@0: 			{
sl@0: 			if (!BN_mod_mul_montgomery(r, r, r, mont, ctx)) goto err;
sl@0: 			}
sl@0: 
sl@0: 		/* Second, multiply r*w by 'a' if exponent bit is set. */
sl@0: 		if (BN_is_bit_set(p, b))
sl@0: 			{
sl@0: 			next_w = w*a;
sl@0: 			if ((next_w/a) != w) /* overflow */
sl@0: 				{
sl@0: 				if (r_is_one)
sl@0: 					{
sl@0: 					if (!BN_TO_MONTGOMERY_WORD(r, w, mont)) goto err;
sl@0: 					r_is_one = 0;
sl@0: 					}
sl@0: 				else
sl@0: 					{
sl@0: 					if (!BN_MOD_MUL_WORD(r, w, m)) goto err;
sl@0: 					}
sl@0: 				next_w = a;
sl@0: 				}
sl@0: 			w = next_w;
sl@0: 			}
sl@0: 		}
sl@0: 
sl@0: 	/* Finally, set r:=r*w. */
sl@0: 	if (w != 1)
sl@0: 		{
sl@0: 		if (r_is_one)
sl@0: 			{
sl@0: 			if (!BN_TO_MONTGOMERY_WORD(r, w, mont)) goto err;
sl@0: 			r_is_one = 0;
sl@0: 			}
sl@0: 		else
sl@0: 			{
sl@0: 			if (!BN_MOD_MUL_WORD(r, w, m)) goto err;
sl@0: 			}
sl@0: 		}
sl@0: 
sl@0: 	if (r_is_one) /* can happen only if a == 1*/
sl@0: 		{
sl@0: 		if (!BN_one(rr)) goto err;
sl@0: 		}
sl@0: 	else
sl@0: 		{
sl@0: 		if (!BN_from_montgomery(rr, r, mont, ctx)) goto err;
sl@0: 		}
sl@0: 	ret = 1;
sl@0: err:
sl@0: 	if ((in_mont == NULL) && (mont != NULL)) BN_MONT_CTX_free(mont);
sl@0: 	BN_CTX_end(ctx);
sl@0: 	bn_check_top(rr);
sl@0: 	return(ret);
sl@0: 	}
sl@0: 
sl@0: 
sl@0: /* The old fallback, simple version :-) */
sl@0: EXPORT_C int BN_mod_exp_simple(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
sl@0: 		const BIGNUM *m, BN_CTX *ctx)
sl@0: 	{
sl@0: 	int i,j,bits,ret=0,wstart,wend,window,wvalue;
sl@0: 	int start=1;
sl@0: 	BIGNUM *d;
sl@0: 	/* Table of variables obtained from 'ctx' */
sl@0: 	BIGNUM *val[TABLE_SIZE];
sl@0: 
sl@0: 	if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0)
sl@0: 		{
sl@0: 		/* BN_FLG_CONSTTIME only supported by BN_mod_exp_mont() */
sl@0: 		BNerr(BN_F_BN_MOD_EXP_SIMPLE,ERR_R_SHOULD_NOT_HAVE_BEEN_CALLED);
sl@0: 		return -1;
sl@0: 		}
sl@0: 
sl@0: 	bits=BN_num_bits(p);
sl@0: 
sl@0: 	if (bits == 0)
sl@0: 		{
sl@0: 		ret = BN_one(r);
sl@0: 		return ret;
sl@0: 		}
sl@0: 
sl@0: 	BN_CTX_start(ctx);
sl@0: 	d = BN_CTX_get(ctx);
sl@0: 	val[0] = BN_CTX_get(ctx);
sl@0: 	if(!d || !val[0]) goto err;
sl@0: 
sl@0: 	if (!BN_nnmod(val[0],a,m,ctx)) goto err;		/* 1 */
sl@0: 	if (BN_is_zero(val[0]))
sl@0: 		{
sl@0: 		BN_zero(r);
sl@0: 		ret = 1;
sl@0: 		goto err;
sl@0: 		}
sl@0: 
sl@0: 	window = BN_window_bits_for_exponent_size(bits);
sl@0: 	if (window > 1)
sl@0: 		{
sl@0: 		if (!BN_mod_mul(d,val[0],val[0],m,ctx))
sl@0: 			goto err;				/* 2 */
sl@0: 		j=1<<(window-1);
sl@0: 		for (i=1; i<j; i++)
sl@0: 			{
sl@0: 			if(((val[i] = BN_CTX_get(ctx)) == NULL) ||
sl@0: 					!BN_mod_mul(val[i],val[i-1],d,m,ctx))
sl@0: 				goto err;
sl@0: 			}
sl@0: 		}
sl@0: 
sl@0: 	start=1;	/* This is used to avoid multiplication etc
sl@0: 			 * when there is only the value '1' in the
sl@0: 			 * buffer. */
sl@0: 	wvalue=0;	/* The 'value' of the window */
sl@0: 	wstart=bits-1;	/* The top bit of the window */
sl@0: 	wend=0;		/* The bottom bit of the window */
sl@0: 
sl@0: 	if (!BN_one(r)) goto err;
sl@0: 
sl@0: 	for (;;)
sl@0: 		{
sl@0: 		if (BN_is_bit_set(p,wstart) == 0)
sl@0: 			{
sl@0: 			if (!start)
sl@0: 				if (!BN_mod_mul(r,r,r,m,ctx))
sl@0: 				goto err;
sl@0: 			if (wstart == 0) break;
sl@0: 			wstart--;
sl@0: 			continue;
sl@0: 			}
sl@0: 		/* We now have wstart on a 'set' bit, we now need to work out
sl@0: 		 * how bit a window to do.  To do this we need to scan
sl@0: 		 * forward until the last set bit before the end of the
sl@0: 		 * window */
sl@0: 		j=wstart;
sl@0: 		wvalue=1;
sl@0: 		wend=0;
sl@0: 		for (i=1; i<window; i++)
sl@0: 			{
sl@0: 			if (wstart-i < 0) break;
sl@0: 			if (BN_is_bit_set(p,wstart-i))
sl@0: 				{
sl@0: 				wvalue<<=(i-wend);
sl@0: 				wvalue|=1;
sl@0: 				wend=i;
sl@0: 				}
sl@0: 			}
sl@0: 
sl@0: 		/* wend is the size of the current window */
sl@0: 		j=wend+1;
sl@0: 		/* add the 'bytes above' */
sl@0: 		if (!start)
sl@0: 			for (i=0; i<j; i++)
sl@0: 				{
sl@0: 				if (!BN_mod_mul(r,r,r,m,ctx))
sl@0: 					goto err;
sl@0: 				}
sl@0: 		
sl@0: 		/* wvalue will be an odd number < 2^window */
sl@0: 		if (!BN_mod_mul(r,r,val[wvalue>>1],m,ctx))
sl@0: 			goto err;
sl@0: 
sl@0: 		/* move the 'window' down further */
sl@0: 		wstart-=wend+1;
sl@0: 		wvalue=0;
sl@0: 		start=0;
sl@0: 		if (wstart < 0) break;
sl@0: 		}
sl@0: 	ret=1;
sl@0: err:
sl@0: 	BN_CTX_end(ctx);
sl@0: 	bn_check_top(r);
sl@0: 	return(ret);
sl@0: 	}
sl@0: