⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 bn_mont.c

📁 OpenSSL 0.9.8k 最新版OpenSSL
💻 C
📖 第 1 页 / 共 2 页
字号:
	np=n->d;	rp=r->d;	nrp= &(r->d[nl]);	/* clear the top words of T */#if 1	for (i=r->top; i<max; i++) /* memset? XXX */		r->d[i]=0;#else	memset(&(r->d[r->top]),0,(max-r->top)*sizeof(BN_ULONG)); #endif	r->top=max;	n0=mont->n0;#ifdef BN_COUNT	fprintf(stderr,"word BN_from_montgomery %d * %d\n",nl,nl);#endif	for (i=0; i<nl; i++)		{#ifdef __TANDEM                {                   long long t1;                   long long t2;                   long long t3;                   t1 = rp[0] * (n0 & 0177777);                   t2 = 037777600000l;                   t2 = n0 & t2;                   t3 = rp[0] & 0177777;                   t2 = (t3 * t2) & BN_MASK2;                   t1 = t1 + t2;                   v=bn_mul_add_words(rp,np,nl,(BN_ULONG) t1);                }#else		v=bn_mul_add_words(rp,np,nl,(rp[0]*n0)&BN_MASK2);#endif		nrp++;		rp++;		if (((nrp[-1]+=v)&BN_MASK2) >= v)			continue;		else			{			if (((++nrp[0])&BN_MASK2) != 0) continue;			if (((++nrp[1])&BN_MASK2) != 0) continue;			for (x=2; (((++nrp[x])&BN_MASK2) == 0); x++) ;			}		}	bn_correct_top(r);		/* mont->ri will be a multiple of the word size and below code	 * is kind of BN_rshift(ret,r,mont->ri) equivalent */	if (r->top <= ri)		{		ret->top=0;		retn=1;		goto err;		}	al=r->top-ri;# define BRANCH_FREE 1# if BRANCH_FREE	if (bn_wexpand(ret,ri) == NULL) goto err;	x=0-(((al-ri)>>(sizeof(al)*8-1))&1);	ret->top=x=(ri&~x)|(al&x);	/* min(ri,al) */	ret->neg=r->neg;	rp=ret->d;	ap=&(r->d[ri]);	{	size_t m1,m2;	v=bn_sub_words(rp,ap,np,ri);	/* this ----------------^^ works even in al<ri case	 * thanks to zealous zeroing of top of the vector in the	 * beginning. */	/* if (al==ri && !v) || al>ri) nrp=rp; else nrp=ap; */	/* in other words if subtraction result is real, then	 * trick unconditional memcpy below to perform in-place	 * "refresh" instead of actual copy. */	m1=0-(size_t)(((al-ri)>>(sizeof(al)*8-1))&1);	/* al<ri */	m2=0-(size_t)(((ri-al)>>(sizeof(al)*8-1))&1);	/* al>ri */	m1|=m2;			/* (al!=ri) */	m1|=(0-(size_t)v);	/* (al!=ri || v) */	m1&=~m2;		/* (al!=ri || v) && !al>ri */	nrp=(BN_ULONG *)(((size_t)rp&~m1)|((size_t)ap&m1));	}	/* 'i<ri' is chosen to eliminate dependency on input data, even	 * though it results in redundant copy in al<ri case. */	for (i=0,ri-=4; i<ri; i+=4)		{		BN_ULONG t1,t2,t3,t4;				t1=nrp[i+0];		t2=nrp[i+1];		t3=nrp[i+2];	ap[i+0]=0;		t4=nrp[i+3];	ap[i+1]=0;		rp[i+0]=t1;	ap[i+2]=0;		rp[i+1]=t2;	ap[i+3]=0;		rp[i+2]=t3;		rp[i+3]=t4;		}	for (ri+=4; i<ri; i++)		rp[i]=nrp[i], ap[i]=0;	bn_correct_top(r);	bn_correct_top(ret);# else	if (bn_wexpand(ret,al) == NULL) goto err;	ret->top=al;	ret->neg=r->neg;	rp=ret->d;	ap=&(r->d[ri]);	al-=4;	for (i=0; i<al; i+=4)		{		BN_ULONG t1,t2,t3,t4;				t1=ap[i+0];		t2=ap[i+1];		t3=ap[i+2];		t4=ap[i+3];		rp[i+0]=t1;		rp[i+1]=t2;		rp[i+2]=t3;		rp[i+3]=t4;		}	al+=4;	for (; i<al; i++)		rp[i]=ap[i];# endif#else /* !MONT_WORD */ 	BIGNUM *t1,*t2;	BN_CTX_start(ctx);	t1 = BN_CTX_get(ctx);	t2 = BN_CTX_get(ctx);	if (t1 == NULL || t2 == NULL) goto err;		if (!BN_copy(t1,a)) goto err;	BN_mask_bits(t1,mont->ri);	if (!BN_mul(t2,t1,&mont->Ni,ctx)) goto err;	BN_mask_bits(t2,mont->ri);	if (!BN_mul(t1,t2,&mont->N,ctx)) goto err;	if (!BN_add(t2,a,t1)) goto err;	if (!BN_rshift(ret,t2,mont->ri)) goto err;#endif /* MONT_WORD */#if !defined(BRANCH_FREE) || BRANCH_FREE==0	if (BN_ucmp(ret, &(mont->N)) >= 0)		{		if (!BN_usub(ret,ret,&(mont->N))) goto err;		}#endif	retn=1;	bn_check_top(ret); err:	BN_CTX_end(ctx);	return(retn);	}#endif /* MONT_FROM_WORD___NON_DEFAULT_0_9_8_BUILD */BN_MONT_CTX *BN_MONT_CTX_new(void)	{	BN_MONT_CTX *ret;	if ((ret=(BN_MONT_CTX *)OPENSSL_malloc(sizeof(BN_MONT_CTX))) == NULL)		return(NULL);	BN_MONT_CTX_init(ret);	ret->flags=BN_FLG_MALLOCED;	return(ret);	}void BN_MONT_CTX_init(BN_MONT_CTX *ctx)	{	ctx->ri=0;	BN_init(&(ctx->RR));	BN_init(&(ctx->N));	BN_init(&(ctx->Ni));#if 0 /* for OpenSSL 0.9.9 mont->n0 */	ctx->n0[0] = ctx->n0[1] = 0;#else	ctx->n0 = 0;#endif	ctx->flags=0;	}void BN_MONT_CTX_free(BN_MONT_CTX *mont)	{	if(mont == NULL)	    return;	BN_free(&(mont->RR));	BN_free(&(mont->N));	BN_free(&(mont->Ni));	if (mont->flags & BN_FLG_MALLOCED)		OPENSSL_free(mont);	}int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod, BN_CTX *ctx)	{	int ret = 0;	BIGNUM *Ri,*R;	BN_CTX_start(ctx);	if((Ri = BN_CTX_get(ctx)) == NULL) goto err;	R= &(mont->RR);					/* grab RR as a temp */	if (!BN_copy(&(mont->N),mod)) goto err;		/* Set N */	mont->N.neg = 0;#ifdef MONT_WORD		{		BIGNUM tmod;		BN_ULONG buf[2];		mont->ri=(BN_num_bits(mod)+(BN_BITS2-1))/BN_BITS2*BN_BITS2;		BN_zero(R);#if 0 /* for OpenSSL 0.9.9 mont->n0, would be "#if defined(OPENSSL_BN_ASM_MONT) && (BN_BITS2<=32)",         only certain BN_BITS2<=32 platforms actually need this */		if (!(BN_set_bit(R,2*BN_BITS2))) goto err;	/* R */#else		if (!(BN_set_bit(R,BN_BITS2))) goto err;	/* R */#endif		buf[0]=mod->d[0]; /* tmod = N mod word size */		buf[1]=0;		BN_init(&tmod);		tmod.d=buf;		tmod.top = buf[0] != 0 ? 1 : 0;		tmod.dmax=2;		tmod.neg=0;#if 0 /* for OpenSSL 0.9.9 mont->n0, would be "#if defined(OPENSSL_BN_ASM_MONT) && (BN_BITS2<=32)";         only certain BN_BITS2<=32 platforms actually need this */								tmod.top=0;		if ((buf[0] = mod->d[0]))			tmod.top=1;		if ((buf[1] = mod->top>1 ? mod->d[1] : 0))	tmod.top=2;		if ((BN_mod_inverse(Ri,R,&tmod,ctx)) == NULL)			goto err;		if (!BN_lshift(Ri,Ri,2*BN_BITS2)) goto err; /* R*Ri */		if (!BN_is_zero(Ri))			{			if (!BN_sub_word(Ri,1)) goto err;			}		else /* if N mod word size == 1 */			{			if (bn_expand(Ri,(int)sizeof(BN_ULONG)*2) == NULL)				goto err;			/* Ri-- (mod double word size) */			Ri->neg=0;			Ri->d[0]=BN_MASK2;			Ri->d[1]=BN_MASK2;			Ri->top=2;			}		if (!BN_div(Ri,NULL,Ri,&tmod,ctx)) goto err;		/* Ni = (R*Ri-1)/N,		 * keep only couple of least significant words: */		mont->n0[0] = (Ri->top > 0) ? Ri->d[0] : 0;		mont->n0[1] = (Ri->top > 1) ? Ri->d[1] : 0;#else							/* Ri = R^-1 mod N*/		if ((BN_mod_inverse(Ri,R,&tmod,ctx)) == NULL)			goto err;		if (!BN_lshift(Ri,Ri,BN_BITS2)) goto err; /* R*Ri */		if (!BN_is_zero(Ri))			{			if (!BN_sub_word(Ri,1)) goto err;			}		else /* if N mod word size == 1 */			{			if (!BN_set_word(Ri,BN_MASK2)) goto err;  /* Ri-- (mod word size) */			}		if (!BN_div(Ri,NULL,Ri,&tmod,ctx)) goto err;		/* Ni = (R*Ri-1)/N,		 * keep only least significant word: */# if 0 /* for OpenSSL 0.9.9 mont->n0 */		mont->n0[0] = (Ri->top > 0) ? Ri->d[0] : 0;		mont->n0[1] = 0;# else		mont->n0 = (Ri->top > 0) ? Ri->d[0] : 0;# endif#endif		}#else /* !MONT_WORD */		{ /* bignum version */		mont->ri=BN_num_bits(&mont->N);		BN_zero(R);		if (!BN_set_bit(R,mont->ri)) goto err;  /* R = 2^ri */		                                        /* Ri = R^-1 mod N*/		if ((BN_mod_inverse(Ri,R,&mont->N,ctx)) == NULL)			goto err;		if (!BN_lshift(Ri,Ri,mont->ri)) goto err; /* R*Ri */		if (!BN_sub_word(Ri,1)) goto err;							/* Ni = (R*Ri-1) / N */		if (!BN_div(&(mont->Ni),NULL,Ri,&mont->N,ctx)) goto err;		}#endif	/* setup RR for conversions */	BN_zero(&(mont->RR));	if (!BN_set_bit(&(mont->RR),mont->ri*2)) goto err;	if (!BN_mod(&(mont->RR),&(mont->RR),&(mont->N),ctx)) goto err;	ret = 1;err:	BN_CTX_end(ctx);	return ret;	}BN_MONT_CTX *BN_MONT_CTX_copy(BN_MONT_CTX *to, BN_MONT_CTX *from)	{	if (to == from) return(to);	if (!BN_copy(&(to->RR),&(from->RR))) return NULL;	if (!BN_copy(&(to->N),&(from->N))) return NULL;	if (!BN_copy(&(to->Ni),&(from->Ni))) return NULL;	to->ri=from->ri;#if 0 /* for OpenSSL 0.9.9 mont->n0 */	to->n0[0]=from->n0[0];	to->n0[1]=from->n0[1];#else	to->n0=from->n0;#endif	return(to);	}BN_MONT_CTX *BN_MONT_CTX_set_locked(BN_MONT_CTX **pmont, int lock,					const BIGNUM *mod, BN_CTX *ctx)	{	int got_write_lock = 0;	BN_MONT_CTX *ret;	CRYPTO_r_lock(lock);	if (!*pmont)		{		CRYPTO_r_unlock(lock);		CRYPTO_w_lock(lock);		got_write_lock = 1;		if (!*pmont)			{			ret = BN_MONT_CTX_new();			if (ret && !BN_MONT_CTX_set(ret, mod, ctx))				BN_MONT_CTX_free(ret);			else				*pmont = ret;			}		}		ret = *pmont;		if (got_write_lock)		CRYPTO_w_unlock(lock);	else		CRYPTO_r_unlock(lock);			return ret;	}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -