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.]
63 #include "openssl/e_os.h"
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>
72 #include "../bio/bss_file.c"
75 const int num0 = 100; /* number of tests */
76 const int num1 = 50; /* additional tests for some functions */
77 const int num2 = 5; /* number of tests for slow functions */
79 int test_add(BIO *bp);
80 int test_sub(BIO *bp);
81 int test_lshift1(BIO *bp);
82 int test_lshift(BIO *bp,BN_CTX *ctx,BIGNUM *a_);
83 int test_rshift1(BIO *bp);
84 int test_rshift(BIO *bp,BN_CTX *ctx);
85 int test_div(BIO *bp,BN_CTX *ctx);
86 int test_div_recp(BIO *bp,BN_CTX *ctx);
87 int test_mul(BIO *bp);
88 int test_sqr(BIO *bp,BN_CTX *ctx);
89 int test_mont(BIO *bp,BN_CTX *ctx);
90 int test_mod(BIO *bp,BN_CTX *ctx);
91 int test_mod_mul(BIO *bp,BN_CTX *ctx);
92 int test_mod_exp(BIO *bp,BN_CTX *ctx);
93 int test_exp(BIO *bp,BN_CTX *ctx);
94 int test_kron(BIO *bp,BN_CTX *ctx);
95 int test_sqrt(BIO *bp,BN_CTX *ctx);
101 #include "bss_file.c"
104 static unsigned char lst[]="\xC6\x4F\x43\x04\x2A\xEA\xCA\x6E\x58\x36\x80\x5B\xE8\xC9"
105 "\x9B\x04\x5D\x48\x36\xC2\xFD\x16\xC9\x64\xF0";
107 static const char rnd_seed[] = "string to make the random number generator think it has entropy";
109 static void message(BIO *out, char *m)
111 fprintf(stderr, "test %s\n", m);
112 #if defined(linux) || defined(__FreeBSD__) /* can we use GNU bc features? */
113 BIO_puts(out, "print \"test ");
115 BIO_puts(out, "\\n\"\n");
119 int main(int argc, char *argv[])
127 RAND_seed(rnd_seed, sizeof rnd_seed); /* or BN_generate_prime may fail */
133 if (strcmp(*argv,"-results") == 0)
135 else if (strcmp(*argv,"-out") == 0)
137 if (--argc < 1) break;
146 if (ctx == NULL) exit(1);
148 out=BIO_new(BIO_s_file());
149 if (out == NULL) exit(1);
152 BIO_set_fp(out,stdout,BIO_NOCLOSE);
156 if (!BIO_write_filename(out,outfile))
164 BIO_puts(out,"obase=16\nibase=16\n");
166 message(out,"BN_add");
167 if (!test_add(out)) goto err;
170 message(out,"BN_sub");
171 if (!test_sub(out)) goto err;
174 message(out,"BN_lshift1");
175 if (!test_lshift1(out)) goto err;
178 message(out,"BN_lshift (fixed)");
179 if (!test_lshift(out,ctx,BN_bin2bn(lst,sizeof(lst)-1,NULL)))
183 message(out,"BN_lshift");
184 if (!test_lshift(out,ctx,NULL)) goto err;
187 message(out,"BN_rshift1");
188 if (!test_rshift1(out)) goto err;
191 message(out,"BN_rshift");
192 if (!test_rshift(out,ctx)) goto err;
195 message(out,"BN_sqr");
196 if (!test_sqr(out,ctx)) goto err;
199 message(out,"BN_mul");
200 if (!test_mul(out)) goto err;
203 message(out,"BN_div");
204 if (!test_div(out,ctx)) goto err;
207 message(out,"BN_div_recp");
208 if (!test_div_recp(out,ctx)) goto err;
211 message(out,"BN_mod");
212 if (!test_mod(out,ctx)) goto err;
215 message(out,"BN_mod_mul");
216 if (!test_mod_mul(out,ctx)) goto err;
219 message(out,"BN_mont");
220 if (!test_mont(out,ctx)) goto err;
223 message(out,"BN_mod_exp");
224 if (!test_mod_exp(out,ctx)) goto err;
227 message(out,"BN_exp");
228 if (!test_exp(out,ctx)) goto err;
231 message(out,"BN_kronecker");
232 if (!test_kron(out,ctx)) goto err;
235 message(out,"BN_mod_sqrt");
236 if (!test_sqrt(out,ctx)) goto err;
245 BIO_puts(out,"1\n"); /* make sure the Perl script fed by bc notices
246 * the failure, see test_bn in test/Makefile.ssl*/
248 ERR_load_crypto_strings();
249 ERR_print_errors_fp(stderr);
254 int test_add(BIO *bp)
263 BN_bntest_rand(&a,512,0,0);
264 for (i=0; i<num0; i++)
266 BN_bntest_rand(&b,450+i,0,0);
288 fprintf(stderr,"Add test failed!\n");
298 int test_sub(BIO *bp)
307 for (i=0; i<num0+num1; i++)
311 BN_bntest_rand(&a,512,0,0);
313 if (BN_set_bit(&a,i)==0) return(0);
318 BN_bntest_rand(&b,400+i-num1,0,0);
339 fprintf(stderr,"Subtract test failed!\n");
349 int test_div(BIO *bp, BN_CTX *ctx)
360 for (i=0; i<num0+num1; i++)
364 BN_bntest_rand(&a,400,0,0);
370 BN_bntest_rand(&b,50+3*(i-num1),0,0);
373 BN_div(&d,&c,&a,&b,ctx);
396 BN_mul(&e,&d,&b,ctx);
401 fprintf(stderr,"Division test failed!\n");
413 int test_div_recp(BIO *bp, BN_CTX *ctx)
419 BN_RECP_CTX_init(&recp);
426 for (i=0; i<num0+num1; i++)
430 BN_bntest_rand(&a,400,0,0);
436 BN_bntest_rand(&b,50+3*(i-num1),0,0);
439 BN_RECP_CTX_set(&recp,&b,ctx);
440 BN_div_recp(&d,&c,&a,&recp,ctx);
463 BN_mul(&e,&d,&b,ctx);
468 fprintf(stderr,"Reciprocal division test failed!\n");
469 fprintf(stderr,"a=");
470 BN_print_fp(stderr,&a);
471 fprintf(stderr,"\nb=");
472 BN_print_fp(stderr,&b);
473 fprintf(stderr,"\n");
482 BN_RECP_CTX_free(&recp);
486 int test_mul(BIO *bp)
499 for (i=0; i<num0+num1; i++)
503 BN_bntest_rand(&a,100,0,0);
504 BN_bntest_rand(&b,100,0,0);
507 BN_bntest_rand(&b,i-num1,0,0);
510 BN_mul(&c,&a,&b,&ctx);
523 BN_div(&d,&e,&c,&a,&ctx);
525 if(!BN_is_zero(&d) || !BN_is_zero(&e))
527 fprintf(stderr,"Multiplication test failed!\n");
540 int test_sqr(BIO *bp, BN_CTX *ctx)
550 for (i=0; i<num0; i++)
552 BN_bntest_rand(&a,40+i*10,0,0);
567 BN_div(&d,&e,&c,&a,ctx);
569 if(!BN_is_zero(&d) || !BN_is_zero(&e))
571 fprintf(stderr,"Square test failed!\n");
582 int test_mont(BIO *bp, BN_CTX *ctx)
597 mont=BN_MONT_CTX_new();
599 BN_bntest_rand(&a,100,0,0); /**/
600 BN_bntest_rand(&b,100,0,0); /**/
601 for (i=0; i<num2; i++)
603 int bits = (200*(i+1))/num2;
607 BN_bntest_rand(&n,bits,0,1);
608 BN_MONT_CTX_set(mont,&n,ctx);
610 BN_nnmod(&a,&a,&n,ctx);
611 BN_nnmod(&b,&b,&n,ctx);
613 BN_to_montgomery(&A,&a,mont,ctx);
614 BN_to_montgomery(&B,&b,mont,ctx);
616 BN_mod_mul_montgomery(&c,&A,&B,mont,ctx);/**/
617 BN_from_montgomery(&A,&c,mont,ctx);/**/
623 fprintf(stderr,"%d * %d %% %d\n",
626 BN_num_bits(mont->N));
632 BN_print(bp,&(mont->N));
638 BN_mod_mul(&d,&a,&b,&n,ctx);
642 fprintf(stderr,"Montgomery multiplication test failed!\n");
646 BN_MONT_CTX_free(mont);
657 int test_mod(BIO *bp, BN_CTX *ctx)
659 BIGNUM *a,*b,*c,*d,*e;
668 BN_bntest_rand(a,1024,0,0); /**/
669 for (i=0; i<num0; i++)
671 BN_bntest_rand(b,450+i*10,0,0); /**/
674 BN_mod(c,a,b,ctx);/**/
691 fprintf(stderr,"Modulo test failed!\n");
703 int test_mod_mul(BIO *bp, BN_CTX *ctx)
705 BIGNUM *a,*b,*c,*d,*e;
714 for (j=0; j<3; j++) {
715 BN_bntest_rand(c,1024,0,0); /**/
716 for (i=0; i<num0; i++)
718 BN_bntest_rand(a,475+i*10,0,0); /**/
719 BN_bntest_rand(b,425+i*11,0,0); /**/
722 if (!BN_mod_mul(e,a,b,c,ctx))
726 while ((l=ERR_get_error()))
727 fprintf(stderr,"ERROR:%s\n",
728 ERR_error_string(l,NULL));
740 if ((a->neg ^ b->neg) && !BN_is_zero(e))
742 /* If (a*b) % c is negative, c must be added
743 * in order to obtain the normalized remainder
744 * (new with OpenSSL 0.9.7, previous versions of
745 * BN_mod_mul could generate negative results)
760 fprintf(stderr,"Modulo multiply test failed!\n");
761 ERR_print_errors_fp(stderr);
774 int test_mod_exp(BIO *bp, BN_CTX *ctx)
776 BIGNUM *a,*b,*c,*d,*e;
785 BN_bntest_rand(c,30,0,1); /* must be odd for montgomery */
786 for (i=0; i<num2; i++)
788 BN_bntest_rand(a,20+i*5,0,0); /**/
789 BN_bntest_rand(b,2+i,0,0); /**/
791 if (!BN_mod_exp(d,a,b,c,ctx))
813 fprintf(stderr,"Modulo exponentiation test failed!\n");
825 int test_exp(BIO *bp, BN_CTX *ctx)
827 BIGNUM *a,*b,*d,*e,*one;
837 for (i=0; i<num2; i++)
839 BN_bntest_rand(a,20+i*5,0,0); /**/
840 BN_bntest_rand(b,2+i,0,0); /**/
842 if (!BN_exp(d,a,b,ctx))
858 for( ; !BN_is_zero(b) ; BN_sub(b,b,one))
863 fprintf(stderr,"Exponentiation test failed!\n");
875 static void genprime_cb(int p, int n, void *arg)
889 int test_kron(BIO *bp, BN_CTX *ctx)
893 int legendre, kronecker;
900 if (a == NULL || b == NULL || r == NULL || t == NULL) goto err;
902 /* We test BN_kronecker(a, b, ctx) just for b odd (Jacobi symbol).
903 * In this case we know that if b is prime, then BN_kronecker(a, b, ctx)
904 * is congruent to $a^{(b-1)/2}$, modulo $b$ (Legendre symbol).
905 * So we generate a random prime b and compare these values
906 * for a number of random a's. (That is, we run the Solovay-Strassen
907 * primality test to confirm that b is prime, except that we
908 * don't want to test whether b is prime but whether BN_kronecker
911 if (!BN_generate_prime(b, 512, 0, NULL, NULL, genprime_cb, NULL)) goto err;
914 for (i = 0; i < num0; i++)
916 if (!BN_bntest_rand(a, 512, 0, 0)) goto err;
919 /* t := (b-1)/2 (note that b is odd) */
920 if (!BN_copy(t, b)) goto err;
921 if (!BN_sub_word(t, 1)) goto err;
922 if (!BN_rshift1(t, t)) goto err;
924 if (!BN_mod_exp(r, a, t, b, ctx)) goto err;
926 if (BN_is_word(r, 1))
928 else if (BN_is_zero(r))
932 if (!BN_add_word(r, 1)) goto err;
933 if (0 != BN_cmp(r, b))
935 fprintf(stderr, "Legendre symbol computation failed\n");
941 kronecker = BN_kronecker(a, b, ctx);
942 if (kronecker < -1) goto err;
944 if (legendre != kronecker)
946 fprintf(stderr, "legendre != kronecker; a = ");
947 BN_print_fp(stderr, a);
948 fprintf(stderr, ", b = ");
949 BN_print_fp(stderr, b);
950 fprintf(stderr, "\n");
962 if (a != NULL) BN_free(a);
963 if (b != NULL) BN_free(b);
964 if (r != NULL) BN_free(r);
965 if (t != NULL) BN_free(t);
969 int test_sqrt(BIO *bp, BN_CTX *ctx)
978 if (a == NULL || p == NULL || r == NULL) goto err;
980 for (i = 0; i < 16; i++)
984 unsigned primes[8] = { 2, 3, 5, 7, 11, 13, 17, 19 };
986 if (!BN_set_word(p, primes[i])) goto err;
990 if (!BN_set_word(a, 32)) goto err;
991 if (!BN_set_word(r, 2*i + 1)) goto err;
993 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_mod_sqrt(r, a, p, ctx)) goto err;
1010 if (!BN_mod_sqr(r, r, p, ctx)) goto err;
1012 if (!BN_nnmod(a, a, p, ctx)) goto err;
1014 if (BN_cmp(a, r) != 0)
1016 fprintf(stderr, "BN_mod_sqrt failed: a = ");
1017 BN_print_fp(stderr, a);
1018 fprintf(stderr, ", r = ");
1019 BN_print_fp(stderr, r);
1020 fprintf(stderr, ", p = ");
1021 BN_print_fp(stderr, p);
1022 fprintf(stderr, "\n");
1035 if (a != NULL) BN_free(a);
1036 if (p != NULL) BN_free(p);
1037 if (r != NULL) BN_free(r);
1041 int test_lshift(BIO *bp,BN_CTX *ctx,BIGNUM *a_)
1056 BN_bntest_rand(a,200,0,0); /**/
1059 for (i=0; i<num0; i++)
1079 fprintf(stderr,"Left shift test failed!\n");
1080 fprintf(stderr,"a=");
1081 BN_print_fp(stderr,a);
1082 fprintf(stderr,"\nb=");
1083 BN_print_fp(stderr,b);
1084 fprintf(stderr,"\nc=");
1085 BN_print_fp(stderr,c);
1086 fprintf(stderr,"\nd=");
1087 BN_print_fp(stderr,d);
1088 fprintf(stderr,"\n");
1099 int test_lshift1(BIO *bp)
1108 BN_bntest_rand(a,200,0,0); /**/
1110 for (i=0; i<num0; i++)
1118 BIO_puts(bp," * 2");
1128 fprintf(stderr,"Left shift one test failed!\n");
1140 int test_rshift(BIO *bp,BN_CTX *ctx)
1142 BIGNUM *a,*b,*c,*d,*e;
1152 BN_bntest_rand(a,200,0,0); /**/
1154 for (i=0; i<num0; i++)
1170 BN_div(d,e,a,c,ctx);
1174 fprintf(stderr,"Right shift test failed!\n");
1186 int test_rshift1(BIO *bp)
1195 BN_bntest_rand(a,200,0,0); /**/
1197 for (i=0; i<num0; i++)
1205 BIO_puts(bp," / 2");
1213 if(!BN_is_zero(c) && !BN_is_one(c))
1215 fprintf(stderr,"Right shift one test failed!\n");
1228 static unsigned int neg=0;
1229 static int sign[8]={0,0,0,1,1,0,1,1};
1231 return(sign[(neg++)%8]);