]>
Commit | Line | Data |
---|---|---|
d02b48c6 | 1 | /* crypto/bn/bntest.c */ |
58964a49 | 2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) |
d02b48c6 RE |
3 | * All rights reserved. |
4 | * | |
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. | |
8 | * | |
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). | |
15 | * | |
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. | |
22 | * | |
23 | * Redistribution and use in source and binary forms, with or without | |
24 | * modification, are permitted provided that the following conditions | |
25 | * are met: | |
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)" | |
40 | * | |
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 | |
51 | * SUCH DAMAGE. | |
52 | * | |
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.] | |
57 | */ | |
1dc920c8 BM |
58 | /* ==================================================================== |
59 | * Copyright 2002 Sun Microsystems, Inc. ALL RIGHTS RESERVED. | |
60 | * | |
61 | * Portions of the attached software ("Contribution") are developed by | |
62 | * SUN MICROSYSTEMS, INC., and are contributed to the OpenSSL project. | |
63 | * | |
64 | * The Contribution is licensed pursuant to the Eric Young open source | |
65 | * license provided above. | |
66 | * | |
1dc920c8 BM |
67 | * The binary polynomial arithmetic software is originally written by |
68 | * Sheueling Chang Shantz and Douglas Stebila of Sun Microsystems Laboratories. | |
69 | * | |
70 | */ | |
d02b48c6 | 71 | |
e9224c71 GT |
72 | /* Until the key-gen callbacks are modified to use newer prototypes, we allow |
73 | * deprecated functions for openssl-internal code */ | |
74 | #ifdef OPENSSL_NO_DEPRECATED | |
75 | #undef OPENSSL_NO_DEPRECATED | |
76 | #endif | |
77 | ||
d02b48c6 RE |
78 | #include <stdio.h> |
79 | #include <stdlib.h> | |
80 | #include <string.h> | |
17e3dd1c | 81 | |
41d2a336 | 82 | #include "e_os.h" |
17e3dd1c | 83 | |
ec577822 BM |
84 | #include <openssl/bio.h> |
85 | #include <openssl/bn.h> | |
86 | #include <openssl/rand.h> | |
87 | #include <openssl/x509.h> | |
88 | #include <openssl/err.h> | |
d02b48c6 | 89 | |
f07fb9b2 DSH |
90 | const int num0 = 100; /* number of tests */ |
91 | const int num1 = 50; /* additional tests for some functions */ | |
92 | const int num2 = 5; /* number of tests for slow functions */ | |
cae55bfc | 93 | |
dfeab068 RE |
94 | int test_add(BIO *bp); |
95 | int test_sub(BIO *bp); | |
96 | int test_lshift1(BIO *bp); | |
4da88a8d | 97 | int test_lshift(BIO *bp,BN_CTX *ctx,BIGNUM *a_); |
dfeab068 | 98 | int test_rshift1(BIO *bp); |
62bad771 | 99 | int test_rshift(BIO *bp,BN_CTX *ctx); |
dfeab068 | 100 | int test_div(BIO *bp,BN_CTX *ctx); |
cf9056cf | 101 | int test_div_word(BIO *bp); |
dfeab068 RE |
102 | int test_div_recp(BIO *bp,BN_CTX *ctx); |
103 | int test_mul(BIO *bp); | |
104 | int test_sqr(BIO *bp,BN_CTX *ctx); | |
105 | int test_mont(BIO *bp,BN_CTX *ctx); | |
106 | int test_mod(BIO *bp,BN_CTX *ctx); | |
107 | int test_mod_mul(BIO *bp,BN_CTX *ctx); | |
108 | int test_mod_exp(BIO *bp,BN_CTX *ctx); | |
46a64376 | 109 | int test_mod_exp_mont_consttime(BIO *bp,BN_CTX *ctx); |
a0a54079 | 110 | int test_exp(BIO *bp,BN_CTX *ctx); |
1dc920c8 BM |
111 | int test_gf2m_add(BIO *bp); |
112 | int test_gf2m_mod(BIO *bp); | |
113 | int test_gf2m_mod_mul(BIO *bp,BN_CTX *ctx); | |
114 | int test_gf2m_mod_sqr(BIO *bp,BN_CTX *ctx); | |
115 | int test_gf2m_mod_inv(BIO *bp,BN_CTX *ctx); | |
116 | int test_gf2m_mod_div(BIO *bp,BN_CTX *ctx); | |
117 | int test_gf2m_mod_exp(BIO *bp,BN_CTX *ctx); | |
118 | int test_gf2m_mod_sqrt(BIO *bp,BN_CTX *ctx); | |
119 | int test_gf2m_mod_solve_quad(BIO *bp,BN_CTX *ctx); | |
c7820896 | 120 | int test_kron(BIO *bp,BN_CTX *ctx); |
cd2eebfd | 121 | int test_sqrt(BIO *bp,BN_CTX *ctx); |
d02b48c6 | 122 | int rand_neg(void); |
d02b48c6 RE |
123 | static int results=0; |
124 | ||
b25c8db8 | 125 | static unsigned char lst[]="\xC6\x4F\x43\x04\x2A\xEA\xCA\x6E\x58\x36\x80\x5B\xE8\xC9" |
4da88a8d BL |
126 | "\x9B\x04\x5D\x48\x36\xC2\xFD\x16\xC9\x64\xF0"; |
127 | ||
0c50e02b BM |
128 | static const char rnd_seed[] = "string to make the random number generator think it has entropy"; |
129 | ||
667ac4ec | 130 | static void message(BIO *out, char *m) |
cae55bfc UM |
131 | { |
132 | fprintf(stderr, "test %s\n", m); | |
cae55bfc UM |
133 | BIO_puts(out, "print \"test "); |
134 | BIO_puts(out, m); | |
135 | BIO_puts(out, "\\n\"\n"); | |
cae55bfc UM |
136 | } |
137 | ||
6b691a5c | 138 | int main(int argc, char *argv[]) |
d02b48c6 RE |
139 | { |
140 | BN_CTX *ctx; | |
141 | BIO *out; | |
142 | char *outfile=NULL; | |
143 | ||
79875776 BM |
144 | results = 0; |
145 | ||
111482cf | 146 | RAND_seed(rnd_seed, sizeof rnd_seed); /* or BN_generate_prime may fail */ |
0c50e02b | 147 | |
d02b48c6 RE |
148 | argc--; |
149 | argv++; | |
150 | while (argc >= 1) | |
151 | { | |
152 | if (strcmp(*argv,"-results") == 0) | |
153 | results=1; | |
154 | else if (strcmp(*argv,"-out") == 0) | |
155 | { | |
156 | if (--argc < 1) break; | |
157 | outfile= *(++argv); | |
158 | } | |
159 | argc--; | |
160 | argv++; | |
161 | } | |
162 | ||
163 | ||
164 | ctx=BN_CTX_new(); | |
55f78baf | 165 | if (ctx == NULL) EXIT(1); |
d02b48c6 RE |
166 | |
167 | out=BIO_new(BIO_s_file()); | |
55f78baf | 168 | if (out == NULL) EXIT(1); |
d02b48c6 RE |
169 | if (outfile == NULL) |
170 | { | |
171 | BIO_set_fp(out,stdout,BIO_NOCLOSE); | |
172 | } | |
173 | else | |
174 | { | |
175 | if (!BIO_write_filename(out,outfile)) | |
176 | { | |
177 | perror(outfile); | |
55f78baf | 178 | EXIT(1); |
d02b48c6 RE |
179 | } |
180 | } | |
181 | ||
182 | if (!results) | |
183 | BIO_puts(out,"obase=16\nibase=16\n"); | |
184 | ||
cae55bfc | 185 | message(out,"BN_add"); |
d02b48c6 | 186 | if (!test_add(out)) goto err; |
f36e02b2 | 187 | BIO_flush(out); |
d02b48c6 | 188 | |
cae55bfc | 189 | message(out,"BN_sub"); |
d02b48c6 | 190 | if (!test_sub(out)) goto err; |
f36e02b2 | 191 | BIO_flush(out); |
d02b48c6 | 192 | |
cae55bfc | 193 | message(out,"BN_lshift1"); |
d02b48c6 | 194 | if (!test_lshift1(out)) goto err; |
f36e02b2 | 195 | BIO_flush(out); |
d02b48c6 | 196 | |
cae55bfc | 197 | message(out,"BN_lshift (fixed)"); |
b25c8db8 | 198 | if (!test_lshift(out,ctx,BN_bin2bn(lst,sizeof(lst)-1,NULL))) |
4da88a8d | 199 | goto err; |
f36e02b2 | 200 | BIO_flush(out); |
4da88a8d | 201 | |
cae55bfc | 202 | message(out,"BN_lshift"); |
4da88a8d | 203 | if (!test_lshift(out,ctx,NULL)) goto err; |
f36e02b2 | 204 | BIO_flush(out); |
d02b48c6 | 205 | |
cae55bfc | 206 | message(out,"BN_rshift1"); |
d02b48c6 | 207 | if (!test_rshift1(out)) goto err; |
f36e02b2 | 208 | BIO_flush(out); |
d02b48c6 | 209 | |
cae55bfc | 210 | message(out,"BN_rshift"); |
62bad771 | 211 | if (!test_rshift(out,ctx)) goto err; |
f36e02b2 | 212 | BIO_flush(out); |
d02b48c6 | 213 | |
cae55bfc | 214 | message(out,"BN_sqr"); |
58964a49 | 215 | if (!test_sqr(out,ctx)) goto err; |
f36e02b2 | 216 | BIO_flush(out); |
d02b48c6 | 217 | |
cae55bfc | 218 | message(out,"BN_mul"); |
d02b48c6 | 219 | if (!test_mul(out)) goto err; |
f36e02b2 | 220 | BIO_flush(out); |
d02b48c6 | 221 | |
cae55bfc | 222 | message(out,"BN_div"); |
58964a49 | 223 | if (!test_div(out,ctx)) goto err; |
f36e02b2 | 224 | BIO_flush(out); |
58964a49 | 225 | |
cf9056cf GT |
226 | message(out,"BN_div_word"); |
227 | if (!test_div_word(out)) goto err; | |
228 | BIO_flush(out); | |
229 | ||
cae55bfc | 230 | message(out,"BN_div_recp"); |
dfeab068 | 231 | if (!test_div_recp(out,ctx)) goto err; |
f36e02b2 | 232 | BIO_flush(out); |
dfeab068 | 233 | |
cae55bfc | 234 | message(out,"BN_mod"); |
58964a49 | 235 | if (!test_mod(out,ctx)) goto err; |
f36e02b2 | 236 | BIO_flush(out); |
d02b48c6 | 237 | |
cae55bfc | 238 | message(out,"BN_mod_mul"); |
d02b48c6 | 239 | if (!test_mod_mul(out,ctx)) goto err; |
f36e02b2 | 240 | BIO_flush(out); |
d02b48c6 | 241 | |
cae55bfc | 242 | message(out,"BN_mont"); |
d02b48c6 | 243 | if (!test_mont(out,ctx)) goto err; |
f36e02b2 | 244 | BIO_flush(out); |
6e0cad8d | 245 | |
cae55bfc | 246 | message(out,"BN_mod_exp"); |
d02b48c6 | 247 | if (!test_mod_exp(out,ctx)) goto err; |
f36e02b2 | 248 | BIO_flush(out); |
d02b48c6 | 249 | |
46a64376 BM |
250 | message(out,"BN_mod_exp_mont_consttime"); |
251 | if (!test_mod_exp_mont_consttime(out,ctx)) goto err; | |
252 | BIO_flush(out); | |
253 | ||
cae55bfc | 254 | message(out,"BN_exp"); |
a0a54079 | 255 | if (!test_exp(out,ctx)) goto err; |
f36e02b2 | 256 | BIO_flush(out); |
a0a54079 | 257 | |
5af7d1a3 BM |
258 | message(out,"BN_kronecker"); |
259 | if (!test_kron(out,ctx)) goto err; | |
260 | BIO_flush(out); | |
261 | ||
262 | message(out,"BN_mod_sqrt"); | |
263 | if (!test_sqrt(out,ctx)) goto err; | |
264 | BIO_flush(out); | |
265 | ||
1dc920c8 BM |
266 | message(out,"BN_GF2m_add"); |
267 | if (!test_gf2m_add(out)) goto err; | |
268 | BIO_flush(out); | |
269 | ||
270 | message(out,"BN_GF2m_mod"); | |
271 | if (!test_gf2m_mod(out)) goto err; | |
272 | BIO_flush(out); | |
273 | ||
274 | message(out,"BN_GF2m_mod_mul"); | |
275 | if (!test_gf2m_mod_mul(out,ctx)) goto err; | |
276 | BIO_flush(out); | |
277 | ||
278 | message(out,"BN_GF2m_mod_sqr"); | |
279 | if (!test_gf2m_mod_sqr(out,ctx)) goto err; | |
280 | BIO_flush(out); | |
281 | ||
282 | message(out,"BN_GF2m_mod_inv"); | |
283 | if (!test_gf2m_mod_inv(out,ctx)) goto err; | |
284 | BIO_flush(out); | |
285 | ||
286 | message(out,"BN_GF2m_mod_div"); | |
287 | if (!test_gf2m_mod_div(out,ctx)) goto err; | |
288 | BIO_flush(out); | |
289 | ||
290 | message(out,"BN_GF2m_mod_exp"); | |
291 | if (!test_gf2m_mod_exp(out,ctx)) goto err; | |
292 | BIO_flush(out); | |
293 | ||
294 | message(out,"BN_GF2m_mod_sqrt"); | |
295 | if (!test_gf2m_mod_sqrt(out,ctx)) goto err; | |
296 | BIO_flush(out); | |
297 | ||
298 | message(out,"BN_GF2m_mod_solve_quad"); | |
299 | if (!test_gf2m_mod_solve_quad(out,ctx)) goto err; | |
300 | BIO_flush(out); | |
301 | ||
79875776 BM |
302 | BN_CTX_free(ctx); |
303 | BIO_free(out); | |
304 | ||
d02b48c6 | 305 | /**/ |
55f78baf | 306 | EXIT(0); |
d02b48c6 | 307 | err: |
df83eeb7 BM |
308 | BIO_puts(out,"1\n"); /* make sure the Perl script fed by bc notices |
309 | * the failure, see test_bn in test/Makefile.ssl*/ | |
f36e02b2 | 310 | BIO_flush(out); |
d02b48c6 | 311 | ERR_load_crypto_strings(); |
cae55bfc | 312 | ERR_print_errors_fp(stderr); |
55f78baf | 313 | EXIT(1); |
d02b48c6 RE |
314 | return(1); |
315 | } | |
316 | ||
6b691a5c | 317 | int test_add(BIO *bp) |
d02b48c6 | 318 | { |
dfeab068 | 319 | BIGNUM a,b,c; |
d02b48c6 | 320 | int i; |
d02b48c6 | 321 | |
dfeab068 RE |
322 | BN_init(&a); |
323 | BN_init(&b); | |
324 | BN_init(&c); | |
d02b48c6 | 325 | |
111482cf | 326 | BN_bntest_rand(&a,512,0,0); |
cae55bfc | 327 | for (i=0; i<num0; i++) |
d02b48c6 | 328 | { |
111482cf | 329 | BN_bntest_rand(&b,450+i,0,0); |
dfeab068 RE |
330 | a.neg=rand_neg(); |
331 | b.neg=rand_neg(); | |
dfeab068 | 332 | BN_add(&c,&a,&b); |
d02b48c6 RE |
333 | if (bp != NULL) |
334 | { | |
335 | if (!results) | |
336 | { | |
dfeab068 | 337 | BN_print(bp,&a); |
d02b48c6 | 338 | BIO_puts(bp," + "); |
dfeab068 | 339 | BN_print(bp,&b); |
d02b48c6 RE |
340 | BIO_puts(bp," - "); |
341 | } | |
dfeab068 | 342 | BN_print(bp,&c); |
d02b48c6 RE |
343 | BIO_puts(bp,"\n"); |
344 | } | |
62bad771 BL |
345 | a.neg=!a.neg; |
346 | b.neg=!b.neg; | |
347 | BN_add(&c,&c,&b); | |
348 | BN_add(&c,&c,&a); | |
349 | if(!BN_is_zero(&c)) | |
350 | { | |
cae55bfc | 351 | fprintf(stderr,"Add test failed!\n"); |
62bad771 BL |
352 | return 0; |
353 | } | |
d02b48c6 | 354 | } |
dfeab068 RE |
355 | BN_free(&a); |
356 | BN_free(&b); | |
357 | BN_free(&c); | |
d02b48c6 RE |
358 | return(1); |
359 | } | |
360 | ||
6b691a5c | 361 | int test_sub(BIO *bp) |
d02b48c6 | 362 | { |
dfeab068 | 363 | BIGNUM a,b,c; |
d02b48c6 | 364 | int i; |
d02b48c6 | 365 | |
dfeab068 RE |
366 | BN_init(&a); |
367 | BN_init(&b); | |
368 | BN_init(&c); | |
d02b48c6 | 369 | |
cae55bfc | 370 | for (i=0; i<num0+num1; i++) |
d02b48c6 | 371 | { |
cae55bfc UM |
372 | if (i < num1) |
373 | { | |
111482cf | 374 | BN_bntest_rand(&a,512,0,0); |
cae55bfc UM |
375 | BN_copy(&b,&a); |
376 | if (BN_set_bit(&a,i)==0) return(0); | |
377 | BN_add_word(&b,i); | |
378 | } | |
379 | else | |
380 | { | |
111482cf | 381 | BN_bntest_rand(&b,400+i-num1,0,0); |
cae55bfc UM |
382 | a.neg=rand_neg(); |
383 | b.neg=rand_neg(); | |
384 | } | |
dfeab068 | 385 | BN_sub(&c,&a,&b); |
d02b48c6 RE |
386 | if (bp != NULL) |
387 | { | |
388 | if (!results) | |
389 | { | |
dfeab068 | 390 | BN_print(bp,&a); |
d02b48c6 | 391 | BIO_puts(bp," - "); |
dfeab068 | 392 | BN_print(bp,&b); |
d02b48c6 RE |
393 | BIO_puts(bp," - "); |
394 | } | |
dfeab068 | 395 | BN_print(bp,&c); |
d02b48c6 RE |
396 | BIO_puts(bp,"\n"); |
397 | } | |
62bad771 BL |
398 | BN_add(&c,&c,&b); |
399 | BN_sub(&c,&c,&a); | |
400 | if(!BN_is_zero(&c)) | |
401 | { | |
cae55bfc | 402 | fprintf(stderr,"Subtract test failed!\n"); |
62bad771 BL |
403 | return 0; |
404 | } | |
d02b48c6 | 405 | } |
dfeab068 RE |
406 | BN_free(&a); |
407 | BN_free(&b); | |
408 | BN_free(&c); | |
d02b48c6 RE |
409 | return(1); |
410 | } | |
411 | ||
6b691a5c | 412 | int test_div(BIO *bp, BN_CTX *ctx) |
d02b48c6 | 413 | { |
62bad771 | 414 | BIGNUM a,b,c,d,e; |
d02b48c6 | 415 | int i; |
d02b48c6 | 416 | |
dfeab068 RE |
417 | BN_init(&a); |
418 | BN_init(&b); | |
419 | BN_init(&c); | |
420 | BN_init(&d); | |
62bad771 | 421 | BN_init(&e); |
d02b48c6 | 422 | |
cae55bfc | 423 | for (i=0; i<num0+num1; i++) |
d02b48c6 | 424 | { |
cae55bfc UM |
425 | if (i < num1) |
426 | { | |
111482cf | 427 | BN_bntest_rand(&a,400,0,0); |
cae55bfc UM |
428 | BN_copy(&b,&a); |
429 | BN_lshift(&a,&a,i); | |
430 | BN_add_word(&a,i); | |
431 | } | |
432 | else | |
111482cf | 433 | BN_bntest_rand(&b,50+3*(i-num1),0,0); |
dfeab068 RE |
434 | a.neg=rand_neg(); |
435 | b.neg=rand_neg(); | |
dfeab068 | 436 | BN_div(&d,&c,&a,&b,ctx); |
d02b48c6 RE |
437 | if (bp != NULL) |
438 | { | |
439 | if (!results) | |
440 | { | |
dfeab068 | 441 | BN_print(bp,&a); |
d02b48c6 | 442 | BIO_puts(bp," / "); |
dfeab068 | 443 | BN_print(bp,&b); |
d02b48c6 RE |
444 | BIO_puts(bp," - "); |
445 | } | |
dfeab068 | 446 | BN_print(bp,&d); |
d02b48c6 RE |
447 | BIO_puts(bp,"\n"); |
448 | ||
449 | if (!results) | |
450 | { | |
dfeab068 | 451 | BN_print(bp,&a); |
d02b48c6 | 452 | BIO_puts(bp," % "); |
dfeab068 | 453 | BN_print(bp,&b); |
d02b48c6 RE |
454 | BIO_puts(bp," - "); |
455 | } | |
dfeab068 | 456 | BN_print(bp,&c); |
d02b48c6 RE |
457 | BIO_puts(bp,"\n"); |
458 | } | |
62bad771 BL |
459 | BN_mul(&e,&d,&b,ctx); |
460 | BN_add(&d,&e,&c); | |
461 | BN_sub(&d,&d,&a); | |
462 | if(!BN_is_zero(&d)) | |
463 | { | |
cae55bfc | 464 | fprintf(stderr,"Division test failed!\n"); |
62bad771 BL |
465 | return 0; |
466 | } | |
d02b48c6 | 467 | } |
dfeab068 RE |
468 | BN_free(&a); |
469 | BN_free(&b); | |
470 | BN_free(&c); | |
471 | BN_free(&d); | |
62bad771 | 472 | BN_free(&e); |
dfeab068 RE |
473 | return(1); |
474 | } | |
475 | ||
8169dd73 AP |
476 | static void print_word(BIO *bp,BN_ULONG w) |
477 | { | |
478 | #ifdef SIXTY_FOUR_BIT | |
479 | if (sizeof(w) > sizeof(unsigned long)) | |
480 | { | |
481 | unsigned long h=(unsigned long)(w>>32), | |
482 | l=(unsigned long)(w); | |
483 | ||
484 | if (h) BIO_printf(bp,"%lX%08lX",h,l); | |
485 | else BIO_printf(bp,"%lX",l); | |
486 | return; | |
487 | } | |
488 | #endif | |
4a47f556 | 489 | BIO_printf(bp,BN_HEX_FMT1,w); |
8169dd73 AP |
490 | } |
491 | ||
cf9056cf GT |
492 | int test_div_word(BIO *bp) |
493 | { | |
494 | BIGNUM a,b; | |
495 | BN_ULONG r,s; | |
496 | int i; | |
497 | ||
498 | BN_init(&a); | |
499 | BN_init(&b); | |
500 | ||
501 | for (i=0; i<num0; i++) | |
502 | { | |
503 | do { | |
504 | BN_bntest_rand(&a,512,-1,0); | |
505 | BN_bntest_rand(&b,BN_BITS2,-1,0); | |
506 | s = b.d[0]; | |
507 | } while (!s); | |
508 | ||
509 | BN_copy(&b, &a); | |
510 | r = BN_div_word(&b, s); | |
511 | ||
512 | if (bp != NULL) | |
513 | { | |
514 | if (!results) | |
515 | { | |
516 | BN_print(bp,&a); | |
517 | BIO_puts(bp," / "); | |
8169dd73 | 518 | print_word(bp,s); |
cf9056cf GT |
519 | BIO_puts(bp," - "); |
520 | } | |
521 | BN_print(bp,&b); | |
522 | BIO_puts(bp,"\n"); | |
523 | ||
524 | if (!results) | |
525 | { | |
526 | BN_print(bp,&a); | |
527 | BIO_puts(bp," % "); | |
8169dd73 | 528 | print_word(bp,s); |
cf9056cf GT |
529 | BIO_puts(bp," - "); |
530 | } | |
8169dd73 | 531 | print_word(bp,r); |
cf9056cf GT |
532 | BIO_puts(bp,"\n"); |
533 | } | |
534 | BN_mul_word(&b,s); | |
535 | BN_add_word(&b,r); | |
536 | BN_sub(&b,&a,&b); | |
537 | if(!BN_is_zero(&b)) | |
538 | { | |
539 | fprintf(stderr,"Division (word) test failed!\n"); | |
540 | return 0; | |
541 | } | |
542 | } | |
543 | BN_free(&a); | |
544 | BN_free(&b); | |
545 | return(1); | |
546 | } | |
547 | ||
6b691a5c | 548 | int test_div_recp(BIO *bp, BN_CTX *ctx) |
dfeab068 | 549 | { |
62bad771 | 550 | BIGNUM a,b,c,d,e; |
dfeab068 RE |
551 | BN_RECP_CTX recp; |
552 | int i; | |
dfeab068 RE |
553 | |
554 | BN_RECP_CTX_init(&recp); | |
555 | BN_init(&a); | |
556 | BN_init(&b); | |
557 | BN_init(&c); | |
558 | BN_init(&d); | |
62bad771 | 559 | BN_init(&e); |
dfeab068 | 560 | |
cae55bfc | 561 | for (i=0; i<num0+num1; i++) |
dfeab068 | 562 | { |
cae55bfc UM |
563 | if (i < num1) |
564 | { | |
111482cf | 565 | BN_bntest_rand(&a,400,0,0); |
cae55bfc UM |
566 | BN_copy(&b,&a); |
567 | BN_lshift(&a,&a,i); | |
568 | BN_add_word(&a,i); | |
569 | } | |
570 | else | |
111482cf | 571 | BN_bntest_rand(&b,50+3*(i-num1),0,0); |
dfeab068 RE |
572 | a.neg=rand_neg(); |
573 | b.neg=rand_neg(); | |
574 | BN_RECP_CTX_set(&recp,&b,ctx); | |
dfeab068 RE |
575 | BN_div_recp(&d,&c,&a,&recp,ctx); |
576 | if (bp != NULL) | |
577 | { | |
578 | if (!results) | |
579 | { | |
580 | BN_print(bp,&a); | |
581 | BIO_puts(bp," / "); | |
582 | BN_print(bp,&b); | |
583 | BIO_puts(bp," - "); | |
584 | } | |
585 | BN_print(bp,&d); | |
586 | BIO_puts(bp,"\n"); | |
587 | ||
588 | if (!results) | |
589 | { | |
590 | BN_print(bp,&a); | |
591 | BIO_puts(bp," % "); | |
592 | BN_print(bp,&b); | |
593 | BIO_puts(bp," - "); | |
594 | } | |
595 | BN_print(bp,&c); | |
596 | BIO_puts(bp,"\n"); | |
597 | } | |
62bad771 BL |
598 | BN_mul(&e,&d,&b,ctx); |
599 | BN_add(&d,&e,&c); | |
600 | BN_sub(&d,&d,&a); | |
601 | if(!BN_is_zero(&d)) | |
602 | { | |
cae55bfc UM |
603 | fprintf(stderr,"Reciprocal division test failed!\n"); |
604 | fprintf(stderr,"a="); | |
605 | BN_print_fp(stderr,&a); | |
606 | fprintf(stderr,"\nb="); | |
607 | BN_print_fp(stderr,&b); | |
608 | fprintf(stderr,"\n"); | |
62bad771 BL |
609 | return 0; |
610 | } | |
dfeab068 RE |
611 | } |
612 | BN_free(&a); | |
613 | BN_free(&b); | |
614 | BN_free(&c); | |
615 | BN_free(&d); | |
62bad771 | 616 | BN_free(&e); |
dfeab068 | 617 | BN_RECP_CTX_free(&recp); |
d02b48c6 RE |
618 | return(1); |
619 | } | |
620 | ||
6b691a5c | 621 | int test_mul(BIO *bp) |
d02b48c6 | 622 | { |
62bad771 | 623 | BIGNUM a,b,c,d,e; |
d02b48c6 | 624 | int i; |
c62b26fd | 625 | BN_CTX *ctx; |
d02b48c6 | 626 | |
c62b26fd | 627 | ctx = BN_CTX_new(); |
55f78baf | 628 | if (ctx == NULL) EXIT(1); |
c62b26fd | 629 | |
dfeab068 RE |
630 | BN_init(&a); |
631 | BN_init(&b); | |
632 | BN_init(&c); | |
62bad771 BL |
633 | BN_init(&d); |
634 | BN_init(&e); | |
d02b48c6 | 635 | |
cae55bfc | 636 | for (i=0; i<num0+num1; i++) |
d02b48c6 | 637 | { |
587bb0e0 | 638 | if (i <= num1) |
cae55bfc | 639 | { |
111482cf UM |
640 | BN_bntest_rand(&a,100,0,0); |
641 | BN_bntest_rand(&b,100,0,0); | |
cae55bfc UM |
642 | } |
643 | else | |
111482cf | 644 | BN_bntest_rand(&b,i-num1,0,0); |
dfeab068 RE |
645 | a.neg=rand_neg(); |
646 | b.neg=rand_neg(); | |
c62b26fd | 647 | BN_mul(&c,&a,&b,ctx); |
d02b48c6 RE |
648 | if (bp != NULL) |
649 | { | |
650 | if (!results) | |
651 | { | |
dfeab068 | 652 | BN_print(bp,&a); |
d02b48c6 | 653 | BIO_puts(bp," * "); |
dfeab068 | 654 | BN_print(bp,&b); |
d02b48c6 RE |
655 | BIO_puts(bp," - "); |
656 | } | |
dfeab068 | 657 | BN_print(bp,&c); |
d02b48c6 RE |
658 | BIO_puts(bp,"\n"); |
659 | } | |
c62b26fd | 660 | BN_div(&d,&e,&c,&a,ctx); |
62bad771 BL |
661 | BN_sub(&d,&d,&b); |
662 | if(!BN_is_zero(&d) || !BN_is_zero(&e)) | |
663 | { | |
cae55bfc | 664 | fprintf(stderr,"Multiplication test failed!\n"); |
62bad771 BL |
665 | return 0; |
666 | } | |
d02b48c6 | 667 | } |
dfeab068 RE |
668 | BN_free(&a); |
669 | BN_free(&b); | |
670 | BN_free(&c); | |
62bad771 BL |
671 | BN_free(&d); |
672 | BN_free(&e); | |
c62b26fd | 673 | BN_CTX_free(ctx); |
d02b48c6 RE |
674 | return(1); |
675 | } | |
676 | ||
6b691a5c | 677 | int test_sqr(BIO *bp, BN_CTX *ctx) |
d02b48c6 | 678 | { |
62bad771 | 679 | BIGNUM a,c,d,e; |
d02b48c6 | 680 | int i; |
d02b48c6 | 681 | |
dfeab068 RE |
682 | BN_init(&a); |
683 | BN_init(&c); | |
62bad771 BL |
684 | BN_init(&d); |
685 | BN_init(&e); | |
d02b48c6 | 686 | |
cae55bfc | 687 | for (i=0; i<num0; i++) |
d02b48c6 | 688 | { |
111482cf | 689 | BN_bntest_rand(&a,40+i*10,0,0); |
dfeab068 | 690 | a.neg=rand_neg(); |
dfeab068 | 691 | BN_sqr(&c,&a,ctx); |
d02b48c6 RE |
692 | if (bp != NULL) |
693 | { | |
694 | if (!results) | |
695 | { | |
dfeab068 | 696 | BN_print(bp,&a); |
d02b48c6 | 697 | BIO_puts(bp," * "); |
dfeab068 | 698 | BN_print(bp,&a); |
d02b48c6 RE |
699 | BIO_puts(bp," - "); |
700 | } | |
dfeab068 | 701 | BN_print(bp,&c); |
d02b48c6 RE |
702 | BIO_puts(bp,"\n"); |
703 | } | |
62bad771 BL |
704 | BN_div(&d,&e,&c,&a,ctx); |
705 | BN_sub(&d,&d,&a); | |
706 | if(!BN_is_zero(&d) || !BN_is_zero(&e)) | |
707 | { | |
cae55bfc | 708 | fprintf(stderr,"Square test failed!\n"); |
62bad771 BL |
709 | return 0; |
710 | } | |
d02b48c6 | 711 | } |
dfeab068 RE |
712 | BN_free(&a); |
713 | BN_free(&c); | |
62bad771 BL |
714 | BN_free(&d); |
715 | BN_free(&e); | |
d02b48c6 RE |
716 | return(1); |
717 | } | |
718 | ||
6b691a5c | 719 | int test_mont(BIO *bp, BN_CTX *ctx) |
d02b48c6 | 720 | { |
62bad771 | 721 | BIGNUM a,b,c,d,A,B; |
dfeab068 | 722 | BIGNUM n; |
d02b48c6 | 723 | int i; |
d02b48c6 RE |
724 | BN_MONT_CTX *mont; |
725 | ||
dfeab068 RE |
726 | BN_init(&a); |
727 | BN_init(&b); | |
728 | BN_init(&c); | |
62bad771 | 729 | BN_init(&d); |
dfeab068 RE |
730 | BN_init(&A); |
731 | BN_init(&B); | |
732 | BN_init(&n); | |
d02b48c6 RE |
733 | |
734 | mont=BN_MONT_CTX_new(); | |
b4e88ccb NL |
735 | if (mont == NULL) |
736 | return 0; | |
d02b48c6 | 737 | |
111482cf UM |
738 | BN_bntest_rand(&a,100,0,0); /**/ |
739 | BN_bntest_rand(&b,100,0,0); /**/ | |
cae55bfc | 740 | for (i=0; i<num2; i++) |
d02b48c6 | 741 | { |
ea96c4bc | 742 | int bits = (200*(i+1))/num2; |
6e0cad8d BM |
743 | |
744 | if (bits == 0) | |
745 | continue; | |
111482cf | 746 | BN_bntest_rand(&n,bits,0,1); |
dfeab068 | 747 | BN_MONT_CTX_set(mont,&n,ctx); |
d02b48c6 | 748 | |
14697d9d BM |
749 | BN_nnmod(&a,&a,&n,ctx); |
750 | BN_nnmod(&b,&b,&n,ctx); | |
751 | ||
dfeab068 RE |
752 | BN_to_montgomery(&A,&a,mont,ctx); |
753 | BN_to_montgomery(&B,&b,mont,ctx); | |
d02b48c6 | 754 | |
dfeab068 RE |
755 | BN_mod_mul_montgomery(&c,&A,&B,mont,ctx);/**/ |
756 | BN_from_montgomery(&A,&c,mont,ctx);/**/ | |
d02b48c6 RE |
757 | if (bp != NULL) |
758 | { | |
759 | if (!results) | |
760 | { | |
761 | #ifdef undef | |
762 | fprintf(stderr,"%d * %d %% %d\n", | |
dfeab068 RE |
763 | BN_num_bits(&a), |
764 | BN_num_bits(&b), | |
d02b48c6 RE |
765 | BN_num_bits(mont->N)); |
766 | #endif | |
dfeab068 | 767 | BN_print(bp,&a); |
d02b48c6 | 768 | BIO_puts(bp," * "); |
dfeab068 | 769 | BN_print(bp,&b); |
d02b48c6 | 770 | BIO_puts(bp," % "); |
dfeab068 | 771 | BN_print(bp,&(mont->N)); |
d02b48c6 RE |
772 | BIO_puts(bp," - "); |
773 | } | |
dfeab068 | 774 | BN_print(bp,&A); |
d02b48c6 RE |
775 | BIO_puts(bp,"\n"); |
776 | } | |
62bad771 BL |
777 | BN_mod_mul(&d,&a,&b,&n,ctx); |
778 | BN_sub(&d,&d,&A); | |
779 | if(!BN_is_zero(&d)) | |
780 | { | |
cae55bfc | 781 | fprintf(stderr,"Montgomery multiplication test failed!\n"); |
62bad771 BL |
782 | return 0; |
783 | } | |
d02b48c6 RE |
784 | } |
785 | BN_MONT_CTX_free(mont); | |
dfeab068 RE |
786 | BN_free(&a); |
787 | BN_free(&b); | |
788 | BN_free(&c); | |
62bad771 BL |
789 | BN_free(&d); |
790 | BN_free(&A); | |
791 | BN_free(&B); | |
792 | BN_free(&n); | |
d02b48c6 RE |
793 | return(1); |
794 | } | |
795 | ||
6b691a5c | 796 | int test_mod(BIO *bp, BN_CTX *ctx) |
d02b48c6 | 797 | { |
62bad771 | 798 | BIGNUM *a,*b,*c,*d,*e; |
d02b48c6 | 799 | int i; |
d02b48c6 RE |
800 | |
801 | a=BN_new(); | |
802 | b=BN_new(); | |
803 | c=BN_new(); | |
62bad771 BL |
804 | d=BN_new(); |
805 | e=BN_new(); | |
d02b48c6 | 806 | |
111482cf | 807 | BN_bntest_rand(a,1024,0,0); /**/ |
cae55bfc | 808 | for (i=0; i<num0; i++) |
d02b48c6 | 809 | { |
111482cf | 810 | BN_bntest_rand(b,450+i*10,0,0); /**/ |
d02b48c6 RE |
811 | a->neg=rand_neg(); |
812 | b->neg=rand_neg(); | |
d02b48c6 RE |
813 | BN_mod(c,a,b,ctx);/**/ |
814 | if (bp != NULL) | |
815 | { | |
816 | if (!results) | |
817 | { | |
818 | BN_print(bp,a); | |
819 | BIO_puts(bp," % "); | |
820 | BN_print(bp,b); | |
821 | BIO_puts(bp," - "); | |
822 | } | |
823 | BN_print(bp,c); | |
824 | BIO_puts(bp,"\n"); | |
825 | } | |
62bad771 BL |
826 | BN_div(d,e,a,b,ctx); |
827 | BN_sub(e,e,c); | |
828 | if(!BN_is_zero(e)) | |
829 | { | |
cae55bfc | 830 | fprintf(stderr,"Modulo test failed!\n"); |
62bad771 BL |
831 | return 0; |
832 | } | |
d02b48c6 RE |
833 | } |
834 | BN_free(a); | |
835 | BN_free(b); | |
836 | BN_free(c); | |
62bad771 BL |
837 | BN_free(d); |
838 | BN_free(e); | |
d02b48c6 RE |
839 | return(1); |
840 | } | |
841 | ||
6b691a5c | 842 | int test_mod_mul(BIO *bp, BN_CTX *ctx) |
d02b48c6 RE |
843 | { |
844 | BIGNUM *a,*b,*c,*d,*e; | |
aecb0b01 | 845 | int i,j; |
d02b48c6 RE |
846 | |
847 | a=BN_new(); | |
848 | b=BN_new(); | |
849 | c=BN_new(); | |
850 | d=BN_new(); | |
851 | e=BN_new(); | |
852 | ||
aecb0b01 | 853 | for (j=0; j<3; j++) { |
111482cf | 854 | BN_bntest_rand(c,1024,0,0); /**/ |
cae55bfc | 855 | for (i=0; i<num0; i++) |
d02b48c6 | 856 | { |
111482cf UM |
857 | BN_bntest_rand(a,475+i*10,0,0); /**/ |
858 | BN_bntest_rand(b,425+i*11,0,0); /**/ | |
d02b48c6 RE |
859 | a->neg=rand_neg(); |
860 | b->neg=rand_neg(); | |
d02b48c6 RE |
861 | if (!BN_mod_mul(e,a,b,c,ctx)) |
862 | { | |
863 | unsigned long l; | |
864 | ||
865 | while ((l=ERR_get_error())) | |
866 | fprintf(stderr,"ERROR:%s\n", | |
867 | ERR_error_string(l,NULL)); | |
55f78baf | 868 | EXIT(1); |
d02b48c6 RE |
869 | } |
870 | if (bp != NULL) | |
871 | { | |
872 | if (!results) | |
873 | { | |
874 | BN_print(bp,a); | |
875 | BIO_puts(bp," * "); | |
876 | BN_print(bp,b); | |
877 | BIO_puts(bp," % "); | |
878 | BN_print(bp,c); | |
5acaa495 BM |
879 | if ((a->neg ^ b->neg) && !BN_is_zero(e)) |
880 | { | |
881 | /* If (a*b) % c is negative, c must be added | |
882 | * in order to obtain the normalized remainder | |
883 | * (new with OpenSSL 0.9.7, previous versions of | |
884 | * BN_mod_mul could generate negative results) | |
885 | */ | |
886 | BIO_puts(bp," + "); | |
887 | BN_print(bp,c); | |
888 | } | |
d02b48c6 RE |
889 | BIO_puts(bp," - "); |
890 | } | |
891 | BN_print(bp,e); | |
892 | BIO_puts(bp,"\n"); | |
893 | } | |
62bad771 BL |
894 | BN_mul(d,a,b,ctx); |
895 | BN_sub(d,d,e); | |
896 | BN_div(a,b,d,c,ctx); | |
897 | if(!BN_is_zero(b)) | |
898 | { | |
cae55bfc | 899 | fprintf(stderr,"Modulo multiply test failed!\n"); |
020fc820 | 900 | ERR_print_errors_fp(stderr); |
62bad771 BL |
901 | return 0; |
902 | } | |
d02b48c6 | 903 | } |
aecb0b01 | 904 | } |
d02b48c6 RE |
905 | BN_free(a); |
906 | BN_free(b); | |
907 | BN_free(c); | |
908 | BN_free(d); | |
909 | BN_free(e); | |
910 | return(1); | |
911 | } | |
912 | ||
6b691a5c | 913 | int test_mod_exp(BIO *bp, BN_CTX *ctx) |
d02b48c6 RE |
914 | { |
915 | BIGNUM *a,*b,*c,*d,*e; | |
916 | int i; | |
917 | ||
918 | a=BN_new(); | |
919 | b=BN_new(); | |
920 | c=BN_new(); | |
921 | d=BN_new(); | |
922 | e=BN_new(); | |
923 | ||
111482cf | 924 | BN_bntest_rand(c,30,0,1); /* must be odd for montgomery */ |
cae55bfc | 925 | for (i=0; i<num2; i++) |
d02b48c6 | 926 | { |
111482cf UM |
927 | BN_bntest_rand(a,20+i*5,0,0); /**/ |
928 | BN_bntest_rand(b,2+i,0,0); /**/ | |
d02b48c6 RE |
929 | |
930 | if (!BN_mod_exp(d,a,b,c,ctx)) | |
931 | return(00); | |
932 | ||
933 | if (bp != NULL) | |
934 | { | |
935 | if (!results) | |
936 | { | |
937 | BN_print(bp,a); | |
938 | BIO_puts(bp," ^ "); | |
939 | BN_print(bp,b); | |
940 | BIO_puts(bp," % "); | |
941 | BN_print(bp,c); | |
942 | BIO_puts(bp," - "); | |
943 | } | |
944 | BN_print(bp,d); | |
945 | BIO_puts(bp,"\n"); | |
946 | } | |
62bad771 BL |
947 | BN_exp(e,a,b,ctx); |
948 | BN_sub(e,e,d); | |
949 | BN_div(a,b,e,c,ctx); | |
950 | if(!BN_is_zero(b)) | |
951 | { | |
cae55bfc | 952 | fprintf(stderr,"Modulo exponentiation test failed!\n"); |
62bad771 BL |
953 | return 0; |
954 | } | |
d02b48c6 RE |
955 | } |
956 | BN_free(a); | |
957 | BN_free(b); | |
958 | BN_free(c); | |
959 | BN_free(d); | |
960 | BN_free(e); | |
961 | return(1); | |
962 | } | |
963 | ||
46a64376 BM |
964 | int test_mod_exp_mont_consttime(BIO *bp, BN_CTX *ctx) |
965 | { | |
966 | BIGNUM *a,*b,*c,*d,*e; | |
967 | int i; | |
968 | ||
969 | a=BN_new(); | |
970 | b=BN_new(); | |
971 | c=BN_new(); | |
972 | d=BN_new(); | |
973 | e=BN_new(); | |
974 | ||
975 | BN_bntest_rand(c,30,0,1); /* must be odd for montgomery */ | |
976 | for (i=0; i<num2; i++) | |
977 | { | |
978 | BN_bntest_rand(a,20+i*5,0,0); /**/ | |
979 | BN_bntest_rand(b,2+i,0,0); /**/ | |
980 | ||
981 | if (!BN_mod_exp_mont_consttime(d,a,b,c,ctx,NULL)) | |
982 | return(00); | |
983 | ||
984 | if (bp != NULL) | |
985 | { | |
986 | if (!results) | |
987 | { | |
988 | BN_print(bp,a); | |
989 | BIO_puts(bp," ^ "); | |
990 | BN_print(bp,b); | |
991 | BIO_puts(bp," % "); | |
992 | BN_print(bp,c); | |
993 | BIO_puts(bp," - "); | |
994 | } | |
995 | BN_print(bp,d); | |
996 | BIO_puts(bp,"\n"); | |
997 | } | |
998 | BN_exp(e,a,b,ctx); | |
999 | BN_sub(e,e,d); | |
1000 | BN_div(a,b,e,c,ctx); | |
1001 | if(!BN_is_zero(b)) | |
1002 | { | |
1003 | fprintf(stderr,"Modulo exponentiation test failed!\n"); | |
1004 | return 0; | |
1005 | } | |
1006 | } | |
1007 | BN_free(a); | |
1008 | BN_free(b); | |
1009 | BN_free(c); | |
1010 | BN_free(d); | |
1011 | BN_free(e); | |
1012 | return(1); | |
1013 | } | |
1014 | ||
6b691a5c | 1015 | int test_exp(BIO *bp, BN_CTX *ctx) |
a0a54079 | 1016 | { |
62bad771 | 1017 | BIGNUM *a,*b,*d,*e,*one; |
a0a54079 MC |
1018 | int i; |
1019 | ||
1020 | a=BN_new(); | |
1021 | b=BN_new(); | |
1022 | d=BN_new(); | |
1023 | e=BN_new(); | |
62bad771 BL |
1024 | one=BN_new(); |
1025 | BN_one(one); | |
a0a54079 | 1026 | |
cae55bfc | 1027 | for (i=0; i<num2; i++) |
a0a54079 | 1028 | { |
111482cf UM |
1029 | BN_bntest_rand(a,20+i*5,0,0); /**/ |
1030 | BN_bntest_rand(b,2+i,0,0); /**/ | |
a0a54079 MC |
1031 | |
1032 | if (!BN_exp(d,a,b,ctx)) | |
1033 | return(00); | |
1034 | ||
1035 | if (bp != NULL) | |
1036 | { | |
1037 | if (!results) | |
1038 | { | |
1039 | BN_print(bp,a); | |
1040 | BIO_puts(bp," ^ "); | |
1041 | BN_print(bp,b); | |
1042 | BIO_puts(bp," - "); | |
1043 | } | |
1044 | BN_print(bp,d); | |
1045 | BIO_puts(bp,"\n"); | |
1046 | } | |
62bad771 BL |
1047 | BN_one(e); |
1048 | for( ; !BN_is_zero(b) ; BN_sub(b,b,one)) | |
1049 | BN_mul(e,e,a,ctx); | |
1050 | BN_sub(e,e,d); | |
1051 | if(!BN_is_zero(e)) | |
1052 | { | |
cae55bfc | 1053 | fprintf(stderr,"Exponentiation test failed!\n"); |
62bad771 BL |
1054 | return 0; |
1055 | } | |
a0a54079 MC |
1056 | } |
1057 | BN_free(a); | |
1058 | BN_free(b); | |
1059 | BN_free(d); | |
1060 | BN_free(e); | |
62bad771 | 1061 | BN_free(one); |
a0a54079 MC |
1062 | return(1); |
1063 | } | |
1064 | ||
1dc920c8 BM |
1065 | int test_gf2m_add(BIO *bp) |
1066 | { | |
1067 | BIGNUM a,b,c; | |
1068 | int i, ret = 0; | |
1069 | ||
1070 | BN_init(&a); | |
1071 | BN_init(&b); | |
1072 | BN_init(&c); | |
1073 | ||
1074 | for (i=0; i<num0; i++) | |
1075 | { | |
1076 | BN_rand(&a,512,0,0); | |
1077 | BN_copy(&b, BN_value_one()); | |
1078 | a.neg=rand_neg(); | |
1079 | b.neg=rand_neg(); | |
1080 | BN_GF2m_add(&c,&a,&b); | |
1081 | #if 0 /* make test uses ouput in bc but bc can't handle GF(2^m) arithmetic */ | |
1082 | if (bp != NULL) | |
1083 | { | |
1084 | if (!results) | |
1085 | { | |
1086 | BN_print(bp,&a); | |
1087 | BIO_puts(bp," ^ "); | |
1088 | BN_print(bp,&b); | |
1089 | BIO_puts(bp," = "); | |
1090 | } | |
1091 | BN_print(bp,&c); | |
1092 | BIO_puts(bp,"\n"); | |
1093 | } | |
1094 | #endif | |
1095 | /* Test that two added values have the correct parity. */ | |
1096 | if((BN_is_odd(&a) && BN_is_odd(&c)) || (!BN_is_odd(&a) && !BN_is_odd(&c))) | |
1097 | { | |
1098 | fprintf(stderr,"GF(2^m) addition test (a) failed!\n"); | |
1099 | goto err; | |
1100 | } | |
1101 | BN_GF2m_add(&c,&c,&c); | |
1102 | /* Test that c + c = 0. */ | |
1103 | if(!BN_is_zero(&c)) | |
1104 | { | |
1105 | fprintf(stderr,"GF(2^m) addition test (b) failed!\n"); | |
1106 | goto err; | |
1107 | } | |
1108 | } | |
1109 | ret = 1; | |
1110 | err: | |
1111 | BN_free(&a); | |
1112 | BN_free(&b); | |
1113 | BN_free(&c); | |
1114 | return ret; | |
1115 | } | |
1116 | ||
1117 | int test_gf2m_mod(BIO *bp) | |
1118 | { | |
1119 | BIGNUM *a,*b[2],*c,*d,*e; | |
1120 | int i, j, ret = 0; | |
c4e7870a BM |
1121 | int p0[] = {163,7,6,3,0,-1}; |
1122 | int p1[] = {193,15,0,-1}; | |
1dc920c8 BM |
1123 | |
1124 | a=BN_new(); | |
1125 | b[0]=BN_new(); | |
1126 | b[1]=BN_new(); | |
1127 | c=BN_new(); | |
1128 | d=BN_new(); | |
1129 | e=BN_new(); | |
1130 | ||
1131 | BN_GF2m_arr2poly(p0, b[0]); | |
1132 | BN_GF2m_arr2poly(p1, b[1]); | |
1133 | ||
1134 | for (i=0; i<num0; i++) | |
1135 | { | |
1136 | BN_bntest_rand(a, 1024, 0, 0); | |
1137 | for (j=0; j < 2; j++) | |
1138 | { | |
1139 | BN_GF2m_mod(c, a, b[j]); | |
1140 | #if 0 /* make test uses ouput in bc but bc can't handle GF(2^m) arithmetic */ | |
1141 | if (bp != NULL) | |
1142 | { | |
1143 | if (!results) | |
1144 | { | |
1145 | BN_print(bp,a); | |
1146 | BIO_puts(bp," % "); | |
1147 | BN_print(bp,b[j]); | |
1148 | BIO_puts(bp," - "); | |
1149 | BN_print(bp,c); | |
1150 | BIO_puts(bp,"\n"); | |
1151 | } | |
1152 | } | |
1153 | #endif | |
1154 | BN_GF2m_add(d, a, c); | |
1155 | BN_GF2m_mod(e, d, b[j]); | |
1156 | /* Test that a + (a mod p) mod p == 0. */ | |
1157 | if(!BN_is_zero(e)) | |
1158 | { | |
1159 | fprintf(stderr,"GF(2^m) modulo test failed!\n"); | |
1160 | goto err; | |
1161 | } | |
1162 | } | |
1163 | } | |
1164 | ret = 1; | |
1165 | err: | |
1166 | BN_free(a); | |
1167 | BN_free(b[0]); | |
1168 | BN_free(b[1]); | |
1169 | BN_free(c); | |
1170 | BN_free(d); | |
1171 | BN_free(e); | |
1172 | return ret; | |
1173 | } | |
1174 | ||
1175 | int test_gf2m_mod_mul(BIO *bp,BN_CTX *ctx) | |
1176 | { | |
1177 | BIGNUM *a,*b[2],*c,*d,*e,*f,*g,*h; | |
1178 | int i, j, ret = 0; | |
c4e7870a BM |
1179 | int p0[] = {163,7,6,3,0,-1}; |
1180 | int p1[] = {193,15,0,-1}; | |
1dc920c8 BM |
1181 | |
1182 | a=BN_new(); | |
1183 | b[0]=BN_new(); | |
1184 | b[1]=BN_new(); | |
1185 | c=BN_new(); | |
1186 | d=BN_new(); | |
1187 | e=BN_new(); | |
1188 | f=BN_new(); | |
1189 | g=BN_new(); | |
1190 | h=BN_new(); | |
1191 | ||
1192 | BN_GF2m_arr2poly(p0, b[0]); | |
1193 | BN_GF2m_arr2poly(p1, b[1]); | |
1194 | ||
1195 | for (i=0; i<num0; i++) | |
1196 | { | |
1197 | BN_bntest_rand(a, 1024, 0, 0); | |
1198 | BN_bntest_rand(c, 1024, 0, 0); | |
1199 | BN_bntest_rand(d, 1024, 0, 0); | |
1200 | for (j=0; j < 2; j++) | |
1201 | { | |
1202 | BN_GF2m_mod_mul(e, a, c, b[j], ctx); | |
1203 | #if 0 /* make test uses ouput in bc but bc can't handle GF(2^m) arithmetic */ | |
1204 | if (bp != NULL) | |
1205 | { | |
1206 | if (!results) | |
1207 | { | |
1208 | BN_print(bp,a); | |
1209 | BIO_puts(bp," * "); | |
1210 | BN_print(bp,c); | |
1211 | BIO_puts(bp," % "); | |
1212 | BN_print(bp,b[j]); | |
1213 | BIO_puts(bp," - "); | |
1214 | BN_print(bp,e); | |
1215 | BIO_puts(bp,"\n"); | |
1216 | } | |
1217 | } | |
1218 | #endif | |
1219 | BN_GF2m_add(f, a, d); | |
1220 | BN_GF2m_mod_mul(g, f, c, b[j], ctx); | |
1221 | BN_GF2m_mod_mul(h, d, c, b[j], ctx); | |
1222 | BN_GF2m_add(f, e, g); | |
1223 | BN_GF2m_add(f, f, h); | |
1224 | /* Test that (a+d)*c = a*c + d*c. */ | |
1225 | if(!BN_is_zero(f)) | |
1226 | { | |
1227 | fprintf(stderr,"GF(2^m) modular multiplication test failed!\n"); | |
1228 | goto err; | |
1229 | } | |
1230 | } | |
1231 | } | |
1232 | ret = 1; | |
1233 | err: | |
1234 | BN_free(a); | |
1235 | BN_free(b[0]); | |
1236 | BN_free(b[1]); | |
1237 | BN_free(c); | |
1238 | BN_free(d); | |
1239 | BN_free(e); | |
1240 | BN_free(f); | |
1241 | BN_free(g); | |
1242 | BN_free(h); | |
1243 | return ret; | |
1244 | } | |
1245 | ||
1246 | int test_gf2m_mod_sqr(BIO *bp,BN_CTX *ctx) | |
1247 | { | |
1248 | BIGNUM *a,*b[2],*c,*d; | |
1249 | int i, j, ret = 0; | |
c4e7870a BM |
1250 | int p0[] = {163,7,6,3,0,-1}; |
1251 | int p1[] = {193,15,0,-1}; | |
1dc920c8 BM |
1252 | |
1253 | a=BN_new(); | |
1254 | b[0]=BN_new(); | |
1255 | b[1]=BN_new(); | |
1256 | c=BN_new(); | |
1257 | d=BN_new(); | |
1258 | ||
1259 | BN_GF2m_arr2poly(p0, b[0]); | |
1260 | BN_GF2m_arr2poly(p1, b[1]); | |
1261 | ||
1262 | for (i=0; i<num0; i++) | |
1263 | { | |
1264 | BN_bntest_rand(a, 1024, 0, 0); | |
1265 | for (j=0; j < 2; j++) | |
1266 | { | |
1267 | BN_GF2m_mod_sqr(c, a, b[j], ctx); | |
1268 | BN_copy(d, a); | |
1269 | BN_GF2m_mod_mul(d, a, d, b[j], ctx); | |
1270 | #if 0 /* make test uses ouput in bc but bc can't handle GF(2^m) arithmetic */ | |
1271 | if (bp != NULL) | |
1272 | { | |
1273 | if (!results) | |
1274 | { | |
1275 | BN_print(bp,a); | |
1276 | BIO_puts(bp," ^ 2 % "); | |
1277 | BN_print(bp,b[j]); | |
1278 | BIO_puts(bp, " = "); | |
1279 | BN_print(bp,c); | |
1280 | BIO_puts(bp,"; a * a = "); | |
1281 | BN_print(bp,d); | |
1282 | BIO_puts(bp,"\n"); | |
1283 | } | |
1284 | } | |
1285 | #endif | |
1286 | BN_GF2m_add(d, c, d); | |
1287 | /* Test that a*a = a^2. */ | |
1288 | if(!BN_is_zero(d)) | |
1289 | { | |
1290 | fprintf(stderr,"GF(2^m) modular squaring test failed!\n"); | |
1291 | goto err; | |
1292 | } | |
1293 | } | |
1294 | } | |
1295 | ret = 1; | |
1296 | err: | |
1297 | BN_free(a); | |
1298 | BN_free(b[0]); | |
1299 | BN_free(b[1]); | |
1300 | BN_free(c); | |
1301 | BN_free(d); | |
1302 | return ret; | |
1303 | } | |
1304 | ||
1305 | int test_gf2m_mod_inv(BIO *bp,BN_CTX *ctx) | |
1306 | { | |
1307 | BIGNUM *a,*b[2],*c,*d; | |
1308 | int i, j, ret = 0; | |
c4e7870a BM |
1309 | int p0[] = {163,7,6,3,0,-1}; |
1310 | int p1[] = {193,15,0,-1}; | |
1dc920c8 BM |
1311 | |
1312 | a=BN_new(); | |
1313 | b[0]=BN_new(); | |
1314 | b[1]=BN_new(); | |
1315 | c=BN_new(); | |
1316 | d=BN_new(); | |
1317 | ||
1318 | BN_GF2m_arr2poly(p0, b[0]); | |
1319 | BN_GF2m_arr2poly(p1, b[1]); | |
1320 | ||
1321 | for (i=0; i<num0; i++) | |
1322 | { | |
1323 | BN_bntest_rand(a, 512, 0, 0); | |
1324 | for (j=0; j < 2; j++) | |
1325 | { | |
1326 | BN_GF2m_mod_inv(c, a, b[j], ctx); | |
1327 | BN_GF2m_mod_mul(d, a, c, b[j], ctx); | |
1328 | #if 0 /* make test uses ouput in bc but bc can't handle GF(2^m) arithmetic */ | |
1329 | if (bp != NULL) | |
1330 | { | |
1331 | if (!results) | |
1332 | { | |
1333 | BN_print(bp,a); | |
1334 | BIO_puts(bp, " * "); | |
1335 | BN_print(bp,c); | |
1336 | BIO_puts(bp," - 1 % "); | |
1337 | BN_print(bp,b[j]); | |
1338 | BIO_puts(bp,"\n"); | |
1339 | } | |
1340 | } | |
1341 | #endif | |
1342 | /* Test that ((1/a)*a) = 1. */ | |
1343 | if(!BN_is_one(d)) | |
1344 | { | |
1345 | fprintf(stderr,"GF(2^m) modular inversion test failed!\n"); | |
1346 | goto err; | |
1347 | } | |
1348 | } | |
1349 | } | |
1350 | ret = 1; | |
1351 | err: | |
1352 | BN_free(a); | |
1353 | BN_free(b[0]); | |
1354 | BN_free(b[1]); | |
1355 | BN_free(c); | |
1356 | BN_free(d); | |
1357 | return ret; | |
1358 | } | |
1359 | ||
1360 | int test_gf2m_mod_div(BIO *bp,BN_CTX *ctx) | |
1361 | { | |
1362 | BIGNUM *a,*b[2],*c,*d,*e,*f; | |
1363 | int i, j, ret = 0; | |
c4e7870a BM |
1364 | int p0[] = {163,7,6,3,0,-1}; |
1365 | int p1[] = {193,15,0,-1}; | |
1dc920c8 BM |
1366 | |
1367 | a=BN_new(); | |
1368 | b[0]=BN_new(); | |
1369 | b[1]=BN_new(); | |
1370 | c=BN_new(); | |
1371 | d=BN_new(); | |
1372 | e=BN_new(); | |
1373 | f=BN_new(); | |
1374 | ||
1375 | BN_GF2m_arr2poly(p0, b[0]); | |
1376 | BN_GF2m_arr2poly(p1, b[1]); | |
1377 | ||
1378 | for (i=0; i<num0; i++) | |
1379 | { | |
1380 | BN_bntest_rand(a, 512, 0, 0); | |
1381 | BN_bntest_rand(c, 512, 0, 0); | |
1382 | for (j=0; j < 2; j++) | |
1383 | { | |
1384 | BN_GF2m_mod_div(d, a, c, b[j], ctx); | |
1385 | BN_GF2m_mod_mul(e, d, c, b[j], ctx); | |
1386 | BN_GF2m_mod_div(f, a, e, b[j], ctx); | |
1387 | #if 0 /* make test uses ouput in bc but bc can't handle GF(2^m) arithmetic */ | |
1388 | if (bp != NULL) | |
1389 | { | |
1390 | if (!results) | |
1391 | { | |
1392 | BN_print(bp,a); | |
1393 | BIO_puts(bp, " = "); | |
1394 | BN_print(bp,c); | |
1395 | BIO_puts(bp," * "); | |
1396 | BN_print(bp,d); | |
1397 | BIO_puts(bp, " % "); | |
1398 | BN_print(bp,b[j]); | |
1399 | BIO_puts(bp,"\n"); | |
1400 | } | |
1401 | } | |
1402 | #endif | |
1403 | /* Test that ((a/c)*c)/a = 1. */ | |
1404 | if(!BN_is_one(f)) | |
1405 | { | |
1406 | fprintf(stderr,"GF(2^m) modular division test failed!\n"); | |
1407 | goto err; | |
1408 | } | |
1409 | } | |
1410 | } | |
1411 | ret = 1; | |
1412 | err: | |
1413 | BN_free(a); | |
1414 | BN_free(b[0]); | |
1415 | BN_free(b[1]); | |
1416 | BN_free(c); | |
1417 | BN_free(d); | |
1418 | BN_free(e); | |
1419 | BN_free(f); | |
1420 | return ret; | |
1421 | } | |
1422 | ||
1423 | int test_gf2m_mod_exp(BIO *bp,BN_CTX *ctx) | |
1424 | { | |
1425 | BIGNUM *a,*b[2],*c,*d,*e,*f; | |
1426 | int i, j, ret = 0; | |
c4e7870a BM |
1427 | int p0[] = {163,7,6,3,0,-1}; |
1428 | int p1[] = {193,15,0,-1}; | |
1dc920c8 BM |
1429 | |
1430 | a=BN_new(); | |
1431 | b[0]=BN_new(); | |
1432 | b[1]=BN_new(); | |
1433 | c=BN_new(); | |
1434 | d=BN_new(); | |
1435 | e=BN_new(); | |
1436 | f=BN_new(); | |
1437 | ||
1438 | BN_GF2m_arr2poly(p0, b[0]); | |
1439 | BN_GF2m_arr2poly(p1, b[1]); | |
1440 | ||
1441 | for (i=0; i<num0; i++) | |
1442 | { | |
1443 | BN_bntest_rand(a, 512, 0, 0); | |
1444 | BN_bntest_rand(c, 512, 0, 0); | |
1445 | BN_bntest_rand(d, 512, 0, 0); | |
1446 | for (j=0; j < 2; j++) | |
1447 | { | |
1448 | BN_GF2m_mod_exp(e, a, c, b[j], ctx); | |
1449 | BN_GF2m_mod_exp(f, a, d, b[j], ctx); | |
1450 | BN_GF2m_mod_mul(e, e, f, b[j], ctx); | |
1451 | BN_add(f, c, d); | |
1452 | BN_GF2m_mod_exp(f, a, f, b[j], ctx); | |
1453 | #if 0 /* make test uses ouput in bc but bc can't handle GF(2^m) arithmetic */ | |
1454 | if (bp != NULL) | |
1455 | { | |
1456 | if (!results) | |
1457 | { | |
1458 | BN_print(bp,a); | |
1459 | BIO_puts(bp, " ^ ("); | |
1460 | BN_print(bp,c); | |
1461 | BIO_puts(bp," + "); | |
1462 | BN_print(bp,d); | |
1463 | BIO_puts(bp, ") = "); | |
1464 | BN_print(bp,e); | |
1465 | BIO_puts(bp, "; - "); | |
1466 | BN_print(bp,f); | |
1467 | BIO_puts(bp, " % "); | |
1468 | BN_print(bp,b[j]); | |
1469 | BIO_puts(bp,"\n"); | |
1470 | } | |
1471 | } | |
1472 | #endif | |
1473 | BN_GF2m_add(f, e, f); | |
1474 | /* Test that a^(c+d)=a^c*a^d. */ | |
1475 | if(!BN_is_zero(f)) | |
1476 | { | |
1477 | fprintf(stderr,"GF(2^m) modular exponentiation test failed!\n"); | |
1478 | goto err; | |
1479 | } | |
1480 | } | |
1481 | } | |
1482 | ret = 1; | |
1483 | err: | |
1484 | BN_free(a); | |
1485 | BN_free(b[0]); | |
1486 | BN_free(b[1]); | |
1487 | BN_free(c); | |
1488 | BN_free(d); | |
1489 | BN_free(e); | |
1490 | BN_free(f); | |
1491 | return ret; | |
1492 | } | |
1493 | ||
1494 | int test_gf2m_mod_sqrt(BIO *bp,BN_CTX *ctx) | |
1495 | { | |
1496 | BIGNUM *a,*b[2],*c,*d,*e,*f; | |
1497 | int i, j, ret = 0; | |
c4e7870a BM |
1498 | int p0[] = {163,7,6,3,0,-1}; |
1499 | int p1[] = {193,15,0,-1}; | |
1dc920c8 BM |
1500 | |
1501 | a=BN_new(); | |
1502 | b[0]=BN_new(); | |
1503 | b[1]=BN_new(); | |
1504 | c=BN_new(); | |
1505 | d=BN_new(); | |
1506 | e=BN_new(); | |
1507 | f=BN_new(); | |
1508 | ||
1509 | BN_GF2m_arr2poly(p0, b[0]); | |
1510 | BN_GF2m_arr2poly(p1, b[1]); | |
1511 | ||
1512 | for (i=0; i<num0; i++) | |
1513 | { | |
1514 | BN_bntest_rand(a, 512, 0, 0); | |
1515 | for (j=0; j < 2; j++) | |
1516 | { | |
1517 | BN_GF2m_mod(c, a, b[j]); | |
1518 | BN_GF2m_mod_sqrt(d, a, b[j], ctx); | |
1519 | BN_GF2m_mod_sqr(e, d, b[j], ctx); | |
1520 | #if 0 /* make test uses ouput in bc but bc can't handle GF(2^m) arithmetic */ | |
1521 | if (bp != NULL) | |
1522 | { | |
1523 | if (!results) | |
1524 | { | |
1525 | BN_print(bp,d); | |
1526 | BIO_puts(bp, " ^ 2 - "); | |
1527 | BN_print(bp,a); | |
1528 | BIO_puts(bp,"\n"); | |
1529 | } | |
1530 | } | |
1531 | #endif | |
1532 | BN_GF2m_add(f, c, e); | |
1533 | /* Test that d^2 = a, where d = sqrt(a). */ | |
1534 | if(!BN_is_zero(f)) | |
1535 | { | |
1536 | fprintf(stderr,"GF(2^m) modular square root test failed!\n"); | |
1537 | goto err; | |
1538 | } | |
1539 | } | |
1540 | } | |
1541 | ret = 1; | |
1542 | err: | |
1543 | BN_free(a); | |
1544 | BN_free(b[0]); | |
1545 | BN_free(b[1]); | |
1546 | BN_free(c); | |
1547 | BN_free(d); | |
1548 | BN_free(e); | |
1549 | BN_free(f); | |
1550 | return ret; | |
1551 | } | |
1552 | ||
1553 | int test_gf2m_mod_solve_quad(BIO *bp,BN_CTX *ctx) | |
1554 | { | |
1555 | BIGNUM *a,*b[2],*c,*d,*e; | |
1556 | int i, j, s = 0, t, ret = 0; | |
c4e7870a BM |
1557 | int p0[] = {163,7,6,3,0,-1}; |
1558 | int p1[] = {193,15,0,-1}; | |
1dc920c8 BM |
1559 | |
1560 | a=BN_new(); | |
1561 | b[0]=BN_new(); | |
1562 | b[1]=BN_new(); | |
1563 | c=BN_new(); | |
1564 | d=BN_new(); | |
1565 | e=BN_new(); | |
1566 | ||
1567 | BN_GF2m_arr2poly(p0, b[0]); | |
1568 | BN_GF2m_arr2poly(p1, b[1]); | |
1569 | ||
1570 | for (i=0; i<num0; i++) | |
1571 | { | |
1572 | BN_bntest_rand(a, 512, 0, 0); | |
1573 | for (j=0; j < 2; j++) | |
1574 | { | |
1575 | t = BN_GF2m_mod_solve_quad(c, a, b[j], ctx); | |
1576 | if (t) | |
1577 | { | |
1578 | s++; | |
1579 | BN_GF2m_mod_sqr(d, c, b[j], ctx); | |
1580 | BN_GF2m_add(d, c, d); | |
1581 | BN_GF2m_mod(e, a, b[j]); | |
1582 | #if 0 /* make test uses ouput in bc but bc can't handle GF(2^m) arithmetic */ | |
1583 | if (bp != NULL) | |
1584 | { | |
1585 | if (!results) | |
1586 | { | |
1587 | BN_print(bp,c); | |
1588 | BIO_puts(bp, " is root of z^2 + z = "); | |
1589 | BN_print(bp,a); | |
1590 | BIO_puts(bp, " % "); | |
1591 | BN_print(bp,b[j]); | |
1592 | BIO_puts(bp, "\n"); | |
1593 | } | |
1594 | } | |
1595 | #endif | |
1596 | BN_GF2m_add(e, e, d); | |
1597 | /* Test that solution of quadratic c satisfies c^2 + c = a. */ | |
1598 | if(!BN_is_zero(e)) | |
1599 | { | |
1600 | fprintf(stderr,"GF(2^m) modular solve quadratic test failed!\n"); | |
1601 | goto err; | |
1602 | } | |
1603 | ||
1604 | } | |
1605 | else | |
1606 | { | |
1607 | #if 0 /* make test uses ouput in bc but bc can't handle GF(2^m) arithmetic */ | |
1608 | if (bp != NULL) | |
1609 | { | |
1610 | if (!results) | |
1611 | { | |
1612 | BIO_puts(bp, "There are no roots of z^2 + z = "); | |
1613 | BN_print(bp,a); | |
1614 | BIO_puts(bp, " % "); | |
1615 | BN_print(bp,b[j]); | |
1616 | BIO_puts(bp, "\n"); | |
1617 | } | |
1618 | } | |
1619 | #endif | |
1620 | } | |
1621 | } | |
1622 | } | |
1623 | if (s == 0) | |
1624 | { | |
1625 | fprintf(stderr,"All %i tests of GF(2^m) modular solve quadratic resulted in no roots;\n", num0); | |
1626 | fprintf(stderr,"this is very unlikely and probably indicates an error.\n"); | |
1627 | goto err; | |
1628 | } | |
1629 | ret = 1; | |
1630 | err: | |
1631 | BN_free(a); | |
1632 | BN_free(b[0]); | |
1633 | BN_free(b[1]); | |
1634 | BN_free(c); | |
1635 | BN_free(d); | |
1636 | BN_free(e); | |
1637 | return ret; | |
1638 | } | |
1639 | ||
2aaec9cc | 1640 | static int genprime_cb(int p, int n, BN_GENCB *arg) |
bdec3c53 BM |
1641 | { |
1642 | char c='*'; | |
1643 | ||
1644 | if (p == 0) c='.'; | |
1645 | if (p == 1) c='+'; | |
1646 | if (p == 2) c='*'; | |
1647 | if (p == 3) c='\n'; | |
1648 | putc(c, stderr); | |
1649 | fflush(stderr); | |
2aaec9cc | 1650 | return 1; |
bdec3c53 BM |
1651 | } |
1652 | ||
c7820896 BM |
1653 | int test_kron(BIO *bp, BN_CTX *ctx) |
1654 | { | |
2aaec9cc | 1655 | BN_GENCB cb; |
470fa98f | 1656 | BIGNUM *a,*b,*r,*t; |
bdec3c53 BM |
1657 | int i; |
1658 | int legendre, kronecker; | |
1659 | int ret = 0; | |
1660 | ||
1661 | a = BN_new(); | |
1662 | b = BN_new(); | |
1663 | r = BN_new(); | |
470fa98f BM |
1664 | t = BN_new(); |
1665 | if (a == NULL || b == NULL || r == NULL || t == NULL) goto err; | |
2aaec9cc GT |
1666 | |
1667 | BN_GENCB_set(&cb, genprime_cb, NULL); | |
bdec3c53 | 1668 | |
d79cab27 BM |
1669 | /* We test BN_kronecker(a, b, ctx) just for b odd (Jacobi symbol). |
1670 | * In this case we know that if b is prime, then BN_kronecker(a, b, ctx) | |
1671 | * is congruent to $a^{(b-1)/2}$, modulo $b$ (Legendre symbol). | |
1672 | * So we generate a random prime b and compare these values | |
1673 | * for a number of random a's. (That is, we run the Solovay-Strassen | |
1674 | * primality test to confirm that b is prime, except that we | |
1675 | * don't want to test whether b is prime but whether BN_kronecker | |
1676 | * works.) */ | |
1677 | ||
2aaec9cc | 1678 | if (!BN_generate_prime_ex(b, 512, 0, NULL, NULL, &cb)) goto err; |
80d89e6a | 1679 | b->neg = rand_neg(); |
bdec3c53 | 1680 | putc('\n', stderr); |
d79cab27 | 1681 | |
bdec3c53 BM |
1682 | for (i = 0; i < num0; i++) |
1683 | { | |
111482cf | 1684 | if (!BN_bntest_rand(a, 512, 0, 0)) goto err; |
eb1f1b0a BM |
1685 | a->neg = rand_neg(); |
1686 | ||
80d89e6a | 1687 | /* t := (|b|-1)/2 (note that b is odd) */ |
470fa98f | 1688 | if (!BN_copy(t, b)) goto err; |
80d89e6a | 1689 | t->neg = 0; |
470fa98f BM |
1690 | if (!BN_sub_word(t, 1)) goto err; |
1691 | if (!BN_rshift1(t, t)) goto err; | |
1692 | /* r := a^t mod b */ | |
8dea52fa BM |
1693 | b->neg=0; |
1694 | ||
5c9396e3 | 1695 | if (!BN_mod_exp_recp(r, a, t, b, ctx)) goto err; |
8dea52fa | 1696 | b->neg=1; |
bdec3c53 BM |
1697 | |
1698 | if (BN_is_word(r, 1)) | |
1699 | legendre = 1; | |
b2993bde BM |
1700 | else if (BN_is_zero(r)) |
1701 | legendre = 0; | |
bdec3c53 BM |
1702 | else |
1703 | { | |
1704 | if (!BN_add_word(r, 1)) goto err; | |
8dea52fa | 1705 | if (0 != BN_ucmp(r, b)) |
bdec3c53 BM |
1706 | { |
1707 | fprintf(stderr, "Legendre symbol computation failed\n"); | |
1708 | goto err; | |
1709 | } | |
1710 | legendre = -1; | |
1711 | } | |
fc2e05c2 | 1712 | |
bdec3c53 BM |
1713 | kronecker = BN_kronecker(a, b, ctx); |
1714 | if (kronecker < -1) goto err; | |
80d89e6a BM |
1715 | /* we actually need BN_kronecker(a, |b|) */ |
1716 | if (a->neg && b->neg) | |
1717 | kronecker = -kronecker; | |
bdec3c53 BM |
1718 | |
1719 | if (legendre != kronecker) | |
1720 | { | |
1721 | fprintf(stderr, "legendre != kronecker; a = "); | |
1722 | BN_print_fp(stderr, a); | |
fc2e05c2 | 1723 | fprintf(stderr, ", b = "); |
bdec3c53 BM |
1724 | BN_print_fp(stderr, b); |
1725 | fprintf(stderr, "\n"); | |
1726 | goto err; | |
1727 | } | |
1728 | ||
03a08489 BM |
1729 | putc('.', stderr); |
1730 | fflush(stderr); | |
bdec3c53 BM |
1731 | } |
1732 | ||
03a08489 BM |
1733 | putc('\n', stderr); |
1734 | fflush(stderr); | |
bdec3c53 BM |
1735 | ret = 1; |
1736 | err: | |
1737 | if (a != NULL) BN_free(a); | |
1738 | if (b != NULL) BN_free(b); | |
1739 | if (r != NULL) BN_free(r); | |
470fa98f | 1740 | if (t != NULL) BN_free(t); |
bdec3c53 | 1741 | return ret; |
c7820896 BM |
1742 | } |
1743 | ||
cd2eebfd BM |
1744 | int test_sqrt(BIO *bp, BN_CTX *ctx) |
1745 | { | |
2aaec9cc | 1746 | BN_GENCB cb; |
cd2eebfd BM |
1747 | BIGNUM *a,*p,*r; |
1748 | int i, j; | |
1749 | int ret = 0; | |
1750 | ||
1751 | a = BN_new(); | |
1752 | p = BN_new(); | |
1753 | r = BN_new(); | |
1754 | if (a == NULL || p == NULL || r == NULL) goto err; | |
2aaec9cc GT |
1755 | |
1756 | BN_GENCB_set(&cb, genprime_cb, NULL); | |
1757 | ||
cd2eebfd BM |
1758 | for (i = 0; i < 16; i++) |
1759 | { | |
1760 | if (i < 8) | |
1761 | { | |
77ac92d0 | 1762 | unsigned primes[8] = { 2, 3, 5, 7, 11, 13, 17, 19 }; |
cd2eebfd BM |
1763 | |
1764 | if (!BN_set_word(p, primes[i])) goto err; | |
1765 | } | |
1766 | else | |
1767 | { | |
1768 | if (!BN_set_word(a, 32)) goto err; | |
1769 | if (!BN_set_word(r, 2*i + 1)) goto err; | |
1770 | ||
2aaec9cc | 1771 | if (!BN_generate_prime_ex(p, 256, 0, a, r, &cb)) goto err; |
cd2eebfd BM |
1772 | putc('\n', stderr); |
1773 | } | |
80d89e6a | 1774 | p->neg = rand_neg(); |
cd2eebfd BM |
1775 | |
1776 | for (j = 0; j < num2; j++) | |
1777 | { | |
1778 | /* construct 'a' such that it is a square modulo p, | |
1779 | * but in general not a proper square and not reduced modulo p */ | |
111482cf | 1780 | if (!BN_bntest_rand(r, 256, 0, 3)) goto err; |
cd2eebfd BM |
1781 | if (!BN_nnmod(r, r, p, ctx)) goto err; |
1782 | if (!BN_mod_sqr(r, r, p, ctx)) goto err; | |
111482cf | 1783 | if (!BN_bntest_rand(a, 256, 0, 3)) goto err; |
cd2eebfd BM |
1784 | if (!BN_nnmod(a, a, p, ctx)) goto err; |
1785 | if (!BN_mod_sqr(a, a, p, ctx)) goto err; | |
1786 | if (!BN_mul(a, a, r, ctx)) goto err; | |
80d89e6a BM |
1787 | if (rand_neg()) |
1788 | if (!BN_sub(a, a, p)) goto err; | |
cd2eebfd BM |
1789 | |
1790 | if (!BN_mod_sqrt(r, a, p, ctx)) goto err; | |
1791 | if (!BN_mod_sqr(r, r, p, ctx)) goto err; | |
1792 | ||
1793 | if (!BN_nnmod(a, a, p, ctx)) goto err; | |
1794 | ||
1795 | if (BN_cmp(a, r) != 0) | |
1796 | { | |
1797 | fprintf(stderr, "BN_mod_sqrt failed: a = "); | |
1798 | BN_print_fp(stderr, a); | |
1799 | fprintf(stderr, ", r = "); | |
1800 | BN_print_fp(stderr, r); | |
1801 | fprintf(stderr, ", p = "); | |
1802 | BN_print_fp(stderr, p); | |
1803 | fprintf(stderr, "\n"); | |
1804 | goto err; | |
1805 | } | |
1806 | ||
1807 | putc('.', stderr); | |
1808 | fflush(stderr); | |
1809 | } | |
1810 | ||
1811 | putc('\n', stderr); | |
1812 | fflush(stderr); | |
1813 | } | |
1814 | ret = 1; | |
1815 | err: | |
1816 | if (a != NULL) BN_free(a); | |
1817 | if (p != NULL) BN_free(p); | |
1818 | if (r != NULL) BN_free(r); | |
1819 | return ret; | |
1820 | } | |
1821 | ||
4da88a8d | 1822 | int test_lshift(BIO *bp,BN_CTX *ctx,BIGNUM *a_) |
d02b48c6 | 1823 | { |
62bad771 | 1824 | BIGNUM *a,*b,*c,*d; |
d02b48c6 RE |
1825 | int i; |
1826 | ||
d02b48c6 RE |
1827 | b=BN_new(); |
1828 | c=BN_new(); | |
62bad771 | 1829 | d=BN_new(); |
d02b48c6 RE |
1830 | BN_one(c); |
1831 | ||
4da88a8d BL |
1832 | if(a_) |
1833 | a=a_; | |
1834 | else | |
1835 | { | |
1836 | a=BN_new(); | |
111482cf | 1837 | BN_bntest_rand(a,200,0,0); /**/ |
4da88a8d BL |
1838 | a->neg=rand_neg(); |
1839 | } | |
cae55bfc | 1840 | for (i=0; i<num0; i++) |
d02b48c6 RE |
1841 | { |
1842 | BN_lshift(b,a,i+1); | |
1843 | BN_add(c,c,c); | |
1844 | if (bp != NULL) | |
1845 | { | |
1846 | if (!results) | |
1847 | { | |
1848 | BN_print(bp,a); | |
1849 | BIO_puts(bp," * "); | |
1850 | BN_print(bp,c); | |
1851 | BIO_puts(bp," - "); | |
1852 | } | |
1853 | BN_print(bp,b); | |
1854 | BIO_puts(bp,"\n"); | |
1855 | } | |
62bad771 BL |
1856 | BN_mul(d,a,c,ctx); |
1857 | BN_sub(d,d,b); | |
1858 | if(!BN_is_zero(d)) | |
1859 | { | |
cae55bfc UM |
1860 | fprintf(stderr,"Left shift test failed!\n"); |
1861 | fprintf(stderr,"a="); | |
1862 | BN_print_fp(stderr,a); | |
1863 | fprintf(stderr,"\nb="); | |
1864 | BN_print_fp(stderr,b); | |
1865 | fprintf(stderr,"\nc="); | |
1866 | BN_print_fp(stderr,c); | |
1867 | fprintf(stderr,"\nd="); | |
1868 | BN_print_fp(stderr,d); | |
1869 | fprintf(stderr,"\n"); | |
62bad771 BL |
1870 | return 0; |
1871 | } | |
d02b48c6 RE |
1872 | } |
1873 | BN_free(a); | |
1874 | BN_free(b); | |
1875 | BN_free(c); | |
62bad771 | 1876 | BN_free(d); |
d02b48c6 RE |
1877 | return(1); |
1878 | } | |
1879 | ||
6b691a5c | 1880 | int test_lshift1(BIO *bp) |
d02b48c6 | 1881 | { |
62bad771 | 1882 | BIGNUM *a,*b,*c; |
d02b48c6 RE |
1883 | int i; |
1884 | ||
1885 | a=BN_new(); | |
1886 | b=BN_new(); | |
62bad771 | 1887 | c=BN_new(); |
d02b48c6 | 1888 | |
111482cf | 1889 | BN_bntest_rand(a,200,0,0); /**/ |
d02b48c6 | 1890 | a->neg=rand_neg(); |
cae55bfc | 1891 | for (i=0; i<num0; i++) |
d02b48c6 RE |
1892 | { |
1893 | BN_lshift1(b,a); | |
1894 | if (bp != NULL) | |
1895 | { | |
1896 | if (!results) | |
1897 | { | |
1898 | BN_print(bp,a); | |
1899 | BIO_puts(bp," * 2"); | |
1900 | BIO_puts(bp," - "); | |
1901 | } | |
1902 | BN_print(bp,b); | |
1903 | BIO_puts(bp,"\n"); | |
1904 | } | |
62bad771 BL |
1905 | BN_add(c,a,a); |
1906 | BN_sub(a,b,c); | |
1907 | if(!BN_is_zero(a)) | |
1908 | { | |
cae55bfc | 1909 | fprintf(stderr,"Left shift one test failed!\n"); |
62bad771 BL |
1910 | return 0; |
1911 | } | |
1912 | ||
d02b48c6 RE |
1913 | BN_copy(a,b); |
1914 | } | |
1915 | BN_free(a); | |
1916 | BN_free(b); | |
62bad771 | 1917 | BN_free(c); |
d02b48c6 RE |
1918 | return(1); |
1919 | } | |
1920 | ||
62bad771 | 1921 | int test_rshift(BIO *bp,BN_CTX *ctx) |
d02b48c6 | 1922 | { |
62bad771 | 1923 | BIGNUM *a,*b,*c,*d,*e; |
d02b48c6 RE |
1924 | int i; |
1925 | ||
1926 | a=BN_new(); | |
1927 | b=BN_new(); | |
1928 | c=BN_new(); | |
62bad771 BL |
1929 | d=BN_new(); |
1930 | e=BN_new(); | |
d02b48c6 RE |
1931 | BN_one(c); |
1932 | ||
111482cf | 1933 | BN_bntest_rand(a,200,0,0); /**/ |
d02b48c6 | 1934 | a->neg=rand_neg(); |
cae55bfc | 1935 | for (i=0; i<num0; i++) |
d02b48c6 RE |
1936 | { |
1937 | BN_rshift(b,a,i+1); | |
1938 | BN_add(c,c,c); | |
1939 | if (bp != NULL) | |
1940 | { | |
1941 | if (!results) | |
1942 | { | |
1943 | BN_print(bp,a); | |
1944 | BIO_puts(bp," / "); | |
1945 | BN_print(bp,c); | |
1946 | BIO_puts(bp," - "); | |
1947 | } | |
1948 | BN_print(bp,b); | |
1949 | BIO_puts(bp,"\n"); | |
1950 | } | |
62bad771 BL |
1951 | BN_div(d,e,a,c,ctx); |
1952 | BN_sub(d,d,b); | |
1953 | if(!BN_is_zero(d)) | |
1954 | { | |
cae55bfc | 1955 | fprintf(stderr,"Right shift test failed!\n"); |
62bad771 BL |
1956 | return 0; |
1957 | } | |
d02b48c6 RE |
1958 | } |
1959 | BN_free(a); | |
1960 | BN_free(b); | |
1961 | BN_free(c); | |
62bad771 BL |
1962 | BN_free(d); |
1963 | BN_free(e); | |
d02b48c6 RE |
1964 | return(1); |
1965 | } | |
1966 | ||
6b691a5c | 1967 | int test_rshift1(BIO *bp) |
d02b48c6 | 1968 | { |
62bad771 | 1969 | BIGNUM *a,*b,*c; |
d02b48c6 RE |
1970 | int i; |
1971 | ||
1972 | a=BN_new(); | |
1973 | b=BN_new(); | |
62bad771 | 1974 | c=BN_new(); |
d02b48c6 | 1975 | |
111482cf | 1976 | BN_bntest_rand(a,200,0,0); /**/ |
d02b48c6 | 1977 | a->neg=rand_neg(); |
cae55bfc | 1978 | for (i=0; i<num0; i++) |
d02b48c6 RE |
1979 | { |
1980 | BN_rshift1(b,a); | |
1981 | if (bp != NULL) | |
1982 | { | |
1983 | if (!results) | |
1984 | { | |
1985 | BN_print(bp,a); | |
1986 | BIO_puts(bp," / 2"); | |
1987 | BIO_puts(bp," - "); | |
1988 | } | |
1989 | BN_print(bp,b); | |
1990 | BIO_puts(bp,"\n"); | |
1991 | } | |
62bad771 BL |
1992 | BN_sub(c,a,b); |
1993 | BN_sub(c,c,b); | |
8dea52fa | 1994 | if(!BN_is_zero(c) && !BN_abs_is_word(c, 1)) |
62bad771 | 1995 | { |
cae55bfc | 1996 | fprintf(stderr,"Right shift one test failed!\n"); |
62bad771 BL |
1997 | return 0; |
1998 | } | |
d02b48c6 RE |
1999 | BN_copy(a,b); |
2000 | } | |
2001 | BN_free(a); | |
2002 | BN_free(b); | |
62bad771 | 2003 | BN_free(c); |
d02b48c6 RE |
2004 | return(1); |
2005 | } | |
2006 | ||
6b691a5c | 2007 | int rand_neg(void) |
d02b48c6 RE |
2008 | { |
2009 | static unsigned int neg=0; | |
2010 | static int sign[8]={0,0,0,1,1,0,1,1}; | |
2011 | ||
2012 | return(sign[(neg++)%8]); | |
2013 | } |