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 num0 = 100; /* number of tests */
76 const num1 = 50; /* additional tests for some functions */
77 const 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);
102 static unsigned char lst[]="\xC6\x4F\x43\x04\x2A\xEA\xCA\x6E\x58\x36\x80\x5B\xE8\xC9"
103 "\x9B\x04\x5D\x48\x36\xC2\xFD\x16\xC9\x64\xF0";
105 static const char rnd_seed[] = "string to make the random number generator think it has entropy";
107 void message(BIO *out, char *m)
109 fprintf(stderr, "test %s\n", m);
111 BIO_puts(out, "print \"test ");
113 BIO_puts(out, "\\n\"\n");
117 int main(int argc, char *argv[])
125 RAND_seed(rnd_seed, sizeof rnd_seed); /* or BN_rand may fail, and we don't
126 * even check its return value
127 * (which we should) */
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;
237 BIO_puts(out,"1\n"); /* make sure bc fails if we are piping to it */
238 ERR_load_crypto_strings();
239 ERR_print_errors_fp(stderr);
244 int test_add(BIO *bp)
255 for (i=0; i<num0; i++)
257 BN_rand(&b,450+i,0,0);
261 for (j=0; j<10000; j++)
282 fprintf(stderr,"Add test failed!\n");
292 int test_sub(BIO *bp)
302 for (i=0; i<num0+num1; i++)
308 if (BN_set_bit(&a,i)==0) return(0);
313 BN_rand(&b,400+i-num1,0,0);
318 for (j=0; j<10000; j++)
337 fprintf(stderr,"Subtract test failed!\n");
347 int test_div(BIO *bp, BN_CTX *ctx)
359 for (i=0; i<num0+num1; i++)
369 BN_rand(&b,50+3*(i-num1),0,0);
373 for (j=0; j<100; j++)
374 BN_div(&d,&c,&a,&b,ctx);
375 BN_div(&d,&c,&a,&b,ctx);
398 BN_mul(&e,&d,&b,ctx);
403 fprintf(stderr,"Division test failed!\n");
415 int test_div_recp(BIO *bp, BN_CTX *ctx)
422 BN_RECP_CTX_init(&recp);
429 for (i=0; i<num0+num1; i++)
439 BN_rand(&b,50+3*(i-num1),0,0);
442 BN_RECP_CTX_set(&recp,&b,ctx);
444 for (j=0; j<100; j++)
445 BN_div_recp(&d,&c,&a,&recp,ctx);
446 BN_div_recp(&d,&c,&a,&recp,ctx);
469 BN_mul(&e,&d,&b,ctx);
474 fprintf(stderr,"Reciprocal division test failed!\n");
475 fprintf(stderr,"a=");
476 BN_print_fp(stderr,&a);
477 fprintf(stderr,"\nb=");
478 BN_print_fp(stderr,&b);
479 fprintf(stderr,"\n");
488 BN_RECP_CTX_free(&recp);
492 int test_mul(BIO *bp)
506 for (i=0; i<num0+num1; i++)
514 BN_rand(&b,i-num1,0,0);
518 for (j=0; j<100; j++)
519 BN_mul(&c,&a,&b,&ctx);
520 BN_mul(&c,&a,&b,&ctx);
533 BN_div(&d,&e,&c,&a,&ctx);
535 if(!BN_is_zero(&d) || !BN_is_zero(&e))
537 fprintf(stderr,"Multiplication test failed!\n");
550 int test_sqr(BIO *bp, BN_CTX *ctx)
561 for (i=0; i<num0; i++)
563 BN_rand(&a,40+i*10,0,0);
566 for (j=0; j<100; j++)
581 BN_div(&d,&e,&c,&a,ctx);
583 if(!BN_is_zero(&d) || !BN_is_zero(&e))
585 fprintf(stderr,"Square test failed!\n");
596 int test_mont(BIO *bp, BN_CTX *ctx)
612 mont=BN_MONT_CTX_new();
614 BN_rand(&a,100,0,0); /**/
615 BN_rand(&b,100,0,0); /**/
616 for (i=0; i<num2; i++)
618 int bits = (100%BN_BITS2+1)*BN_BITS2*i*BN_BITS2;
622 BN_rand(&n,bits,0,1);
623 BN_MONT_CTX_set(mont,&n,ctx);
625 BN_to_montgomery(&A,&a,mont,ctx);
626 BN_to_montgomery(&B,&b,mont,ctx);
629 for (j=0; j<100; j++)
630 BN_mod_mul_montgomery(&c,&A,&B,mont,ctx);/**/
631 BN_mod_mul_montgomery(&c,&A,&B,mont,ctx);/**/
632 BN_from_montgomery(&A,&c,mont,ctx);/**/
638 fprintf(stderr,"%d * %d %% %d\n",
641 BN_num_bits(mont->N));
647 BN_print(bp,&(mont->N));
653 BN_mod_mul(&d,&a,&b,&n,ctx);
657 fprintf(stderr,"Montgomery multiplication test failed!\n");
661 BN_MONT_CTX_free(mont);
672 int test_mod(BIO *bp, BN_CTX *ctx)
674 BIGNUM *a,*b,*c,*d,*e;
684 BN_rand(a,1024,0,0); /**/
685 for (i=0; i<num0; i++)
687 BN_rand(b,450+i*10,0,0); /**/
691 for (j=0; j<100; j++)
692 BN_mod(c,a,b,ctx);/**/
693 BN_mod(c,a,b,ctx);/**/
710 fprintf(stderr,"Modulo test failed!\n");
722 int test_mod_mul(BIO *bp, BN_CTX *ctx)
724 BIGNUM *a,*b,*c,*d,*e;
733 BN_rand(c,1024,0,0); /**/
734 for (i=0; i<num0; i++)
736 BN_rand(b,425+i*10,0,0); /**/
740 for (j=0; j<100; j++)
741 BN_mod_mul(d,a,b,c,ctx);*/ /**/
743 if (!BN_mod_mul(e,a,b,c,ctx))
747 while ((l=ERR_get_error()))
748 fprintf(stderr,"ERROR:%s\n",
749 ERR_error_string(l,NULL));
771 fprintf(stderr,"Modulo multiply test failed!\n");
783 int test_mod_exp(BIO *bp, BN_CTX *ctx)
785 BIGNUM *a,*b,*c,*d,*e;
794 BN_rand(c,30,0,1); /* must be odd for montgomery */
795 for (i=0; i<num2; i++)
797 BN_rand(a,20+i*5,0,0); /**/
798 BN_rand(b,2+i,0,0); /**/
800 if (!BN_mod_exp(d,a,b,c,ctx))
822 fprintf(stderr,"Modulo exponentiation test failed!\n");
834 int test_exp(BIO *bp, BN_CTX *ctx)
836 BIGNUM *a,*b,*d,*e,*one;
846 for (i=0; i<num2; i++)
848 BN_rand(a,20+i*5,0,0); /**/
849 BN_rand(b,2+i,0,0); /**/
851 if (!BN_exp(d,a,b,ctx))
867 for( ; !BN_is_zero(b) ; BN_sub(b,b,one))
872 fprintf(stderr,"Exponentiation test failed!\n");
884 int test_lshift(BIO *bp,BN_CTX *ctx,BIGNUM *a_)
899 BN_rand(a,200,0,0); /**/
902 for (i=0; i<num0; i++)
922 fprintf(stderr,"Left shift test failed!\n");
923 fprintf(stderr,"a=");
924 BN_print_fp(stderr,a);
925 fprintf(stderr,"\nb=");
926 BN_print_fp(stderr,b);
927 fprintf(stderr,"\nc=");
928 BN_print_fp(stderr,c);
929 fprintf(stderr,"\nd=");
930 BN_print_fp(stderr,d);
931 fprintf(stderr,"\n");
942 int test_lshift1(BIO *bp)
951 BN_rand(a,200,0,0); /**/
953 for (i=0; i<num0; i++)
971 fprintf(stderr,"Left shift one test failed!\n");
983 int test_rshift(BIO *bp,BN_CTX *ctx)
985 BIGNUM *a,*b,*c,*d,*e;
995 BN_rand(a,200,0,0); /**/
997 for (i=0; i<num0; i++)
1013 BN_div(d,e,a,c,ctx);
1017 fprintf(stderr,"Right shift test failed!\n");
1029 int test_rshift1(BIO *bp)
1038 BN_rand(a,200,0,0); /**/
1040 for (i=0; i<num0; i++)
1048 BIO_puts(bp," / 2");
1056 if(!BN_is_zero(c) && !BN_is_one(c))
1058 fprintf(stderr,"Right shift one test failed!\n");
1071 static unsigned int neg=0;
1072 static int sign[8]={0,0,0,1,1,0,1,1};
1074 return(sign[(neg++)%8]);