BN_free(&A);	BN_free(&B);	BN_free(&n);	return(1);	}int test_mod(BIO *bp, BN_CTX *ctx)	{	BIGNUM *a,*b,*c,*d,*e;	int i;	a=BN_new();	b=BN_new();	c=BN_new();	d=BN_new();	e=BN_new();	BN_bntest_rand(a,1024,0,0); /**/	for (i=0; i<num0; i++)		{		BN_bntest_rand(b,450+i*10,0,0); /**/		a->neg=rand_neg();		b->neg=rand_neg();		BN_mod(c,a,b,ctx);/**/		if (bp != NULL)			{			if (!results)				{				BN_print(bp,a);				BIO_puts(bp," % ");				BN_print(bp,b);				BIO_puts(bp," - ");				}			BN_print(bp,c);			BIO_puts(bp,"\n");			}		BN_div(d,e,a,b,ctx);		BN_sub(e,e,c);		if(!BN_is_zero(e))		    {		    fprintf(stderr,"Modulo test failed!\n");		    return 0;		    }		}	BN_free(a);	BN_free(b);	BN_free(c);	BN_free(d);	BN_free(e);	return(1);	}int test_mod_mul(BIO *bp, BN_CTX *ctx)	{	BIGNUM *a,*b,*c,*d,*e;	int i,j;	a=BN_new();	b=BN_new();	c=BN_new();	d=BN_new();	e=BN_new();	for (j=0; j<3; j++) {	BN_bntest_rand(c,1024,0,0); /**/	for (i=0; i<num0; i++)		{		BN_bntest_rand(a,475+i*10,0,0); /**/		BN_bntest_rand(b,425+i*11,0,0); /**/		a->neg=rand_neg();		b->neg=rand_neg();		if (!BN_mod_mul(e,a,b,c,ctx))			{			unsigned long l;			while ((l=ERR_get_error()))				fprintf(stderr,"ERROR:%s\n",					ERR_error_string(l,NULL));			EXIT(1);			}		if (bp != NULL)			{			if (!results)				{				BN_print(bp,a);				BIO_puts(bp," * ");				BN_print(bp,b);				BIO_puts(bp," % ");				BN_print(bp,c);				if ((a->neg ^ b->neg) && !BN_is_zero(e))					{					/* If  (a*b) % c  is negative,  c  must be added					 * in order to obtain the normalized remainder					 * (new with OpenSSL 0.9.7, previous versions of					 * BN_mod_mul could generate negative results)					 */					BIO_puts(bp," + ");					BN_print(bp,c);					}				BIO_puts(bp," - ");				}			BN_print(bp,e);			BIO_puts(bp,"\n");			}		BN_mul(d,a,b,ctx);		BN_sub(d,d,e);		BN_div(a,b,d,c,ctx);		if(!BN_is_zero(b))		    {		    fprintf(stderr,"Modulo multiply test failed!\n");		    ERR_print_errors_fp(stderr);		    return 0;		    }		}	}	BN_free(a);	BN_free(b);	BN_free(c);	BN_free(d);	BN_free(e);	return(1);	}int test_mod_exp(BIO *bp, BN_CTX *ctx)	{	BIGNUM *a,*b,*c,*d,*e;	int i;	a=BN_new();	b=BN_new();	c=BN_new();	d=BN_new();	e=BN_new();	BN_bntest_rand(c,30,0,1); /* must be odd for montgomery */	for (i=0; i<num2; i++)		{		BN_bntest_rand(a,20+i*5,0,0); /**/		BN_bntest_rand(b,2+i,0,0); /**/		if (!BN_mod_exp(d,a,b,c,ctx))			return(00);		if (bp != NULL)			{			if (!results)				{				BN_print(bp,a);				BIO_puts(bp," ^ ");				BN_print(bp,b);				BIO_puts(bp," % ");				BN_print(bp,c);				BIO_puts(bp," - ");				}			BN_print(bp,d);			BIO_puts(bp,"\n");			}		BN_exp(e,a,b,ctx);		BN_sub(e,e,d);		BN_div(a,b,e,c,ctx);		if(!BN_is_zero(b))		    {		    fprintf(stderr,"Modulo exponentiation test failed!\n");		    return 0;		    }		}	BN_free(a);	BN_free(b);	BN_free(c);	BN_free(d);	BN_free(e);	return(1);	}int test_mod_exp_mont_consttime(BIO *bp, BN_CTX *ctx)	{	BIGNUM *a,*b,*c,*d,*e;	int i;	a=BN_new();	b=BN_new();	c=BN_new();	d=BN_new();	e=BN_new();	BN_bntest_rand(c,30,0,1); /* must be odd for montgomery */	for (i=0; i<num2; i++)		{		BN_bntest_rand(a,20+i*5,0,0); /**/		BN_bntest_rand(b,2+i,0,0); /**/		if (!BN_mod_exp_mont_consttime(d,a,b,c,ctx,NULL))			return(00);		if (bp != NULL)			{			if (!results)				{				BN_print(bp,a);				BIO_puts(bp," ^ ");				BN_print(bp,b);				BIO_puts(bp," % ");				BN_print(bp,c);				BIO_puts(bp," - ");				}			BN_print(bp,d);			BIO_puts(bp,"\n");			}		BN_exp(e,a,b,ctx);		BN_sub(e,e,d);		BN_div(a,b,e,c,ctx);		if(!BN_is_zero(b))		    {		    fprintf(stderr,"Modulo exponentiation test failed!\n");		    return 0;		    }		}	BN_free(a);	BN_free(b);	BN_free(c);	BN_free(d);	BN_free(e);	return(1);	}int test_exp(BIO *bp, BN_CTX *ctx)	{	BIGNUM *a,*b,*d,*e,*one;	int i;	a=BN_new();	b=BN_new();	d=BN_new();	e=BN_new();	one=BN_new();	BN_one(one);	for (i=0; i<num2; i++)		{		BN_bntest_rand(a,20+i*5,0,0); /**/		BN_bntest_rand(b,2+i,0,0); /**/		if (!BN_exp(d,a,b,ctx))			return(00);		if (bp != NULL)			{			if (!results)				{				BN_print(bp,a);				BIO_puts(bp," ^ ");				BN_print(bp,b);				BIO_puts(bp," - ");				}			BN_print(bp,d);			BIO_puts(bp,"\n");			}		BN_one(e);		for( ; !BN_is_zero(b) ; BN_sub(b,b,one))		    BN_mul(e,e,a,ctx);		BN_sub(e,e,d);		if(!BN_is_zero(e))		    {		    fprintf(stderr,"Exponentiation test failed!\n");		    return 0;		    }		}	BN_free(a);	BN_free(b);	BN_free(d);	BN_free(e);	BN_free(one);	return(1);	}static void genprime_cb(int p, int n, void *arg)	{	char c='*';	if (p == 0) c='.';	if (p == 1) c='+';	if (p == 2) c='*';	if (p == 3) c='\n';	putc(c, stderr);	fflush(stderr);	(void)n;	(void)arg;	}int test_kron(BIO *bp, BN_CTX *ctx)	{	BIGNUM *a,*b,*r,*t;	int i;	int legendre, kronecker;	int ret = 0;	a = BN_new();	b = BN_new();	r = BN_new();	t = BN_new();	if (a == NULL || b == NULL || r == NULL || t == NULL) goto err;		/* We test BN_kronecker(a, b, ctx) just for  b  odd (Jacobi symbol).	 * In this case we know that if  b  is prime, then BN_kronecker(a, b, ctx)	 * is congruent to $a^{(b-1)/2}$, modulo $b$ (Legendre symbol).	 * So we generate a random prime  b  and compare these values	 * for a number of random  a's.  (That is, we run the Solovay-Strassen	 * primality test to confirm that  b  is prime, except that we	 * don't want to test whether  b  is prime but whether BN_kronecker	 * works.) */	if (!BN_generate_prime(b, 512, 0, NULL, NULL, genprime_cb, NULL)) goto err;	b->neg = rand_neg();	putc('\n', stderr);	for (i = 0; i < num0; i++)		{		if (!BN_bntest_rand(a, 512, 0, 0)) goto err;		a->neg = rand_neg();		/* t := (|b|-1)/2  (note that b is odd) */		if (!BN_copy(t, b)) goto err;		t->neg = 0;		if (!BN_sub_word(t, 1)) goto err;		if (!BN_rshift1(t, t)) goto err;		/* r := a^t mod b */		b->neg=0;				if (!BN_mod_exp_recp(r, a, t, b, ctx)) goto err;		b->neg=1;		if (BN_is_word(r, 1))			legendre = 1;		else if (BN_is_zero(r))			legendre = 0;		else			{			if (!BN_add_word(r, 1)) goto err;			if (0 != BN_ucmp(r, b))				{				fprintf(stderr, "Legendre symbol computation failed\n");				goto err;				}			legendre = -1;			}				kronecker = BN_kronecker(a, b, ctx);		if (kronecker < -1) goto err;		/* we actually need BN_kronecker(a, |b|) */		if (a->neg && b->neg)			kronecker = -kronecker;				if (legendre != kronecker)			{			fprintf(stderr, "legendre != kronecker; a = ");			BN_print_fp(stderr, a);			fprintf(stderr, ", b = ");			BN_print_fp(stderr, b);			fprintf(stderr, "\n");			goto err;			}		putc('.', stderr);		fflush(stderr);		}	putc('\n', stderr);	fflush(stderr);	ret = 1; err:	if (a != NULL) BN_free(a);	if (b != NULL) BN_free(b);	if (r != NULL) BN_free(r);	if (t != NULL) BN_free(t);	return ret;	}int test_sqrt(BIO *bp, BN_CTX *ctx)	{	BIGNUM *a,*p,*r;	int i, j;	int ret = 0;	a = BN_new();	p = BN_new();	r = BN_new();	if (a == NULL || p == NULL || r == NULL) goto err;		for (i = 0; i < 16; i++)		{		if (i < 8)			{			unsigned primes[8] = { 2, 3, 5, 7, 11, 13, 17, 19 };						if (!BN_set_word(p, primes[i])) goto err;			}		else			{			if (!BN_set_word(a, 32)) goto err;			if (!BN_set_word(r, 2*i + 1)) goto err;					if (!BN_generate_prime(p, 256, 0, a, r, genprime_cb, NULL)) goto err;			putc('\n', stderr);			}		p->neg = rand_neg();		for (j = 0; j < num2; j++)			{			/* construct 'a' such that it is a square modulo p,			 * but in general not a proper square and not reduced modulo p */			if (!BN_bntest_rand(r, 256, 0, 3)) goto err;			if (!BN_nnmod(r, r, p, ctx)) goto err;			if (!BN_mod_sqr(r, r, p, ctx)) goto err;			if (!BN_bntest_rand(a, 256, 0, 3)) goto err;			if (!BN_nnmod(a, a, p, ctx)) goto err;			if (!BN_mod_sqr(a, a, p, ctx)) goto err;			if (!BN_mul(a, a, r, ctx)) goto err;			if (rand_neg())				if (!BN_sub(a, a, p)) goto err;			if (!BN_mod_sqrt(r, a, p, ctx)) goto err;			if (!BN_mod_sqr(r, r, p, ctx)) goto err;			if (!BN_nnmod(a, a, p, ctx)) goto err;			if (BN_cmp(a, r) != 0)				{				fprintf(stderr, "BN_mod_sqrt failed: a = ");				BN_print_fp(stderr, a);				fprintf(stderr, ", r = ");				BN_print_fp(stderr, r);				fprintf(stderr, ", p = ");				BN_print_fp(stderr, p);				fprintf(stderr, "\n");				goto err;				}			putc('.', stderr);			fflush(stderr);			}				putc('\n', stderr);		fflush(stderr);		}	ret = 1; err:	if (a != NULL) BN_free(a);	if (p != NULL) BN_free(p);	if (r != NULL) BN_free(r);	return ret;	}int test_lshift(BIO *bp,BN_CTX *ctx,BIGNUM *a_)	{	BIGNUM *a,*b,*c,*d;	int i;	b=BN_new();	c=BN_new();	d=BN_new();	BN_one(c);	if(a_)	    a=a_;	else	    {	    a=BN_new();	    BN_bntest_rand(a,200,0,0); /**/	    a->neg=rand_neg();	    }	for (i=0; i<num0; i++)		{		BN_lshift(b,a,i+1);		BN_add(c,c,c);		if (bp != NULL)			{			if (!results)				{				BN_print(bp,a);				BIO_puts(bp," * ");				BN_print(bp,c);				BIO_puts(bp," - ");				}			BN_print(bp,b);			BIO_puts(bp,"\n");			}		BN_mul(d,a,c,ctx);		BN_sub(d,d,b);		if(!BN_is_zero(d))		    {		    fprintf(stderr,"Left shift test failed!\n");		    fprintf(stderr,"a=");		    BN_print_fp(stderr,a);		    fprintf(stderr,"\nb=");		    BN_print_fp(stderr,b);		    fprintf(stderr,"\nc=");		    BN_print_fp(stderr,c);		    fprintf(stderr,"\nd=");		    BN_print_fp(stderr,d);		    fprintf(stderr,"\n");		    return 0;		    }		}	BN_free(a);	BN_free(b);	BN_free(c);	BN_free(d);	return(1);	}int test_lshift1(BIO *bp)	{	BIGNUM *a,*b,*c;	int i;	a=BN_new();	b=BN_new();	c=BN_new();	BN_bntest_rand(a,200,0,0); /**/	a->neg=rand_neg();	for (i=0; i<num0; i++)		{		BN_lshift1(b,a);		if (bp != NULL)			{			if (!results)				{				BN_print(bp,a);				BIO_puts(bp," * 2");				BIO_puts(bp," - ");				}			BN_print(bp,b);			BIO_puts(bp,"\n");			}		BN_add(c,a,a);		BN_sub(a,b,c);		if(!BN_is_zero(a))		    {		    fprintf(stderr,"Left shift one test failed!\n");		    return 0;		    }				BN_copy(a,b);		}	BN_free(a);	BN_free(b);	BN_free(c);	return(1);	}int test_rshift(BIO *bp,BN_CTX *ctx)	{	BIGNUM *a,*b,*c,*d,*e;	int i;	a=BN_new();	b=BN_new();	c=BN_new();	d=BN_new();	e=BN_new();	BN_one(c);	BN_bntest_rand(a,200,0,0); /**/	a->neg=rand_neg();	for (i=0; i<num0; i++)		{		BN_rshift(b,a,i+1);		BN_add(c,c,c);		if (bp != NULL)			{			if (!results)				{				BN_print(bp,a);				BIO_puts(bp," / ");				BN_print(bp,c);				BIO_puts(bp," - ");				}			BN_print(bp,b);			BIO_puts(bp,"\n");			}		BN_div(d,e,a,c,ctx);		BN_sub(d,d,b);		if(!BN_is_zero(d))		    {		    fprintf(stderr,"Right shift test failed!\n");		    return 0;		    }		}	BN_free(a);	BN_free(b);	BN_free(c);	BN_free(d);	BN_free(e);	return(1);	}int test_rshift1(BIO *bp)	{	BIGNUM *a,*b,*c;	int i;	a=BN_new();	b=BN_new();	c=BN_new();	BN_bntest_rand(a,200,0,0); /**/	a->neg=rand_neg();	for (i=0; i<num0; i++)		{		BN_rshift1(b,a);		if (bp != NULL)			{			if (!results)				{				BN_print(bp,a);				BIO_puts(bp," / 2");				BIO_puts(bp," - ");				}			BN_print(bp,b);			BIO_puts(bp,"\n");			}		BN_sub(c,a,b);		BN_sub(c,c,b);		if(!BN_is_zero(c) && !BN_abs_is_word(c, 1))		    {		    fprintf(stderr,"Right shift one test failed!\n");		    return 0;		    }		BN_copy(a,b);		}	BN_free(a);	BN_free(b);	BN_free(c);	return(1);	}int rand_neg(void)	{	static unsigned int neg=0;	static int sign[8]={0,0,0,1,1,0,1,1};	return(sign[(neg++)%8]);	}