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_rand may fail, and we don't
128 * even check its return value
129 * (which we should) */
135 if (strcmp(*argv,"-results") == 0)
137 else if (strcmp(*argv,"-out") == 0)
139 if (--argc < 1) break;
148 if (ctx == NULL) exit(1);
150 out=BIO_new(BIO_s_file());
151 if (out == NULL) exit(1);
154 BIO_set_fp(out,stdout,BIO_NOCLOSE);
158 if (!BIO_write_filename(out,outfile))
166 BIO_puts(out,"obase=16\nibase=16\n");
168 message(out,"BN_add");
169 if (!test_add(out)) goto err;
172 message(out,"BN_sub");
173 if (!test_sub(out)) goto err;
176 message(out,"BN_lshift1");
177 if (!test_lshift1(out)) goto err;
180 message(out,"BN_lshift (fixed)");
181 if (!test_lshift(out,ctx,BN_bin2bn(lst,sizeof(lst)-1,NULL)))
185 message(out,"BN_lshift");
186 if (!test_lshift(out,ctx,NULL)) goto err;
189 message(out,"BN_rshift1");
190 if (!test_rshift1(out)) goto err;
193 message(out,"BN_rshift");
194 if (!test_rshift(out,ctx)) goto err;
197 message(out,"BN_sqr");
198 if (!test_sqr(out,ctx)) goto err;
201 message(out,"BN_mul");
202 if (!test_mul(out)) goto err;
205 message(out,"BN_div");
206 if (!test_div(out,ctx)) goto err;
209 message(out,"BN_div_recp");
210 if (!test_div_recp(out,ctx)) goto err;
213 message(out,"BN_mod");
214 if (!test_mod(out,ctx)) goto err;
217 message(out,"BN_mod_mul");
218 if (!test_mod_mul(out,ctx)) goto err;
221 message(out,"BN_mont");
222 if (!test_mont(out,ctx)) goto err;
225 message(out,"BN_mod_exp");
226 if (!test_mod_exp(out,ctx)) goto err;
229 message(out,"BN_exp");
230 if (!test_exp(out,ctx)) goto err;
233 message(out,"BN_kronecker");
234 if (!test_kron(out,ctx)) goto err;
237 message(out,"BN_mod_sqrt");
238 if (!test_sqrt(out,ctx)) goto err;
247 BIO_puts(out,"1\n"); /* make sure the Perl script fed by bc notices
248 * the failure, see test_bn in test/Makefile.ssl*/
250 ERR_load_crypto_strings();
251 ERR_print_errors_fp(stderr);
256 int test_add(BIO *bp)
267 for (i=0; i<num0; i++)
269 BN_rand(&b,450+i,0,0);
273 for (j=0; j<10000; j++)
294 fprintf(stderr,"Add test failed!\n");
304 int test_sub(BIO *bp)
314 for (i=0; i<num0+num1; i++)
320 if (BN_set_bit(&a,i)==0) return(0);
325 BN_rand(&b,400+i-num1,0,0);
330 for (j=0; j<10000; j++)
349 fprintf(stderr,"Subtract test failed!\n");
359 int test_div(BIO *bp, BN_CTX *ctx)
371 for (i=0; i<num0+num1; i++)
381 BN_rand(&b,50+3*(i-num1),0,0);
385 for (j=0; j<100; j++)
386 BN_div(&d,&c,&a,&b,ctx);
387 BN_div(&d,&c,&a,&b,ctx);
410 BN_mul(&e,&d,&b,ctx);
415 fprintf(stderr,"Division test failed!\n");
427 int test_div_recp(BIO *bp, BN_CTX *ctx)
434 BN_RECP_CTX_init(&recp);
441 for (i=0; i<num0+num1; i++)
451 BN_rand(&b,50+3*(i-num1),0,0);
454 BN_RECP_CTX_set(&recp,&b,ctx);
456 for (j=0; j<100; j++)
457 BN_div_recp(&d,&c,&a,&recp,ctx);
458 BN_div_recp(&d,&c,&a,&recp,ctx);
481 BN_mul(&e,&d,&b,ctx);
486 fprintf(stderr,"Reciprocal division test failed!\n");
487 fprintf(stderr,"a=");
488 BN_print_fp(stderr,&a);
489 fprintf(stderr,"\nb=");
490 BN_print_fp(stderr,&b);
491 fprintf(stderr,"\n");
500 BN_RECP_CTX_free(&recp);
504 int test_mul(BIO *bp)
518 for (i=0; i<num0+num1; i++)
526 BN_rand(&b,i-num1,0,0);
530 for (j=0; j<100; j++)
531 BN_mul(&c,&a,&b,&ctx);
532 BN_mul(&c,&a,&b,&ctx);
545 BN_div(&d,&e,&c,&a,&ctx);
547 if(!BN_is_zero(&d) || !BN_is_zero(&e))
549 fprintf(stderr,"Multiplication test failed!\n");
562 int test_sqr(BIO *bp, BN_CTX *ctx)
573 for (i=0; i<num0; i++)
575 BN_rand(&a,40+i*10,0,0);
578 for (j=0; j<100; j++)
593 BN_div(&d,&e,&c,&a,ctx);
595 if(!BN_is_zero(&d) || !BN_is_zero(&e))
597 fprintf(stderr,"Square test failed!\n");
608 int test_mont(BIO *bp, BN_CTX *ctx)
624 mont=BN_MONT_CTX_new();
626 BN_rand(&a,100,0,0); /**/
627 BN_rand(&b,100,0,0); /**/
628 for (i=0; i<num2; i++)
630 int bits = (200*(i+1))/num2;
634 BN_rand(&n,bits,0,1);
635 BN_MONT_CTX_set(mont,&n,ctx);
637 BN_nnmod(&a,&a,&n,ctx);
638 BN_nnmod(&b,&b,&n,ctx);
640 BN_to_montgomery(&A,&a,mont,ctx);
641 BN_to_montgomery(&B,&b,mont,ctx);
644 for (j=0; j<100; j++)
645 BN_mod_mul_montgomery(&c,&A,&B,mont,ctx);/**/
646 BN_mod_mul_montgomery(&c,&A,&B,mont,ctx);/**/
647 BN_from_montgomery(&A,&c,mont,ctx);/**/
653 fprintf(stderr,"%d * %d %% %d\n",
656 BN_num_bits(mont->N));
662 BN_print(bp,&(mont->N));
668 BN_mod_mul(&d,&a,&b,&n,ctx);
672 fprintf(stderr,"Montgomery multiplication test failed!\n");
676 BN_MONT_CTX_free(mont);
687 int test_mod(BIO *bp, BN_CTX *ctx)
689 BIGNUM *a,*b,*c,*d,*e;
699 BN_rand(a,1024,0,0); /**/
700 for (i=0; i<num0; i++)
702 BN_rand(b,450+i*10,0,0); /**/
706 for (j=0; j<100; j++)
707 BN_mod(c,a,b,ctx);/**/
708 BN_mod(c,a,b,ctx);/**/
725 fprintf(stderr,"Modulo test failed!\n");
737 int test_mod_mul(BIO *bp, BN_CTX *ctx)
739 BIGNUM *a,*b,*c,*d,*e;
748 BN_rand(c,1024,0,0); /**/
749 for (i=0; i<num0; i++)
751 BN_rand(a,475+i*10,0,0); /**/
752 BN_rand(b,425+i*11,0,0); /**/
756 for (j=0; j<100; j++)
757 BN_mod_mul(d,a,b,c,ctx);*/ /**/
759 if (!BN_mod_mul(e,a,b,c,ctx))
763 while ((l=ERR_get_error()))
764 fprintf(stderr,"ERROR:%s\n",
765 ERR_error_string(l,NULL));
777 if ((a->neg ^ b->neg) && !BN_is_zero(e))
779 /* If (a*b) % c is negative, c must be added
780 * in order to obtain the normalized remainder
781 * (new with OpenSSL 0.9.7, previous versions of
782 * BN_mod_mul could generate negative results)
797 fprintf(stderr,"Modulo multiply test failed!\n");
798 ERR_print_errors_fp(stderr);
810 int test_mod_exp(BIO *bp, BN_CTX *ctx)
812 BIGNUM *a,*b,*c,*d,*e;
821 BN_rand(c,30,0,1); /* must be odd for montgomery */
822 for (i=0; i<num2; i++)
824 BN_rand(a,20+i*5,0,0); /**/
825 BN_rand(b,2+i,0,0); /**/
827 if (!BN_mod_exp(d,a,b,c,ctx))
849 fprintf(stderr,"Modulo exponentiation test failed!\n");
861 int test_exp(BIO *bp, BN_CTX *ctx)
863 BIGNUM *a,*b,*d,*e,*one;
873 for (i=0; i<num2; i++)
875 BN_rand(a,20+i*5,0,0); /**/
876 BN_rand(b,2+i,0,0); /**/
878 if (!BN_exp(d,a,b,ctx))
894 for( ; !BN_is_zero(b) ; BN_sub(b,b,one))
899 fprintf(stderr,"Exponentiation test failed!\n");
911 static void genprime_cb(int p, int n, void *arg)
925 int test_kron(BIO *bp, BN_CTX *ctx)
929 int legendre, kronecker;
935 if (a == NULL || b == NULL || r == NULL) goto err;
937 /* We test BN_kronecker(a, b, ctx) just for b odd (Jacobi symbol).
938 * In this case we know that if b is prime, then BN_kronecker(a, b, ctx)
939 * is congruent to $a^{(b-1)/2}$, modulo $b$ (Legendre symbol).
940 * So we generate a random prime b and compare these values
941 * for a number of random a's. (That is, we run the Solovay-Strassen
942 * primality test to confirm that b is prime, except that we
943 * don't want to test whether b is prime but whether BN_kronecker
946 if (!BN_generate_prime(b, 512, 0, NULL, NULL, genprime_cb, NULL)) goto err;
949 for (i = 0; i < num0; i++)
951 if (!BN_rand(a, 512, 0, 0)) goto err;
954 /* r := (b-1)/2 (note that b is odd) */
955 if (!BN_copy(r, b)) goto err;
956 if (!BN_sub_word(r, 1)) goto err;
957 if (!BN_rshift1(r, r)) goto err;
959 #if 0 /* These three variants should produce the same result, but with
960 * BN_mod_exp_recp or BN_mod_exp_simple, the test fails with
961 * the "Legendre symbol computation failed" error.
962 * (Platform: debug-solaris-sparcv9-gcc)
964 if (!BN_mod_exp(r, a, r, b, ctx)) goto err;
966 if (!BN_mod_exp_recp(r, a, r, b, ctx)) goto err;
968 if (!BN_mod_exp_simple(r, a, r, b, ctx)) goto err;
972 On my Linux system, all variants of BN_mod_exp appear to work here,
973 but a SIGSEGV occurs later:
975 Program received signal SIGSEGV, Segmentation fault.
980 #2 0x805e64a in CRYPTO_free (str=0x807d968) at mem.c:248
981 #3 0x804f68f in bn_expand2 (b=0x807d6b4, words=10) at bn_lib.c:438
982 #4 0x8055366 in BN_lshift (r=0x807d6b4, a=0x807d68c, n=63) at bn_shift.c:132
983 #5 0x804ca7a in BN_div (dv=0x0, rm=0x807d68c, num=0x807d68c,
984 divisor=0x807d678, ctx=0x807d610) at bn_div.c:205
985 #6 0x805391a in BN_nnmod (r=0x807d68c, m=0x807d68c, d=0x807d678,
986 ctx=0x807d610) at bn_mod.c:132
987 #7 0x8056198 in BN_kronecker (a=0x807d664, b=0x807d848, ctx=0x807d610)
989 #8 0x805d351 in BN_mod_sqrt (in=0x807d860, a=0x807d830, p=0x807d848,
990 ctx=0x807d610) at bn_sqrt.c:165
991 #9 0x804b365 in test_sqrt (bp=0x807d7e8, ctx=0x807d610) at bntest.c:1057
992 #10 0x8048da8 in main (argc=0, argv=0xbffffbb8) at bntest.c:240
995 These symptoms indicate that the error probably happens earlier
996 in the program. I've disabled the calls to all earlier test_...
997 functions and replaced BN_generate_prime by BN_set_word(.., 65537)
998 in bntest.c, but this does not help.
1001 if (BN_is_word(r, 1))
1005 if (!BN_add_word(r, 1)) goto err;
1006 if (0 != BN_cmp(r, b))
1008 fprintf(stderr, "Legendre symbol computation failed\n");
1014 kronecker = BN_kronecker(a, b, ctx);
1015 if (kronecker < -1) goto err;
1017 if (legendre != kronecker)
1019 fprintf(stderr, "legendre != kronecker; a = ");
1020 BN_print_fp(stderr, a);
1021 fprintf(stderr, ", a = ");
1022 BN_print_fp(stderr, b);
1023 fprintf(stderr, "\n");
1035 if (a != NULL) BN_free(a);
1036 if (b != NULL) BN_free(b);
1037 if (r != NULL) BN_free(r);
1041 int test_sqrt(BIO *bp, BN_CTX *ctx)
1050 if (a == NULL || p == NULL || r == NULL) goto err;
1052 for (i = 0; i < 16; i++)
1056 unsigned primes[8] = { 2, 3, 5, 7, 11, 13, 17, 19 };
1058 if (!BN_set_word(p, primes[i])) goto err;
1062 if (!BN_set_word(a, 32)) goto err;
1063 if (!BN_set_word(r, 2*i + 1)) goto err;
1065 if (!BN_generate_prime(p, 256, 0, a, r, genprime_cb, NULL)) goto err;
1069 for (j = 0; j < num2; j++)
1071 /* construct 'a' such that it is a square modulo p,
1072 * but in general not a proper square and not reduced modulo p */
1073 if (!BN_rand(r, 256, 0, 3)) goto err;
1074 if (!BN_nnmod(r, r, p, ctx)) goto err;
1075 if (!BN_mod_sqr(r, r, p, ctx)) goto err;
1076 if (!BN_rand(a, 256, 0, 3)) goto err;
1077 if (!BN_nnmod(a, a, p, ctx)) goto err;
1078 if (!BN_mod_sqr(a, a, p, ctx)) goto err;
1079 if (!BN_mul(a, a, r, ctx)) goto err;
1081 if (!BN_mod_sqrt(r, a, p, ctx)) goto err;
1082 if (!BN_mod_sqr(r, r, p, ctx)) goto err;
1084 if (!BN_nnmod(a, a, p, ctx)) goto err;
1086 if (BN_cmp(a, r) != 0)
1088 fprintf(stderr, "BN_mod_sqrt failed: a = ");
1089 BN_print_fp(stderr, a);
1090 fprintf(stderr, ", r = ");
1091 BN_print_fp(stderr, r);
1092 fprintf(stderr, ", p = ");
1093 BN_print_fp(stderr, p);
1094 fprintf(stderr, "\n");
1107 if (a != NULL) BN_free(a);
1108 if (p != NULL) BN_free(p);
1109 if (r != NULL) BN_free(r);
1113 int test_lshift(BIO *bp,BN_CTX *ctx,BIGNUM *a_)
1128 BN_rand(a,200,0,0); /**/
1131 for (i=0; i<num0; i++)
1151 fprintf(stderr,"Left shift test failed!\n");
1152 fprintf(stderr,"a=");
1153 BN_print_fp(stderr,a);
1154 fprintf(stderr,"\nb=");
1155 BN_print_fp(stderr,b);
1156 fprintf(stderr,"\nc=");
1157 BN_print_fp(stderr,c);
1158 fprintf(stderr,"\nd=");
1159 BN_print_fp(stderr,d);
1160 fprintf(stderr,"\n");
1171 int test_lshift1(BIO *bp)
1180 BN_rand(a,200,0,0); /**/
1182 for (i=0; i<num0; i++)
1190 BIO_puts(bp," * 2");
1200 fprintf(stderr,"Left shift one test failed!\n");
1212 int test_rshift(BIO *bp,BN_CTX *ctx)
1214 BIGNUM *a,*b,*c,*d,*e;
1224 BN_rand(a,200,0,0); /**/
1226 for (i=0; i<num0; i++)
1242 BN_div(d,e,a,c,ctx);
1246 fprintf(stderr,"Right shift test failed!\n");
1258 int test_rshift1(BIO *bp)
1267 BN_rand(a,200,0,0); /**/
1269 for (i=0; i<num0; i++)
1277 BIO_puts(bp," / 2");
1285 if(!BN_is_zero(c) && !BN_is_one(c))
1287 fprintf(stderr,"Right shift one test failed!\n");
1300 static unsigned int neg=0;
1301 static int sign[8]={0,0,0,1,1,0,1,1};
1303 return(sign[(neg++)%8]);