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 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);
98 static unsigned char list1[]="\xC6\x4F\x43\x04\x2A\xEA\xCA\x6E\x58\x36\x80\x5B\xE8\xC9"
99 "\x9B\x04\x5D\x48\x36\xC2\xFD\x16\xC9\x64\xF0";
101 static const char rnd_seed[] = "string to make the random number generator think it has entropy";
103 int main(int argc, char *argv[])
111 RAND_seed(rnd_seed, sizeof rnd_seed); /* or BN_rand may fail, and we don't
112 * even check its return value
113 * (which we should) */
119 if (strcmp(*argv,"-results") == 0)
121 else if (strcmp(*argv,"-out") == 0)
123 if (--argc < 1) break;
132 if (ctx == NULL) exit(1);
134 out=BIO_new(BIO_s_file());
135 if (out == NULL) exit(1);
138 BIO_set_fp(out,stdout,BIO_NOCLOSE);
142 if (!BIO_write_filename(out,outfile))
150 BIO_puts(out,"obase=16\nibase=16\n");
152 fprintf(stderr,"test BN_add\n");
153 if (!test_add(out)) goto err;
156 fprintf(stderr,"test BN_sub\n");
157 if (!test_sub(out)) goto err;
160 fprintf(stderr,"test BN_lshift1\n");
161 if (!test_lshift1(out)) goto err;
164 fprintf(stderr,"test BN_lshift (fixed)\n");
165 if (!test_lshift(out,ctx,BN_bin2bn(list1,sizeof(list1)-1,NULL)))
169 fprintf(stderr,"test BN_lshift\n");
170 if (!test_lshift(out,ctx,NULL)) goto err;
173 fprintf(stderr,"test BN_rshift1\n");
174 if (!test_rshift1(out)) goto err;
177 fprintf(stderr,"test BN_rshift\n");
178 if (!test_rshift(out,ctx)) goto err;
181 fprintf(stderr,"test BN_sqr\n");
182 if (!test_sqr(out,ctx)) goto err;
185 fprintf(stderr,"test BN_mul\n");
186 if (!test_mul(out)) goto err;
189 fprintf(stderr,"test BN_div\n");
190 if (!test_div(out,ctx)) goto err;
193 fprintf(stderr,"test BN_div_recp\n");
194 if (!test_div_recp(out,ctx)) goto err;
197 fprintf(stderr,"test BN_mod\n");
198 if (!test_mod(out,ctx)) goto err;
201 fprintf(stderr,"test BN_mod_mul\n");
202 if (!test_mod_mul(out,ctx)) goto err;
206 fprintf(stderr,"test BN_mont\n");
207 if (!test_mont(out,ctx)) goto err;
210 fprintf(stderr,"test BN_mod_exp\n");
211 if (!test_mod_exp(out,ctx)) goto err;
214 fprintf(stderr,"test BN_exp\n");
215 if (!test_exp(out,ctx)) goto err;
224 BIO_puts(out,"1\n"); /* make sure bc fails if we are piping to it */
225 ERR_load_crypto_strings();
226 ERR_print_errors(out);
231 int test_add(BIO *bp)
242 for (i=0; i<100; i++)
244 BN_rand(&b,450+i,0,0);
248 for (j=0; j<10000; j++)
269 BIO_puts(bp,"Add test failed!\n");
279 int test_sub(BIO *bp)
290 for (i=0; i<100; i++)
292 BN_rand(&b,400+i,0,0);
296 for (j=0; j<10000; j++)
315 BIO_puts(bp,"Subtract test failed!\n");
325 int test_div(BIO *bp, BN_CTX *ctx)
338 for (i=0; i<100; i++)
340 BN_rand(&b,50+i,0,0);
344 for (j=0; j<100; j++)
345 BN_div(&d,&c,&a,&b,ctx);
346 BN_div(&d,&c,&a,&b,ctx);
369 BN_mul(&e,&d,&b,ctx);
374 BIO_puts(bp,"Division test failed!\n");
386 int test_div_recp(BIO *bp, BN_CTX *ctx)
393 BN_RECP_CTX_init(&recp);
401 for (i=0; i<100; i++)
403 BN_rand(&b,50+i,0,0);
406 BN_RECP_CTX_set(&recp,&b,ctx);
408 for (j=0; j<100; j++)
409 BN_div_recp(&d,&c,&a,&recp,ctx);
410 BN_div_recp(&d,&c,&a,&recp,ctx);
433 BN_mul(&e,&d,&b,ctx);
438 BIO_puts(bp,"Reciprocal division test failed!\n");
447 BN_RECP_CTX_free(&recp);
451 int test_mul(BIO *bp)
466 for (i=0; i<100; i++)
468 BN_rand(&b,250+i,0,0);
473 for (j=0; j<100; j++)
474 BN_mul(&c,&a,&b,&ctx);
475 BN_mul(&c,&a,&b,&ctx);
488 BN_div(&d,&e,&c,&a,&ctx);
490 if(!BN_is_zero(&d) || !BN_is_zero(&e))
492 BIO_puts(bp,"Multiplication test failed!\n");
505 int test_sqr(BIO *bp, BN_CTX *ctx)
518 BN_rand(&a,40+i*10,0,0);
521 for (j=0; j<100; j++)
536 BN_div(&d,&e,&c,&a,ctx);
538 if(!BN_is_zero(&d) || !BN_is_zero(&e))
540 BIO_puts(bp,"Square test failed!\n");
551 int test_mont(BIO *bp, BN_CTX *ctx)
567 mont=BN_MONT_CTX_new();
569 BN_rand(&a,100,0,0); /**/
570 BN_rand(&b,100,0,0); /**/
573 BN_rand(&n,(100%BN_BITS2+1)*BN_BITS2*i*BN_BITS2,0,1); /**/
574 BN_MONT_CTX_set(mont,&n,ctx);
576 BN_to_montgomery(&A,&a,mont,ctx);
577 BN_to_montgomery(&B,&b,mont,ctx);
580 for (j=0; j<100; j++)
581 BN_mod_mul_montgomery(&c,&A,&B,mont,ctx);/**/
582 BN_mod_mul_montgomery(&c,&A,&B,mont,ctx);/**/
583 BN_from_montgomery(&A,&c,mont,ctx);/**/
589 fprintf(stderr,"%d * %d %% %d\n",
592 BN_num_bits(mont->N));
598 BN_print(bp,&(mont->N));
604 BN_mod_mul(&d,&a,&b,&n,ctx);
608 BIO_puts(bp,"Montgomery multiplication test failed!\n");
612 BN_MONT_CTX_free(mont);
623 int test_mod(BIO *bp, BN_CTX *ctx)
625 BIGNUM *a,*b,*c,*d,*e;
635 BN_rand(a,1024,0,0); /**/
638 BN_rand(b,450+i*10,0,0); /**/
642 for (j=0; j<100; j++)
643 BN_mod(c,a,b,ctx);/**/
644 BN_mod(c,a,b,ctx);/**/
661 BIO_puts(bp,"Modulo test failed!\n");
673 int test_mod_mul(BIO *bp, BN_CTX *ctx)
675 BIGNUM *a,*b,*c,*d,*e;
684 BN_rand(c,1024,0,0); /**/
687 BN_rand(a,475+i*10,0,0); /**/
688 BN_rand(b,425+i*10,0,0); /**/
692 for (j=0; j<100; j++)
693 BN_mod_mul(d,a,b,c,ctx);*/ /**/
695 if (!BN_mod_mul(e,a,b,c,ctx))
699 while ((l=ERR_get_error()))
700 fprintf(stderr,"ERROR:%s\n",
701 ERR_error_string(l,NULL));
723 BIO_puts(bp,"Modulo multiply test failed!\n");
735 int test_mod_exp(BIO *bp, BN_CTX *ctx)
737 BIGNUM *a,*b,*c,*d,*e;
746 BN_rand(c,30,0,1); /* must be odd for montgomery */
749 BN_rand(a,20+i*5,0,0); /**/
750 BN_rand(b,2+i,0,0); /**/
752 if (!BN_mod_exp(d,a,b,c,ctx))
774 BIO_puts(bp,"Modulo exponentiation test failed!\n");
786 int test_exp(BIO *bp, BN_CTX *ctx)
788 BIGNUM *a,*b,*d,*e,*one;
800 BN_rand(a,20+i*5,0,0); /**/
801 BN_rand(b,2+i,0,0); /**/
803 if (!BN_exp(d,a,b,ctx))
819 for( ; !BN_is_zero(b) ; BN_sub(b,b,one))
824 BIO_puts(bp,"Exponentiation test failed!\n");
836 int test_lshift(BIO *bp,BN_CTX *ctx,BIGNUM *a_)
851 BN_rand(a,200,0,0); /**/
874 BIO_puts(bp,"Left shift test failed!\n");
894 int test_lshift1(BIO *bp)
903 BN_rand(a,200,0,0); /**/
923 BIO_puts(bp,"Left shift one test failed!\n");
935 int test_rshift(BIO *bp,BN_CTX *ctx)
937 BIGNUM *a,*b,*c,*d,*e;
947 BN_rand(a,200,0,0); /**/
969 BIO_puts(bp,"Right shift test failed!\n");
981 int test_rshift1(BIO *bp)
990 BN_rand(a,200,0,0); /**/
1000 BIO_puts(bp," / 2");
1008 if(!BN_is_zero(c) && !BN_is_one(c))
1010 BIO_puts(bp,"Right shift one test failed!\n");
1023 static unsigned int neg=0;
1024 static int sign[8]={0,0,0,1,1,0,1,1};
1026 return(sign[(neg++)%8]);