1 /* crypto/bn/bntest.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.]
65 #include <openssl/bio.h>
66 #include <openssl/bn.h>
67 #include <openssl/rand.h>
68 #include <openssl/x509.h>
69 #include <openssl/err.h>
71 const int num0 = 100; /* number of tests */
72 const int num1 = 50; /* additional tests for some functions */
73 const int num2 = 5; /* number of tests for slow functions */
75 int test_add(BIO *bp);
76 int test_sub(BIO *bp);
77 int test_lshift1(BIO *bp);
78 int test_lshift(BIO *bp,BN_CTX *ctx,BIGNUM *a_);
79 int test_rshift1(BIO *bp);
80 int test_rshift(BIO *bp,BN_CTX *ctx);
81 int test_div(BIO *bp,BN_CTX *ctx);
82 int test_div_recp(BIO *bp,BN_CTX *ctx);
83 int test_mul(BIO *bp);
84 int test_sqr(BIO *bp,BN_CTX *ctx);
85 int test_mont(BIO *bp,BN_CTX *ctx);
86 int test_mod(BIO *bp,BN_CTX *ctx);
87 int test_mod_mul(BIO *bp,BN_CTX *ctx);
88 int test_mod_exp(BIO *bp,BN_CTX *ctx);
89 int test_exp(BIO *bp,BN_CTX *ctx);
90 int test_kron(BIO *bp,BN_CTX *ctx);
91 int test_sqrt(BIO *bp,BN_CTX *ctx);
95 static unsigned char lst[]="\xC6\x4F\x43\x04\x2A\xEA\xCA\x6E\x58\x36\x80\x5B\xE8\xC9"
96 "\x9B\x04\x5D\x48\x36\xC2\xFD\x16\xC9\x64\xF0";
98 static const char rnd_seed[] = "string to make the random number generator think it has entropy";
100 static void message(BIO *out, char *m)
102 fprintf(stderr, "test %s\n", m);
103 BIO_puts(out, "print \"test ");
105 BIO_puts(out, "\\n\"\n");
108 int main(int argc, char *argv[])
116 RAND_seed(rnd_seed, sizeof rnd_seed); /* or BN_generate_prime may fail */
122 if (strcmp(*argv,"-results") == 0)
124 else if (strcmp(*argv,"-out") == 0)
126 if (--argc < 1) break;
135 if (ctx == NULL) EXIT(1);
137 out=BIO_new(BIO_s_file());
138 if (out == NULL) EXIT(1);
141 BIO_set_fp(out,stdout,BIO_NOCLOSE);
145 if (!BIO_write_filename(out,outfile))
153 BIO_puts(out,"obase=16\nibase=16\n");
155 message(out,"BN_add");
156 if (!test_add(out)) goto err;
159 message(out,"BN_sub");
160 if (!test_sub(out)) goto err;
163 message(out,"BN_lshift1");
164 if (!test_lshift1(out)) goto err;
167 message(out,"BN_lshift (fixed)");
168 if (!test_lshift(out,ctx,BN_bin2bn(lst,sizeof(lst)-1,NULL)))
172 message(out,"BN_lshift");
173 if (!test_lshift(out,ctx,NULL)) goto err;
176 message(out,"BN_rshift1");
177 if (!test_rshift1(out)) goto err;
180 message(out,"BN_rshift");
181 if (!test_rshift(out,ctx)) goto err;
184 message(out,"BN_sqr");
185 if (!test_sqr(out,ctx)) goto err;
188 message(out,"BN_mul");
189 if (!test_mul(out)) goto err;
192 message(out,"BN_div");
193 if (!test_div(out,ctx)) goto err;
196 message(out,"BN_div_recp");
197 if (!test_div_recp(out,ctx)) goto err;
200 message(out,"BN_mod");
201 if (!test_mod(out,ctx)) goto err;
204 message(out,"BN_mod_mul");
205 if (!test_mod_mul(out,ctx)) goto err;
208 message(out,"BN_mont");
209 if (!test_mont(out,ctx)) goto err;
212 message(out,"BN_mod_exp");
213 if (!test_mod_exp(out,ctx)) goto err;
216 message(out,"BN_exp");
217 if (!test_exp(out,ctx)) goto err;
220 message(out,"BN_kronecker");
221 if (!test_kron(out,ctx)) goto err;
224 message(out,"BN_mod_sqrt");
225 if (!test_sqrt(out,ctx)) goto err;
234 BIO_puts(out,"1\n"); /* make sure the Perl script fed by bc notices
235 * the failure, see test_bn in test/Makefile */
237 ERR_load_crypto_strings();
238 ERR_print_errors_fp(stderr);
243 int test_add(BIO *bp)
252 BN_bntest_rand(&a,512,0,0);
253 for (i=0; i<num0; i++)
255 BN_bntest_rand(&b,450+i,0,0);
277 fprintf(stderr,"Add test failed!\n");
287 int test_sub(BIO *bp)
296 for (i=0; i<num0+num1; i++)
300 BN_bntest_rand(&a,512,0,0);
302 if (BN_set_bit(&a,i)==0) return(0);
307 BN_bntest_rand(&b,400+i-num1,0,0);
328 fprintf(stderr,"Subtract test failed!\n");
338 int test_div(BIO *bp, BN_CTX *ctx)
349 for (i=0; i<num0+num1; i++)
353 BN_bntest_rand(&a,400,0,0);
359 BN_bntest_rand(&b,50+3*(i-num1),0,0);
362 BN_div(&d,&c,&a,&b,ctx);
385 BN_mul(&e,&d,&b,ctx);
390 fprintf(stderr,"Division test failed!\n");
402 int test_div_recp(BIO *bp, BN_CTX *ctx)
408 BN_RECP_CTX_init(&recp);
415 for (i=0; i<num0+num1; i++)
419 BN_bntest_rand(&a,400,0,0);
425 BN_bntest_rand(&b,50+3*(i-num1),0,0);
428 BN_RECP_CTX_set(&recp,&b,ctx);
429 BN_div_recp(&d,&c,&a,&recp,ctx);
452 BN_mul(&e,&d,&b,ctx);
457 fprintf(stderr,"Reciprocal division test failed!\n");
458 fprintf(stderr,"a=");
459 BN_print_fp(stderr,&a);
460 fprintf(stderr,"\nb=");
461 BN_print_fp(stderr,&b);
462 fprintf(stderr,"\n");
471 BN_RECP_CTX_free(&recp);
475 int test_mul(BIO *bp)
482 if (ctx == NULL) EXIT(1);
490 for (i=0; i<num0+num1; i++)
494 BN_bntest_rand(&a,100,0,0);
495 BN_bntest_rand(&b,100,0,0);
498 BN_bntest_rand(&b,i-num1,0,0);
501 BN_mul(&c,&a,&b,ctx);
514 BN_div(&d,&e,&c,&a,ctx);
516 if(!BN_is_zero(&d) || !BN_is_zero(&e))
518 fprintf(stderr,"Multiplication test failed!\n");
531 int test_sqr(BIO *bp, BN_CTX *ctx)
541 for (i=0; i<num0; i++)
543 BN_bntest_rand(&a,40+i*10,0,0);
558 BN_div(&d,&e,&c,&a,ctx);
560 if(!BN_is_zero(&d) || !BN_is_zero(&e))
562 fprintf(stderr,"Square test failed!\n");
573 int test_mont(BIO *bp, BN_CTX *ctx)
588 mont=BN_MONT_CTX_new();
590 BN_bntest_rand(&a,100,0,0); /**/
591 BN_bntest_rand(&b,100,0,0); /**/
592 for (i=0; i<num2; i++)
594 int bits = (200*(i+1))/num2;
598 BN_bntest_rand(&n,bits,0,1);
599 BN_MONT_CTX_set(mont,&n,ctx);
601 BN_nnmod(&a,&a,&n,ctx);
602 BN_nnmod(&b,&b,&n,ctx);
604 BN_to_montgomery(&A,&a,mont,ctx);
605 BN_to_montgomery(&B,&b,mont,ctx);
607 BN_mod_mul_montgomery(&c,&A,&B,mont,ctx);/**/
608 BN_from_montgomery(&A,&c,mont,ctx);/**/
614 fprintf(stderr,"%d * %d %% %d\n",
617 BN_num_bits(mont->N));
623 BN_print(bp,&(mont->N));
629 BN_mod_mul(&d,&a,&b,&n,ctx);
633 fprintf(stderr,"Montgomery multiplication test failed!\n");
637 BN_MONT_CTX_free(mont);
648 int test_mod(BIO *bp, BN_CTX *ctx)
650 BIGNUM *a,*b,*c,*d,*e;
659 BN_bntest_rand(a,1024,0,0); /**/
660 for (i=0; i<num0; i++)
662 BN_bntest_rand(b,450+i*10,0,0); /**/
665 BN_mod(c,a,b,ctx);/**/
682 fprintf(stderr,"Modulo test failed!\n");
694 int test_mod_mul(BIO *bp, BN_CTX *ctx)
696 BIGNUM *a,*b,*c,*d,*e;
705 for (j=0; j<3; j++) {
706 BN_bntest_rand(c,1024,0,0); /**/
707 for (i=0; i<num0; i++)
709 BN_bntest_rand(a,475+i*10,0,0); /**/
710 BN_bntest_rand(b,425+i*11,0,0); /**/
713 if (!BN_mod_mul(e,a,b,c,ctx))
717 while ((l=ERR_get_error()))
718 fprintf(stderr,"ERROR:%s\n",
719 ERR_error_string(l,NULL));
731 if ((a->neg ^ b->neg) && !BN_is_zero(e))
733 /* If (a*b) % c is negative, c must be added
734 * in order to obtain the normalized remainder
735 * (new with OpenSSL 0.9.7, previous versions of
736 * BN_mod_mul could generate negative results)
751 fprintf(stderr,"Modulo multiply test failed!\n");
752 ERR_print_errors_fp(stderr);
765 int test_mod_exp(BIO *bp, BN_CTX *ctx)
767 BIGNUM *a,*b,*c,*d,*e;
776 BN_bntest_rand(c,30,0,1); /* must be odd for montgomery */
777 for (i=0; i<num2; i++)
779 BN_bntest_rand(a,20+i*5,0,0); /**/
780 BN_bntest_rand(b,2+i,0,0); /**/
782 if (!BN_mod_exp(d,a,b,c,ctx))
804 fprintf(stderr,"Modulo exponentiation test failed!\n");
816 int test_exp(BIO *bp, BN_CTX *ctx)
818 BIGNUM *a,*b,*d,*e,*one;
828 for (i=0; i<num2; i++)
830 BN_bntest_rand(a,20+i*5,0,0); /**/
831 BN_bntest_rand(b,2+i,0,0); /**/
833 if (!BN_exp(d,a,b,ctx))
849 for( ; !BN_is_zero(b) ; BN_sub(b,b,one))
854 fprintf(stderr,"Exponentiation test failed!\n");
866 static void genprime_cb(int p, int n, void *arg)
880 int test_kron(BIO *bp, BN_CTX *ctx)
884 int legendre, kronecker;
891 if (a == NULL || b == NULL || r == NULL || t == NULL) goto err;
893 /* We test BN_kronecker(a, b, ctx) just for b odd (Jacobi symbol).
894 * In this case we know that if b is prime, then BN_kronecker(a, b, ctx)
895 * is congruent to $a^{(b-1)/2}$, modulo $b$ (Legendre symbol).
896 * So we generate a random prime b and compare these values
897 * for a number of random a's. (That is, we run the Solovay-Strassen
898 * primality test to confirm that b is prime, except that we
899 * don't want to test whether b is prime but whether BN_kronecker
902 if (!BN_generate_prime(b, 512, 0, NULL, NULL, genprime_cb, NULL)) goto err;
906 for (i = 0; i < num0; i++)
908 if (!BN_bntest_rand(a, 512, 0, 0)) goto err;
911 /* t := (|b|-1)/2 (note that b is odd) */
912 if (!BN_copy(t, b)) goto err;
914 if (!BN_sub_word(t, 1)) goto err;
915 if (!BN_rshift1(t, t)) goto err;
919 if (!BN_mod_exp_recp(r, a, t, b, ctx)) goto err;
922 if (BN_is_word(r, 1))
924 else if (BN_is_zero(r))
928 if (!BN_add_word(r, 1)) goto err;
929 if (0 != BN_ucmp(r, b))
931 fprintf(stderr, "Legendre symbol computation failed\n");
937 kronecker = BN_kronecker(a, b, ctx);
938 if (kronecker < -1) goto err;
939 /* we actually need BN_kronecker(a, |b|) */
940 if (a->neg && b->neg)
941 kronecker = -kronecker;
943 if (legendre != kronecker)
945 fprintf(stderr, "legendre != kronecker; a = ");
946 BN_print_fp(stderr, a);
947 fprintf(stderr, ", b = ");
948 BN_print_fp(stderr, b);
949 fprintf(stderr, "\n");
961 if (a != NULL) BN_free(a);
962 if (b != NULL) BN_free(b);
963 if (r != NULL) BN_free(r);
964 if (t != NULL) BN_free(t);
968 int test_sqrt(BIO *bp, BN_CTX *ctx)
977 if (a == NULL || p == NULL || r == NULL) goto err;
979 for (i = 0; i < 16; i++)
983 unsigned primes[8] = { 2, 3, 5, 7, 11, 13, 17, 19 };
985 if (!BN_set_word(p, primes[i])) goto err;
989 if (!BN_set_word(a, 32)) goto err;
990 if (!BN_set_word(r, 2*i + 1)) goto err;
992 if (!BN_generate_prime(p, 256, 0, a, r, genprime_cb, NULL)) goto err;
997 for (j = 0; j < num2; j++)
999 /* construct 'a' such that it is a square modulo p,
1000 * but in general not a proper square and not reduced modulo p */
1001 if (!BN_bntest_rand(r, 256, 0, 3)) goto err;
1002 if (!BN_nnmod(r, r, p, ctx)) goto err;
1003 if (!BN_mod_sqr(r, r, p, ctx)) goto err;
1004 if (!BN_bntest_rand(a, 256, 0, 3)) goto err;
1005 if (!BN_nnmod(a, a, p, ctx)) goto err;
1006 if (!BN_mod_sqr(a, a, p, ctx)) goto err;
1007 if (!BN_mul(a, a, r, ctx)) goto err;
1009 if (!BN_sub(a, a, p)) goto err;
1011 if (!BN_mod_sqrt(r, a, p, ctx)) goto err;
1012 if (!BN_mod_sqr(r, r, p, ctx)) goto err;
1014 if (!BN_nnmod(a, a, p, ctx)) goto err;
1016 if (BN_cmp(a, r) != 0)
1018 fprintf(stderr, "BN_mod_sqrt failed: a = ");
1019 BN_print_fp(stderr, a);
1020 fprintf(stderr, ", r = ");
1021 BN_print_fp(stderr, r);
1022 fprintf(stderr, ", p = ");
1023 BN_print_fp(stderr, p);
1024 fprintf(stderr, "\n");
1037 if (a != NULL) BN_free(a);
1038 if (p != NULL) BN_free(p);
1039 if (r != NULL) BN_free(r);
1043 int test_lshift(BIO *bp,BN_CTX *ctx,BIGNUM *a_)
1058 BN_bntest_rand(a,200,0,0); /**/
1061 for (i=0; i<num0; i++)
1081 fprintf(stderr,"Left shift test failed!\n");
1082 fprintf(stderr,"a=");
1083 BN_print_fp(stderr,a);
1084 fprintf(stderr,"\nb=");
1085 BN_print_fp(stderr,b);
1086 fprintf(stderr,"\nc=");
1087 BN_print_fp(stderr,c);
1088 fprintf(stderr,"\nd=");
1089 BN_print_fp(stderr,d);
1090 fprintf(stderr,"\n");
1101 int test_lshift1(BIO *bp)
1110 BN_bntest_rand(a,200,0,0); /**/
1112 for (i=0; i<num0; i++)
1120 BIO_puts(bp," * 2");
1130 fprintf(stderr,"Left shift one test failed!\n");
1142 int test_rshift(BIO *bp,BN_CTX *ctx)
1144 BIGNUM *a,*b,*c,*d,*e;
1154 BN_bntest_rand(a,200,0,0); /**/
1156 for (i=0; i<num0; i++)
1172 BN_div(d,e,a,c,ctx);
1176 fprintf(stderr,"Right shift test failed!\n");
1188 int test_rshift1(BIO *bp)
1197 BN_bntest_rand(a,200,0,0); /**/
1199 for (i=0; i<num0; i++)
1207 BIO_puts(bp," / 2");
1215 if(!BN_is_zero(c) && !BN_abs_is_word(c, 1))
1217 fprintf(stderr,"Right shift one test failed!\n");
1230 static unsigned int neg=0;
1231 static int sign[8]={0,0,0,1,1,0,1,1};
1233 return(sign[(neg++)%8]);