]>
git.ipfire.org Git - thirdparty/openssl.git/blob - test/bntest.c
2 * Copyright 1995-2019 The OpenSSL Project Authors. All Rights Reserved.
4 * Licensed under the OpenSSL license (the "License"). You may not use
5 * this file except in compliance with the License. You can obtain a copy
6 * in the file LICENSE in the source distribution or at
7 * https://www.openssl.org/source/license.html
15 #include <openssl/bn.h>
16 #include <openssl/crypto.h>
17 #include <openssl/err.h>
18 #include <openssl/rand.h>
19 #include "internal/nelem.h"
20 #include "internal/numbers.h"
23 #ifdef OPENSSL_SYS_WINDOWS
24 # define strcasecmp _stricmp
28 * Things in boring, not in openssl. TODO we should add them.
30 #define HAVE_BN_PADDED 0
31 #define HAVE_BN_SQRT 0
33 typedef struct filetest_st
{
35 int (*func
)(STANZA
*s
);
38 typedef struct mpitest_st
{
44 static const int NUM0
= 100; /* number of tests */
45 static const int NUM1
= 50; /* additional tests for some functions */
49 * Polynomial coefficients used in GFM tests.
51 #ifndef OPENSSL_NO_EC2M
52 static int p0
[] = { 163, 7, 6, 3, 0, -1 };
53 static int p1
[] = { 193, 15, 0, -1 };
57 * Look for |key| in the stanza and return it or NULL if not found.
59 static const char *findattr(STANZA
*s
, const char *key
)
64 for ( ; --i
>= 0; pp
++)
65 if (strcasecmp(pp
->key
, key
) == 0)
71 * Parse BIGNUM from sparse hex-strings, return |BN_hex2bn| result.
73 static int parse_bigBN(BIGNUM
**out
, const char *bn_strings
[])
75 char *bigstring
= glue_strings(bn_strings
, NULL
);
76 int ret
= BN_hex2bn(out
, bigstring
);
78 OPENSSL_free(bigstring
);
83 * Parse BIGNUM, return number of bytes parsed.
85 static int parseBN(BIGNUM
**out
, const char *in
)
88 return BN_hex2bn(out
, in
);
91 static int parsedecBN(BIGNUM
**out
, const char *in
)
94 return BN_dec2bn(out
, in
);
97 static BIGNUM
*getBN(STANZA
*s
, const char *attribute
)
102 if ((hex
= findattr(s
, attribute
)) == NULL
) {
103 TEST_error("%s:%d: Can't find %s", s
->test_file
, s
->start
, attribute
);
107 if (parseBN(&ret
, hex
) != (int)strlen(hex
)) {
108 TEST_error("Could not decode '%s'", hex
);
114 static int getint(STANZA
*s
, int *out
, const char *attribute
)
120 if (!TEST_ptr(ret
= getBN(s
, attribute
))
121 || !TEST_ulong_le(word
= BN_get_word(ret
), INT_MAX
))
131 static int equalBN(const char *op
, const BIGNUM
*expected
, const BIGNUM
*actual
)
133 if (BN_cmp(expected
, actual
) == 0)
136 TEST_error("unexpected %s value", op
);
137 TEST_BN_eq(expected
, actual
);
142 * Return a "random" flag for if a BN should be negated.
144 static int rand_neg(void)
146 static unsigned int neg
= 0;
147 static int sign
[8] = { 0, 0, 0, 1, 1, 0, 1, 1 };
149 return sign
[(neg
++) % 8];
152 static int test_swap(void)
154 BIGNUM
*a
= NULL
, *b
= NULL
, *c
= NULL
, *d
= NULL
;
155 int top
, cond
, st
= 0;
157 if (!TEST_ptr(a
= BN_new())
158 || !TEST_ptr(b
= BN_new())
159 || !TEST_ptr(c
= BN_new())
160 || !TEST_ptr(d
= BN_new()))
163 if (!(TEST_true(BN_bntest_rand(a
, 1024, 1, 0))
164 && TEST_true(BN_bntest_rand(b
, 1024, 1, 0))
165 && TEST_ptr(BN_copy(c
, a
))
166 && TEST_ptr(BN_copy(d
, b
))))
168 top
= BN_num_bits(a
) / BN_BITS2
;
172 if (!equalBN("swap", a
, d
)
173 || !equalBN("swap", b
, c
))
176 /* conditional swap: true */
178 BN_consttime_swap(cond
, a
, b
, top
);
179 if (!equalBN("cswap true", a
, c
)
180 || !equalBN("cswap true", b
, d
))
183 /* conditional swap: false */
185 BN_consttime_swap(cond
, a
, b
, top
);
186 if (!equalBN("cswap false", a
, c
)
187 || !equalBN("cswap false", b
, d
))
190 /* same tests but checking flag swap */
191 BN_set_flags(a
, BN_FLG_CONSTTIME
);
194 if (!equalBN("swap, flags", a
, d
)
195 || !equalBN("swap, flags", b
, c
)
196 || !TEST_true(BN_get_flags(b
, BN_FLG_CONSTTIME
))
197 || !TEST_false(BN_get_flags(a
, BN_FLG_CONSTTIME
)))
201 BN_consttime_swap(cond
, a
, b
, top
);
202 if (!equalBN("cswap true, flags", a
, c
)
203 || !equalBN("cswap true, flags", b
, d
)
204 || !TEST_true(BN_get_flags(a
, BN_FLG_CONSTTIME
))
205 || !TEST_false(BN_get_flags(b
, BN_FLG_CONSTTIME
)))
209 BN_consttime_swap(cond
, a
, b
, top
);
210 if (!equalBN("cswap false, flags", a
, c
)
211 || !equalBN("cswap false, flags", b
, d
)
212 || !TEST_true(BN_get_flags(a
, BN_FLG_CONSTTIME
))
213 || !TEST_false(BN_get_flags(b
, BN_FLG_CONSTTIME
)))
225 static int test_sub(void)
227 BIGNUM
*a
= NULL
, *b
= NULL
, *c
= NULL
;
230 if (!TEST_ptr(a
= BN_new())
231 || !TEST_ptr(b
= BN_new())
232 || !TEST_ptr(c
= BN_new()))
235 for (i
= 0; i
< NUM0
+ NUM1
; i
++) {
237 if (!(TEST_true(BN_bntest_rand(a
, 512, 0, 0)))
238 && TEST_ptr(BN_copy(b
, a
))
239 && TEST_int_ne(BN_set_bit(a
, i
), 0)
240 && TEST_true(BN_add_word(b
, i
)))
243 if (!TEST_true(BN_bntest_rand(b
, 400 + i
- NUM1
, 0, 0)))
245 BN_set_negative(a
, rand_neg());
246 BN_set_negative(b
, rand_neg());
248 if (!(TEST_true(BN_sub(c
, a
, b
))
249 && TEST_true(BN_add(c
, c
, b
))
250 && TEST_true(BN_sub(c
, c
, a
))
251 && TEST_BN_eq_zero(c
)))
262 static int test_div_recip(void)
264 BIGNUM
*a
= NULL
, *b
= NULL
, *c
= NULL
, *d
= NULL
, *e
= NULL
;
265 BN_RECP_CTX
*recp
= NULL
;
268 if (!TEST_ptr(a
= BN_new())
269 || !TEST_ptr(b
= BN_new())
270 || !TEST_ptr(c
= BN_new())
271 || !TEST_ptr(d
= BN_new())
272 || !TEST_ptr(e
= BN_new())
273 || !TEST_ptr(recp
= BN_RECP_CTX_new()))
276 for (i
= 0; i
< NUM0
+ NUM1
; i
++) {
278 if (!(TEST_true(BN_bntest_rand(a
, 400, 0, 0))
279 && TEST_ptr(BN_copy(b
, a
))
280 && TEST_true(BN_lshift(a
, a
, i
))
281 && TEST_true(BN_add_word(a
, i
))))
284 if (!(TEST_true(BN_bntest_rand(b
, 50 + 3 * (i
- NUM1
), 0, 0))))
287 BN_set_negative(a
, rand_neg());
288 BN_set_negative(b
, rand_neg());
289 if (!(TEST_true(BN_RECP_CTX_set(recp
, b
, ctx
))
290 && TEST_true(BN_div_recp(d
, c
, a
, recp
, ctx
))
291 && TEST_true(BN_mul(e
, d
, b
, ctx
))
292 && TEST_true(BN_add(d
, e
, c
))
293 && TEST_true(BN_sub(d
, d
, a
))
294 && TEST_BN_eq_zero(d
)))
304 BN_RECP_CTX_free(recp
);
308 static int test_mod(void)
310 BIGNUM
*a
= NULL
, *b
= NULL
, *c
= NULL
, *d
= NULL
, *e
= NULL
;
313 if (!TEST_ptr(a
= BN_new())
314 || !TEST_ptr(b
= BN_new())
315 || !TEST_ptr(c
= BN_new())
316 || !TEST_ptr(d
= BN_new())
317 || !TEST_ptr(e
= BN_new()))
320 if (!(TEST_true(BN_bntest_rand(a
, 1024, 0, 0))))
322 for (i
= 0; i
< NUM0
; i
++) {
323 if (!(TEST_true(BN_bntest_rand(b
, 450 + i
* 10, 0, 0))))
325 BN_set_negative(a
, rand_neg());
326 BN_set_negative(b
, rand_neg());
327 if (!(TEST_true(BN_mod(c
, a
, b
, ctx
))
328 && TEST_true(BN_div(d
, e
, a
, b
, ctx
))
329 && TEST_true(BN_sub(e
, e
, c
))
330 && TEST_BN_eq_zero(e
)))
343 static const char *bn1strings
[] = {
344 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
345 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
346 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
347 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
348 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
349 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
350 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
351 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000000000FFFFFFFF00",
352 "0000000000000000000000000000000000000000000000000000000000000000",
353 "0000000000000000000000000000000000000000000000000000000000000000",
354 "0000000000000000000000000000000000000000000000000000000000000000",
355 "0000000000000000000000000000000000000000000000000000000000000000",
356 "0000000000000000000000000000000000000000000000000000000000000000",
357 "0000000000000000000000000000000000000000000000000000000000000000",
358 "0000000000000000000000000000000000000000000000000000000000000000",
359 "00000000000000000000000000000000000000000000000000FFFFFFFFFFFFFF",
363 static const char *bn2strings
[] = {
364 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
365 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
366 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
367 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
368 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
369 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
370 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
371 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000000000FFFFFFFF0000000000",
372 "0000000000000000000000000000000000000000000000000000000000000000",
373 "0000000000000000000000000000000000000000000000000000000000000000",
374 "0000000000000000000000000000000000000000000000000000000000000000",
375 "0000000000000000000000000000000000000000000000000000000000000000",
376 "0000000000000000000000000000000000000000000000000000000000000000",
377 "0000000000000000000000000000000000000000000000000000000000000000",
378 "0000000000000000000000000000000000000000000000000000000000000000",
379 "000000000000000000000000000000000000000000FFFFFFFFFFFFFF00000000",
384 * Test constant-time modular exponentiation with 1024-bit inputs, which on
385 * x86_64 cause a different code branch to be taken.
387 static int test_modexp_mont5(void)
389 BIGNUM
*a
= NULL
, *p
= NULL
, *m
= NULL
, *d
= NULL
, *e
= NULL
;
390 BIGNUM
*b
= NULL
, *n
= NULL
, *c
= NULL
;
391 BN_MONT_CTX
*mont
= NULL
;
394 if (!TEST_ptr(a
= BN_new())
395 || !TEST_ptr(p
= BN_new())
396 || !TEST_ptr(m
= BN_new())
397 || !TEST_ptr(d
= BN_new())
398 || !TEST_ptr(e
= BN_new())
399 || !TEST_ptr(b
= BN_new())
400 || !TEST_ptr(n
= BN_new())
401 || !TEST_ptr(c
= BN_new())
402 || !TEST_ptr(mont
= BN_MONT_CTX_new()))
405 /* must be odd for montgomery */
406 if (!(TEST_true(BN_bntest_rand(m
, 1024, 0, 1))
408 && TEST_true(BN_bntest_rand(a
, 1024, 0, 0))))
412 if (!TEST_true(BN_mod_exp_mont_consttime(d
, a
, p
, m
, ctx
, NULL
)))
414 if (!TEST_BN_eq_one(d
))
417 /* Regression test for carry bug in mulx4x_mont */
418 if (!(TEST_true(BN_hex2bn(&a
,
419 "7878787878787878787878787878787878787878787878787878787878787878"
420 "7878787878787878787878787878787878787878787878787878787878787878"
421 "7878787878787878787878787878787878787878787878787878787878787878"
422 "7878787878787878787878787878787878787878787878787878787878787878"))
423 && TEST_true(BN_hex2bn(&b
,
424 "095D72C08C097BA488C5E439C655A192EAFB6380073D8C2664668EDDB4060744"
425 "E16E57FB4EDB9AE10A0CEFCDC28A894F689A128379DB279D48A2E20849D68593"
426 "9B7803BCF46CEBF5C533FB0DD35B080593DE5472E3FE5DB951B8BFF9B4CB8F03"
427 "9CC638A5EE8CDD703719F8000E6A9F63BEED5F2FCD52FF293EA05A251BB4AB81"))
428 && TEST_true(BN_hex2bn(&n
,
429 "D78AF684E71DB0C39CFF4E64FB9DB567132CB9C50CC98009FEB820B26F2DED9B"
430 "91B9B5E2B83AE0AE4EB4E0523CA726BFBE969B89FD754F674CE99118C3F2D1C5"
431 "D81FDC7C54E02B60262B241D53C040E99E45826ECA37A804668E690E1AFC1CA4"
432 "2C9A15D84D4954425F0B7642FC0BD9D7B24E2618D2DCC9B729D944BADACFDDAF"))))
435 if (!(TEST_true(BN_MONT_CTX_set(mont
, n
, ctx
))
436 && TEST_true(BN_mod_mul_montgomery(c
, a
, b
, mont
, ctx
))
437 && TEST_true(BN_mod_mul_montgomery(d
, b
, a
, mont
, ctx
))
438 && TEST_BN_eq(c
, d
)))
441 /* Regression test for carry bug in sqr[x]8x_mont */
442 if (!(TEST_true(parse_bigBN(&n
, bn1strings
))
443 && TEST_true(parse_bigBN(&a
, bn2strings
))))
446 if (!(TEST_ptr(b
= BN_dup(a
))
447 && TEST_true(BN_MONT_CTX_set(mont
, n
, ctx
))
448 && TEST_true(BN_mod_mul_montgomery(c
, a
, a
, mont
, ctx
))
449 && TEST_true(BN_mod_mul_montgomery(d
, a
, b
, mont
, ctx
))
450 && TEST_BN_eq(c
, d
)))
453 /* Regression test for carry bug in bn_sqrx8x_internal */
455 static const char *ahex
[] = {
456 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
457 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
458 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
459 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
460 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF8FFEADBCFC4DAE7FFF908E92820306B",
461 "9544D954000000006C0000000000000000000000000000000000000000000000",
462 "00000000000000000000FF030202FFFFF8FFEBDBCFC4DAE7FFF908E92820306B",
463 "9544D954000000006C000000FF0302030000000000FFFFFFFFFFFFFFFFFFFFFF",
464 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF01FC00FF02FFFFFFFF",
465 "00FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00FCFD",
466 "FCFFFFFFFFFF000000000000000000FF0302030000000000FFFFFFFFFFFFFFFF",
467 "FF00FCFDFDFF030202FF00000000FFFFFFFFFFFFFFFFFF00FCFDFCFFFFFFFFFF",
470 static const char *nhex
[] = {
471 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
472 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
473 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
474 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
475 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF8F8F8F8000000",
476 "00000010000000006C0000000000000000000000000000000000000000000000",
477 "00000000000000000000000000000000000000FFFFFFFFFFFFF8F8F8F8000000",
478 "00000010000000006C000000000000000000000000FFFFFFFFFFFFFFFFFFFFFF",
479 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
480 "00FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
481 "FFFFFFFFFFFF000000000000000000000000000000000000FFFFFFFFFFFFFFFF",
482 "FFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
486 if (!(TEST_true(parse_bigBN(&a
, ahex
))
487 && TEST_true(parse_bigBN(&n
, nhex
))))
491 if (!(TEST_ptr(b
= BN_dup(a
))
492 && TEST_true(BN_MONT_CTX_set(mont
, n
, ctx
))))
495 if (!TEST_true(BN_mod_mul_montgomery(c
, a
, a
, mont
, ctx
))
496 || !TEST_true(BN_mod_mul_montgomery(d
, a
, b
, mont
, ctx
))
497 || !TEST_BN_eq(c
, d
))
500 /* Regression test for bug in BN_from_montgomery_word */
501 if (!(TEST_true(BN_hex2bn(&a
,
502 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
503 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
504 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"))
505 && TEST_true(BN_hex2bn(&n
,
506 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
507 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"))
508 && TEST_true(BN_MONT_CTX_set(mont
, n
, ctx
))
509 && TEST_false(BN_mod_mul_montgomery(d
, a
, a
, mont
, ctx
))))
512 /* Regression test for bug in rsaz_1024_mul_avx2 */
513 if (!(TEST_true(BN_hex2bn(&a
,
514 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
515 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
516 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
517 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF2020202020DF"))
518 && TEST_true(BN_hex2bn(&b
,
519 "2020202020202020202020202020202020202020202020202020202020202020"
520 "2020202020202020202020202020202020202020202020202020202020202020"
521 "20202020202020FF202020202020202020202020202020202020202020202020"
522 "2020202020202020202020202020202020202020202020202020202020202020"))
523 && TEST_true(BN_hex2bn(&n
,
524 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
525 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
526 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
527 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF2020202020FF"))
528 && TEST_true(BN_MONT_CTX_set(mont
, n
, ctx
))
529 && TEST_true(BN_mod_exp_mont_consttime(c
, a
, b
, n
, ctx
, mont
))
530 && TEST_true(BN_mod_exp_mont(d
, a
, b
, n
, ctx
, mont
))
531 && TEST_BN_eq(c
, d
)))
535 * rsaz_1024_mul_avx2 expects fully-reduced inputs.
536 * BN_mod_exp_mont_consttime should reduce the input first.
538 if (!(TEST_true(BN_hex2bn(&a
,
539 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
540 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
541 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
542 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF2020202020DF"))
543 && TEST_true(BN_hex2bn(&b
,
544 "1FA53F26F8811C58BE0357897AA5E165693230BC9DF5F01DFA6A2D59229EC69D"
545 "9DE6A89C36E3B6957B22D6FAAD5A3C73AE587B710DBE92E83D3A9A3339A085CB"
546 "B58F508CA4F837924BB52CC1698B7FDC2FD74362456A595A5B58E38E38E38E38"
547 "E38E38E38E38E38E38E38E38E38E38E38E38E38E38E38E38E38E38E38E38E38E"))
548 && TEST_true(BN_hex2bn(&n
,
549 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
550 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
551 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
552 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF2020202020DF"))
553 && TEST_true(BN_MONT_CTX_set(mont
, n
, ctx
))
554 && TEST_true(BN_mod_exp_mont_consttime(c
, a
, b
, n
, ctx
, mont
))))
557 if (!TEST_BN_eq(c
, d
))
561 if (!TEST_true(BN_bntest_rand(p
, 1024, 0, 0)))
564 if (!TEST_true(BN_mod_exp_mont_consttime(d
, a
, p
, m
, ctx
, NULL
))
565 || !TEST_BN_eq_zero(d
))
569 * Craft an input whose Montgomery representation is 1, i.e., shorter
570 * than the modulus m, in order to test the const time precomputation
571 * scattering/gathering.
573 if (!(TEST_true(BN_one(a
))
574 && TEST_true(BN_MONT_CTX_set(mont
, m
, ctx
))))
576 if (!TEST_true(BN_from_montgomery(e
, a
, mont
, ctx
))
577 || !TEST_true(BN_mod_exp_mont_consttime(d
, e
, p
, m
, ctx
, NULL
))
578 || !TEST_true(BN_mod_exp_simple(a
, e
, p
, m
, ctx
))
579 || !TEST_BN_eq(a
, d
))
582 /* Finally, some regular test vectors. */
583 if (!(TEST_true(BN_bntest_rand(e
, 1024, 0, 0))
584 && TEST_true(BN_mod_exp_mont_consttime(d
, e
, p
, m
, ctx
, NULL
))
585 && TEST_true(BN_mod_exp_simple(a
, e
, p
, m
, ctx
))
586 && TEST_BN_eq(a
, d
)))
592 BN_MONT_CTX_free(mont
);
604 #ifndef OPENSSL_NO_EC2M
605 static int test_gf2m_add(void)
607 BIGNUM
*a
= NULL
, *b
= NULL
, *c
= NULL
;
610 if (!TEST_ptr(a
= BN_new())
611 || !TEST_ptr(b
= BN_new())
612 || !TEST_ptr(c
= BN_new()))
615 for (i
= 0; i
< NUM0
; i
++) {
616 if (!(TEST_true(BN_rand(a
, 512, 0, 0))
617 && TEST_ptr(BN_copy(b
, BN_value_one()))))
619 BN_set_negative(a
, rand_neg());
620 BN_set_negative(b
, rand_neg());
621 if (!(TEST_true(BN_GF2m_add(c
, a
, b
))
622 /* Test that two added values have the correct parity. */
623 && TEST_false((BN_is_odd(a
) && BN_is_odd(c
))
624 || (!BN_is_odd(a
) && !BN_is_odd(c
)))))
626 if (!(TEST_true(BN_GF2m_add(c
, c
, c
))
627 /* Test that c + c = 0. */
628 && TEST_BN_eq_zero(c
)))
639 static int test_gf2m_mod(void)
641 BIGNUM
*a
= NULL
, *b
[2] = {NULL
,NULL
}, *c
= NULL
, *d
= NULL
, *e
= NULL
;
644 if (!TEST_ptr(a
= BN_new())
645 || !TEST_ptr(b
[0] = BN_new())
646 || !TEST_ptr(b
[1] = BN_new())
647 || !TEST_ptr(c
= BN_new())
648 || !TEST_ptr(d
= BN_new())
649 || !TEST_ptr(e
= BN_new()))
652 if (!(TEST_true(BN_GF2m_arr2poly(p0
, b
[0]))
653 && TEST_true(BN_GF2m_arr2poly(p1
, b
[1]))))
656 for (i
= 0; i
< NUM0
; i
++) {
657 if (!TEST_true(BN_bntest_rand(a
, 1024, 0, 0)))
659 for (j
= 0; j
< 2; j
++) {
660 if (!(TEST_true(BN_GF2m_mod(c
, a
, b
[j
]))
661 && TEST_true(BN_GF2m_add(d
, a
, c
))
662 && TEST_true(BN_GF2m_mod(e
, d
, b
[j
]))
663 /* Test that a + (a mod p) mod p == 0. */
664 && TEST_BN_eq_zero(e
)))
679 static int test_gf2m_mul(void)
681 BIGNUM
*a
, *b
[2] = {NULL
, NULL
}, *c
= NULL
, *d
= NULL
;
682 BIGNUM
*e
= NULL
, *f
= NULL
, *g
= NULL
, *h
= NULL
;
685 if (!TEST_ptr(a
= BN_new())
686 || !TEST_ptr(b
[0] = BN_new())
687 || !TEST_ptr(b
[1] = BN_new())
688 || !TEST_ptr(c
= BN_new())
689 || !TEST_ptr(d
= BN_new())
690 || !TEST_ptr(e
= BN_new())
691 || !TEST_ptr(f
= BN_new())
692 || !TEST_ptr(g
= BN_new())
693 || !TEST_ptr(h
= BN_new()))
696 if (!(TEST_true(BN_GF2m_arr2poly(p0
, b
[0]))
697 && TEST_true(BN_GF2m_arr2poly(p1
, b
[1]))))
700 for (i
= 0; i
< NUM0
; i
++) {
701 if (!(TEST_true(BN_bntest_rand(a
, 1024, 0, 0))
702 && TEST_true(BN_bntest_rand(c
, 1024, 0, 0))
703 && TEST_true(BN_bntest_rand(d
, 1024, 0, 0))))
705 for (j
= 0; j
< 2; j
++) {
706 if (!(TEST_true(BN_GF2m_mod_mul(e
, a
, c
, b
[j
], ctx
))
707 && TEST_true(BN_GF2m_add(f
, a
, d
))
708 && TEST_true(BN_GF2m_mod_mul(g
, f
, c
, b
[j
], ctx
))
709 && TEST_true(BN_GF2m_mod_mul(h
, d
, c
, b
[j
], ctx
))
710 && TEST_true(BN_GF2m_add(f
, e
, g
))
711 && TEST_true(BN_GF2m_add(f
, f
, h
))
712 /* Test that (a+d)*c = a*c + d*c. */
713 && TEST_BN_eq_zero(f
)))
732 static int test_gf2m_sqr(void)
734 BIGNUM
*a
= NULL
, *b
[2] = {NULL
,NULL
}, *c
= NULL
, *d
= NULL
;
737 if (!TEST_ptr(a
= BN_new())
738 || !TEST_ptr(b
[0] = BN_new())
739 || !TEST_ptr(b
[1] = BN_new())
740 || !TEST_ptr(c
= BN_new())
741 || !TEST_ptr(d
= BN_new()))
744 if (!(TEST_true(BN_GF2m_arr2poly(p0
, b
[0]))
745 && TEST_true(BN_GF2m_arr2poly(p1
, b
[1]))))
748 for (i
= 0; i
< NUM0
; i
++) {
749 if (!TEST_true(BN_bntest_rand(a
, 1024, 0, 0)))
751 for (j
= 0; j
< 2; j
++) {
752 if (!(TEST_true(BN_GF2m_mod_sqr(c
, a
, b
[j
], ctx
))
753 && TEST_true(BN_copy(d
, a
))
754 && TEST_true(BN_GF2m_mod_mul(d
, a
, d
, b
[j
], ctx
))
755 && TEST_true(BN_GF2m_add(d
, c
, d
))
756 /* Test that a*a = a^2. */
757 && TEST_BN_eq_zero(d
)))
771 static int test_gf2m_modinv(void)
773 BIGNUM
*a
= NULL
, *b
[2] = {NULL
,NULL
}, *c
= NULL
, *d
= NULL
;
776 if (!TEST_ptr(a
= BN_new())
777 || !TEST_ptr(b
[0] = BN_new())
778 || !TEST_ptr(b
[1] = BN_new())
779 || !TEST_ptr(c
= BN_new())
780 || !TEST_ptr(d
= BN_new()))
783 if (!(TEST_true(BN_GF2m_arr2poly(p0
, b
[0]))
784 && TEST_true(BN_GF2m_arr2poly(p1
, b
[1]))))
787 for (i
= 0; i
< NUM0
; i
++) {
788 if (!TEST_true(BN_bntest_rand(a
, 512, 0, 0)))
790 for (j
= 0; j
< 2; j
++) {
791 if (!(TEST_true(BN_GF2m_mod_inv(c
, a
, b
[j
], ctx
))
792 && TEST_true(BN_GF2m_mod_mul(d
, a
, c
, b
[j
], ctx
))
793 /* Test that ((1/a)*a) = 1. */
794 && TEST_BN_eq_one(d
)))
808 static int test_gf2m_moddiv(void)
810 BIGNUM
*a
= NULL
, *b
[2] = {NULL
,NULL
}, *c
= NULL
, *d
= NULL
;
811 BIGNUM
*e
= NULL
, *f
= NULL
;
814 if (!TEST_ptr(a
= BN_new())
815 || !TEST_ptr(b
[0] = BN_new())
816 || !TEST_ptr(b
[1] = BN_new())
817 || !TEST_ptr(c
= BN_new())
818 || !TEST_ptr(d
= BN_new())
819 || !TEST_ptr(e
= BN_new())
820 || !TEST_ptr(f
= BN_new()))
823 if (!(TEST_true(BN_GF2m_arr2poly(p0
, b
[0]))
824 && TEST_true(BN_GF2m_arr2poly(p1
, b
[1]))))
827 for (i
= 0; i
< NUM0
; i
++) {
828 if (!(TEST_true(BN_bntest_rand(a
, 512, 0, 0))
829 && TEST_true(BN_bntest_rand(c
, 512, 0, 0))))
831 for (j
= 0; j
< 2; j
++) {
832 if (!(TEST_true(BN_GF2m_mod_div(d
, a
, c
, b
[j
], ctx
))
833 && TEST_true(BN_GF2m_mod_mul(e
, d
, c
, b
[j
], ctx
))
834 && TEST_true(BN_GF2m_mod_div(f
, a
, e
, b
[j
], ctx
))
835 /* Test that ((a/c)*c)/a = 1. */
836 && TEST_BN_eq_one(f
)))
852 static int test_gf2m_modexp(void)
854 BIGNUM
*a
= NULL
, *b
[2] = {NULL
,NULL
}, *c
= NULL
, *d
= NULL
;
855 BIGNUM
*e
= NULL
, *f
= NULL
;
858 if (!TEST_ptr(a
= BN_new())
859 || !TEST_ptr(b
[0] = BN_new())
860 || !TEST_ptr(b
[1] = BN_new())
861 || !TEST_ptr(c
= BN_new())
862 || !TEST_ptr(d
= BN_new())
863 || !TEST_ptr(e
= BN_new())
864 || !TEST_ptr(f
= BN_new()))
867 if (!(TEST_true(BN_GF2m_arr2poly(p0
, b
[0]))
868 && TEST_true(BN_GF2m_arr2poly(p1
, b
[1]))))
871 for (i
= 0; i
< NUM0
; i
++) {
872 if (!(TEST_true(BN_bntest_rand(a
, 512, 0, 0))
873 && TEST_true(BN_bntest_rand(c
, 512, 0, 0))
874 && TEST_true(BN_bntest_rand(d
, 512, 0, 0))))
876 for (j
= 0; j
< 2; j
++) {
877 if (!(TEST_true(BN_GF2m_mod_exp(e
, a
, c
, b
[j
], ctx
))
878 && TEST_true(BN_GF2m_mod_exp(f
, a
, d
, b
[j
], ctx
))
879 && TEST_true(BN_GF2m_mod_mul(e
, e
, f
, b
[j
], ctx
))
880 && TEST_true(BN_add(f
, c
, d
))
881 && TEST_true(BN_GF2m_mod_exp(f
, a
, f
, b
[j
], ctx
))
882 && TEST_true(BN_GF2m_add(f
, e
, f
))
883 /* Test that a^(c+d)=a^c*a^d. */
884 && TEST_BN_eq_zero(f
)))
900 static int test_gf2m_modsqrt(void)
902 BIGNUM
*a
= NULL
, *b
[2] = {NULL
,NULL
}, *c
= NULL
, *d
= NULL
;
903 BIGNUM
*e
= NULL
, *f
= NULL
;
906 if (!TEST_ptr(a
= BN_new())
907 || !TEST_ptr(b
[0] = BN_new())
908 || !TEST_ptr(b
[1] = BN_new())
909 || !TEST_ptr(c
= BN_new())
910 || !TEST_ptr(d
= BN_new())
911 || !TEST_ptr(e
= BN_new())
912 || !TEST_ptr(f
= BN_new()))
915 if (!(TEST_true(BN_GF2m_arr2poly(p0
, b
[0]))
916 && TEST_true(BN_GF2m_arr2poly(p1
, b
[1]))))
919 for (i
= 0; i
< NUM0
; i
++) {
920 if (!TEST_true(BN_bntest_rand(a
, 512, 0, 0)))
923 for (j
= 0; j
< 2; j
++) {
924 if (!(TEST_true(BN_GF2m_mod(c
, a
, b
[j
]))
925 && TEST_true(BN_GF2m_mod_sqrt(d
, a
, b
[j
], ctx
))
926 && TEST_true(BN_GF2m_mod_sqr(e
, d
, b
[j
], ctx
))
927 && TEST_true(BN_GF2m_add(f
, c
, e
))
928 /* Test that d^2 = a, where d = sqrt(a). */
929 && TEST_BN_eq_zero(f
)))
945 static int test_gf2m_modsolvequad(void)
947 BIGNUM
*a
= NULL
, *b
[2] = {NULL
,NULL
}, *c
= NULL
, *d
= NULL
;
949 int i
, j
, s
= 0, t
, st
= 0;
951 if (!TEST_ptr(a
= BN_new())
952 || !TEST_ptr(b
[0] = BN_new())
953 || !TEST_ptr(b
[1] = BN_new())
954 || !TEST_ptr(c
= BN_new())
955 || !TEST_ptr(d
= BN_new())
956 || !TEST_ptr(e
= BN_new()))
959 if (!(TEST_true(BN_GF2m_arr2poly(p0
, b
[0]))
960 && TEST_true(BN_GF2m_arr2poly(p1
, b
[1]))))
963 for (i
= 0; i
< NUM0
; i
++) {
964 if (!TEST_true(BN_bntest_rand(a
, 512, 0, 0)))
966 for (j
= 0; j
< 2; j
++) {
967 t
= BN_GF2m_mod_solve_quad(c
, a
, b
[j
], ctx
);
970 if (!(TEST_true(BN_GF2m_mod_sqr(d
, c
, b
[j
], ctx
))
971 && TEST_true(BN_GF2m_add(d
, c
, d
))
972 && TEST_true(BN_GF2m_mod(e
, a
, b
[j
]))
973 && TEST_true(BN_GF2m_add(e
, e
, d
))
975 * Test that solution of quadratic c
976 * satisfies c^2 + c = a.
978 && TEST_BN_eq_zero(e
)))
983 if (!TEST_int_ge(s
, 0)) {
984 TEST_info("%d tests found no roots; probably an error", NUM0
);
999 static int test_kronecker(void)
1001 BIGNUM
*a
= NULL
, *b
= NULL
, *r
= NULL
, *t
= NULL
;
1002 int i
, legendre
, kronecker
, st
= 0;
1004 if (!TEST_ptr(a
= BN_new())
1005 || !TEST_ptr(b
= BN_new())
1006 || !TEST_ptr(r
= BN_new())
1007 || !TEST_ptr(t
= BN_new()))
1011 * We test BN_kronecker(a, b, ctx) just for b odd (Jacobi symbol). In
1012 * this case we know that if b is prime, then BN_kronecker(a, b, ctx) is
1013 * congruent to $a^{(b-1)/2}$, modulo $b$ (Legendre symbol). So we
1014 * generate a random prime b and compare these values for a number of
1015 * random a's. (That is, we run the Solovay-Strassen primality test to
1016 * confirm that b is prime, except that we don't want to test whether b
1017 * is prime but whether BN_kronecker works.)
1020 if (!TEST_true(BN_generate_prime_ex(b
, 512, 0, NULL
, NULL
, NULL
)))
1022 BN_set_negative(b
, rand_neg());
1024 for (i
= 0; i
< NUM0
; i
++) {
1025 if (!TEST_true(BN_bntest_rand(a
, 512, 0, 0)))
1027 BN_set_negative(a
, rand_neg());
1029 /* t := (|b|-1)/2 (note that b is odd) */
1030 if (!TEST_true(BN_copy(t
, b
)))
1032 BN_set_negative(t
, 0);
1033 if (!TEST_true(BN_sub_word(t
, 1)))
1035 if (!TEST_true(BN_rshift1(t
, t
)))
1037 /* r := a^t mod b */
1038 BN_set_negative(b
, 0);
1040 if (!TEST_true(BN_mod_exp_recp(r
, a
, t
, b
, ctx
)))
1042 BN_set_negative(b
, 1);
1044 if (BN_is_word(r
, 1))
1046 else if (BN_is_zero(r
))
1049 if (!TEST_true(BN_add_word(r
, 1)))
1051 if (!TEST_int_eq(BN_ucmp(r
, b
), 0)) {
1052 TEST_info("Legendre symbol computation failed");
1058 if (!TEST_int_ge(kronecker
= BN_kronecker(a
, b
, ctx
), -1))
1060 /* we actually need BN_kronecker(a, |b|) */
1061 if (BN_is_negative(a
) && BN_is_negative(b
))
1062 kronecker
= -kronecker
;
1064 if (!TEST_int_eq(legendre
, kronecker
))
1077 static int file_sum(STANZA
*s
)
1079 BIGNUM
*a
= NULL
, *b
= NULL
, *sum
= NULL
, *ret
= NULL
;
1083 if (!TEST_ptr(a
= getBN(s
, "A"))
1084 || !TEST_ptr(b
= getBN(s
, "B"))
1085 || !TEST_ptr(sum
= getBN(s
, "Sum"))
1086 || !TEST_ptr(ret
= BN_new()))
1089 if (!TEST_true(BN_add(ret
, a
, b
))
1090 || !equalBN("A + B", sum
, ret
)
1091 || !TEST_true(BN_sub(ret
, sum
, a
))
1092 || !equalBN("Sum - A", b
, ret
)
1093 || !TEST_true(BN_sub(ret
, sum
, b
))
1094 || !equalBN("Sum - B", a
, ret
))
1098 * Test that the functions work when |r| and |a| point to the same BIGNUM,
1099 * or when |r| and |b| point to the same BIGNUM.
1100 * TODO: Test where all of |r|, |a|, and |b| point to the same BIGNUM.
1102 if (!TEST_true(BN_copy(ret
, a
))
1103 || !TEST_true(BN_add(ret
, ret
, b
))
1104 || !equalBN("A + B (r is a)", sum
, ret
)
1105 || !TEST_true(BN_copy(ret
, b
))
1106 || !TEST_true(BN_add(ret
, a
, ret
))
1107 || !equalBN("A + B (r is b)", sum
, ret
)
1108 || !TEST_true(BN_copy(ret
, sum
))
1109 || !TEST_true(BN_sub(ret
, ret
, a
))
1110 || !equalBN("Sum - A (r is a)", b
, ret
)
1111 || !TEST_true(BN_copy(ret
, a
))
1112 || !TEST_true(BN_sub(ret
, sum
, ret
))
1113 || !equalBN("Sum - A (r is b)", b
, ret
)
1114 || !TEST_true(BN_copy(ret
, sum
))
1115 || !TEST_true(BN_sub(ret
, ret
, b
))
1116 || !equalBN("Sum - B (r is a)", a
, ret
)
1117 || !TEST_true(BN_copy(ret
, b
))
1118 || !TEST_true(BN_sub(ret
, sum
, ret
))
1119 || !equalBN("Sum - B (r is b)", a
, ret
))
1123 * Test BN_uadd() and BN_usub() with the prerequisites they are
1124 * documented as having. Note that these functions are frequently used
1125 * when the prerequisites don't hold. In those cases, they are supposed
1126 * to work as if the prerequisite hold, but we don't test that yet.
1129 if (!BN_is_negative(a
) && !BN_is_negative(b
) && BN_cmp(a
, b
) >= 0) {
1130 if (!TEST_true(BN_uadd(ret
, a
, b
))
1131 || !equalBN("A +u B", sum
, ret
)
1132 || !TEST_true(BN_usub(ret
, sum
, a
))
1133 || !equalBN("Sum -u A", b
, ret
)
1134 || !TEST_true(BN_usub(ret
, sum
, b
))
1135 || !equalBN("Sum -u B", a
, ret
))
1138 * Test that the functions work when |r| and |a| point to the same
1139 * BIGNUM, or when |r| and |b| point to the same BIGNUM.
1140 * TODO: Test where all of |r|, |a|, and |b| point to the same BIGNUM.
1142 if (!TEST_true(BN_copy(ret
, a
))
1143 || !TEST_true(BN_uadd(ret
, ret
, b
))
1144 || !equalBN("A +u B (r is a)", sum
, ret
)
1145 || !TEST_true(BN_copy(ret
, b
))
1146 || !TEST_true(BN_uadd(ret
, a
, ret
))
1147 || !equalBN("A +u B (r is b)", sum
, ret
)
1148 || !TEST_true(BN_copy(ret
, sum
))
1149 || !TEST_true(BN_usub(ret
, ret
, a
))
1150 || !equalBN("Sum -u A (r is a)", b
, ret
)
1151 || !TEST_true(BN_copy(ret
, a
))
1152 || !TEST_true(BN_usub(ret
, sum
, ret
))
1153 || !equalBN("Sum -u A (r is b)", b
, ret
)
1154 || !TEST_true(BN_copy(ret
, sum
))
1155 || !TEST_true(BN_usub(ret
, ret
, b
))
1156 || !equalBN("Sum -u B (r is a)", a
, ret
)
1157 || !TEST_true(BN_copy(ret
, b
))
1158 || !TEST_true(BN_usub(ret
, sum
, ret
))
1159 || !equalBN("Sum -u B (r is b)", a
, ret
))
1164 * Test with BN_add_word() and BN_sub_word() if |b| is small enough.
1166 b_word
= BN_get_word(b
);
1167 if (!BN_is_negative(b
) && b_word
!= (BN_ULONG
)-1) {
1168 if (!TEST_true(BN_copy(ret
, a
))
1169 || !TEST_true(BN_add_word(ret
, b_word
))
1170 || !equalBN("A + B (word)", sum
, ret
)
1171 || !TEST_true(BN_copy(ret
, sum
))
1172 || !TEST_true(BN_sub_word(ret
, b_word
))
1173 || !equalBN("Sum - B (word)", a
, ret
))
1186 static int file_lshift1(STANZA
*s
)
1188 BIGNUM
*a
= NULL
, *lshift1
= NULL
, *zero
= NULL
, *ret
= NULL
;
1189 BIGNUM
*two
= NULL
, *remainder
= NULL
;
1192 if (!TEST_ptr(a
= getBN(s
, "A"))
1193 || !TEST_ptr(lshift1
= getBN(s
, "LShift1"))
1194 || !TEST_ptr(zero
= BN_new())
1195 || !TEST_ptr(ret
= BN_new())
1196 || !TEST_ptr(two
= BN_new())
1197 || !TEST_ptr(remainder
= BN_new()))
1202 if (!TEST_true(BN_set_word(two
, 2))
1203 || !TEST_true(BN_add(ret
, a
, a
))
1204 || !equalBN("A + A", lshift1
, ret
)
1205 || !TEST_true(BN_mul(ret
, a
, two
, ctx
))
1206 || !equalBN("A * 2", lshift1
, ret
)
1207 || !TEST_true(BN_div(ret
, remainder
, lshift1
, two
, ctx
))
1208 || !equalBN("LShift1 / 2", a
, ret
)
1209 || !equalBN("LShift1 % 2", zero
, remainder
)
1210 || !TEST_true(BN_lshift1(ret
, a
))
1211 || !equalBN("A << 1", lshift1
, ret
)
1212 || !TEST_true(BN_rshift1(ret
, lshift1
))
1213 || !equalBN("LShift >> 1", a
, ret
)
1214 || !TEST_true(BN_rshift1(ret
, lshift1
))
1215 || !equalBN("LShift >> 1", a
, ret
))
1218 /* Set the LSB to 1 and test rshift1 again. */
1219 if (!TEST_true(BN_set_bit(lshift1
, 0))
1220 || !TEST_true(BN_div(ret
, NULL
/* rem */ , lshift1
, two
, ctx
))
1221 || !equalBN("(LShift1 | 1) / 2", a
, ret
)
1222 || !TEST_true(BN_rshift1(ret
, lshift1
))
1223 || !equalBN("(LShift | 1) >> 1", a
, ret
))
1238 static int file_lshift(STANZA
*s
)
1240 BIGNUM
*a
= NULL
, *lshift
= NULL
, *ret
= NULL
;
1243 if (!TEST_ptr(a
= getBN(s
, "A"))
1244 || !TEST_ptr(lshift
= getBN(s
, "LShift"))
1245 || !TEST_ptr(ret
= BN_new())
1246 || !getint(s
, &n
, "N"))
1249 if (!TEST_true(BN_lshift(ret
, a
, n
))
1250 || !equalBN("A << N", lshift
, ret
)
1251 || !TEST_true(BN_rshift(ret
, lshift
, n
))
1252 || !equalBN("A >> N", a
, ret
))
1263 static int file_rshift(STANZA
*s
)
1265 BIGNUM
*a
= NULL
, *rshift
= NULL
, *ret
= NULL
;
1268 if (!TEST_ptr(a
= getBN(s
, "A"))
1269 || !TEST_ptr(rshift
= getBN(s
, "RShift"))
1270 || !TEST_ptr(ret
= BN_new())
1271 || !getint(s
, &n
, "N"))
1274 if (!TEST_true(BN_rshift(ret
, a
, n
))
1275 || !equalBN("A >> N", rshift
, ret
))
1278 /* If N == 1, try with rshift1 as well */
1280 if (!TEST_true(BN_rshift1(ret
, a
))
1281 || !equalBN("A >> 1 (rshift1)", rshift
, ret
))
1293 static int file_square(STANZA
*s
)
1295 BIGNUM
*a
= NULL
, *square
= NULL
, *zero
= NULL
, *ret
= NULL
;
1296 BIGNUM
*remainder
= NULL
, *tmp
= NULL
;
1299 if (!TEST_ptr(a
= getBN(s
, "A"))
1300 || !TEST_ptr(square
= getBN(s
, "Square"))
1301 || !TEST_ptr(zero
= BN_new())
1302 || !TEST_ptr(ret
= BN_new())
1303 || !TEST_ptr(remainder
= BN_new()))
1307 if (!TEST_true(BN_sqr(ret
, a
, ctx
))
1308 || !equalBN("A^2", square
, ret
)
1309 || !TEST_true(BN_mul(ret
, a
, a
, ctx
))
1310 || !equalBN("A * A", square
, ret
)
1311 || !TEST_true(BN_div(ret
, remainder
, square
, a
, ctx
))
1312 || !equalBN("Square / A", a
, ret
)
1313 || !equalBN("Square % A", zero
, remainder
))
1317 BN_set_negative(a
, 0);
1318 if (!TEST_true(BN_sqrt(ret
, square
, ctx
))
1319 || !equalBN("sqrt(Square)", a
, ret
))
1322 /* BN_sqrt should fail on non-squares and negative numbers. */
1323 if (!TEST_BN_eq_zero(square
)) {
1324 if (!TEST_ptr(tmp
= BN_new())
1325 || !TEST_true(BN_copy(tmp
, square
)))
1327 BN_set_negative(tmp
, 1);
1329 if (!TEST_int_eq(BN_sqrt(ret
, tmp
, ctx
), 0))
1333 BN_set_negative(tmp
, 0);
1334 if (BN_add(tmp
, tmp
, BN_value_one()))
1336 if (!TEST_int_eq(BN_sqrt(ret
, tmp
, ctx
)))
1353 static int file_product(STANZA
*s
)
1355 BIGNUM
*a
= NULL
, *b
= NULL
, *product
= NULL
, *ret
= NULL
;
1356 BIGNUM
*remainder
= NULL
, *zero
= NULL
;
1359 if (!TEST_ptr(a
= getBN(s
, "A"))
1360 || !TEST_ptr(b
= getBN(s
, "B"))
1361 || !TEST_ptr(product
= getBN(s
, "Product"))
1362 || !TEST_ptr(ret
= BN_new())
1363 || !TEST_ptr(remainder
= BN_new())
1364 || !TEST_ptr(zero
= BN_new()))
1369 if (!TEST_true(BN_mul(ret
, a
, b
, ctx
))
1370 || !equalBN("A * B", product
, ret
)
1371 || !TEST_true(BN_div(ret
, remainder
, product
, a
, ctx
))
1372 || !equalBN("Product / A", b
, ret
)
1373 || !equalBN("Product % A", zero
, remainder
)
1374 || !TEST_true(BN_div(ret
, remainder
, product
, b
, ctx
))
1375 || !equalBN("Product / B", a
, ret
)
1376 || !equalBN("Product % B", zero
, remainder
))
1390 static int file_quotient(STANZA
*s
)
1392 BIGNUM
*a
= NULL
, *b
= NULL
, *quotient
= NULL
, *remainder
= NULL
;
1393 BIGNUM
*ret
= NULL
, *ret2
= NULL
, *nnmod
= NULL
;
1394 BN_ULONG b_word
, ret_word
;
1397 if (!TEST_ptr(a
= getBN(s
, "A"))
1398 || !TEST_ptr(b
= getBN(s
, "B"))
1399 || !TEST_ptr(quotient
= getBN(s
, "Quotient"))
1400 || !TEST_ptr(remainder
= getBN(s
, "Remainder"))
1401 || !TEST_ptr(ret
= BN_new())
1402 || !TEST_ptr(ret2
= BN_new())
1403 || !TEST_ptr(nnmod
= BN_new()))
1406 if (!TEST_true(BN_div(ret
, ret2
, a
, b
, ctx
))
1407 || !equalBN("A / B", quotient
, ret
)
1408 || !equalBN("A % B", remainder
, ret2
)
1409 || !TEST_true(BN_mul(ret
, quotient
, b
, ctx
))
1410 || !TEST_true(BN_add(ret
, ret
, remainder
))
1411 || !equalBN("Quotient * B + Remainder", a
, ret
))
1415 * Test with BN_mod_word() and BN_div_word() if the divisor is
1418 b_word
= BN_get_word(b
);
1419 if (!BN_is_negative(b
) && b_word
!= (BN_ULONG
)-1) {
1420 BN_ULONG remainder_word
= BN_get_word(remainder
);
1422 assert(remainder_word
!= (BN_ULONG
)-1);
1423 if (!TEST_ptr(BN_copy(ret
, a
)))
1425 ret_word
= BN_div_word(ret
, b_word
);
1426 if (ret_word
!= remainder_word
) {
1429 "Got A %% B (word) = " BN_DEC_FMT1
", wanted " BN_DEC_FMT1
,
1430 ret_word
, remainder_word
);
1432 TEST_error("Got A %% B (word) mismatch");
1436 if (!equalBN ("A / B (word)", quotient
, ret
))
1439 ret_word
= BN_mod_word(a
, b_word
);
1440 if (ret_word
!= remainder_word
) {
1443 "Got A %% B (word) = " BN_DEC_FMT1
", wanted " BN_DEC_FMT1
"",
1444 ret_word
, remainder_word
);
1446 TEST_error("Got A %% B (word) mismatch");
1452 /* Test BN_nnmod. */
1453 if (!BN_is_negative(b
)) {
1454 if (!TEST_true(BN_copy(nnmod
, remainder
))
1455 || (BN_is_negative(nnmod
)
1456 && !TEST_true(BN_add(nnmod
, nnmod
, b
)))
1457 || !TEST_true(BN_nnmod(ret
, a
, b
, ctx
))
1458 || !equalBN("A % B (non-negative)", nnmod
, ret
))
1474 static int file_modmul(STANZA
*s
)
1476 BIGNUM
*a
= NULL
, *b
= NULL
, *m
= NULL
, *mod_mul
= NULL
, *ret
= NULL
;
1479 if (!TEST_ptr(a
= getBN(s
, "A"))
1480 || !TEST_ptr(b
= getBN(s
, "B"))
1481 || !TEST_ptr(m
= getBN(s
, "M"))
1482 || !TEST_ptr(mod_mul
= getBN(s
, "ModMul"))
1483 || !TEST_ptr(ret
= BN_new()))
1486 if (!TEST_true(BN_mod_mul(ret
, a
, b
, m
, ctx
))
1487 || !equalBN("A * B (mod M)", mod_mul
, ret
))
1491 /* Reduce |a| and |b| and test the Montgomery version. */
1492 BN_MONT_CTX
*mont
= BN_MONT_CTX_new();
1493 BIGNUM
*a_tmp
= BN_new();
1494 BIGNUM
*b_tmp
= BN_new();
1496 if (mont
== NULL
|| a_tmp
== NULL
|| b_tmp
== NULL
1497 || !TEST_true(BN_MONT_CTX_set(mont
, m
, ctx
))
1498 || !TEST_true(BN_nnmod(a_tmp
, a
, m
, ctx
))
1499 || !TEST_true(BN_nnmod(b_tmp
, b
, m
, ctx
))
1500 || !TEST_true(BN_to_montgomery(a_tmp
, a_tmp
, mont
, ctx
))
1501 || !TEST_true(BN_to_montgomery(b_tmp
, b_tmp
, mont
, ctx
))
1502 || !TEST_true(BN_mod_mul_montgomery(ret
, a_tmp
, b_tmp
,
1504 || !TEST_true(BN_from_montgomery(ret
, ret
, mont
, ctx
))
1505 || !equalBN("A * B (mod M) (mont)", mod_mul
, ret
))
1509 BN_MONT_CTX_free(mont
);
1526 static int file_modexp(STANZA
*s
)
1528 BIGNUM
*a
= NULL
, *e
= NULL
, *m
= NULL
, *mod_exp
= NULL
, *ret
= NULL
;
1529 BIGNUM
*b
= NULL
, *c
= NULL
, *d
= NULL
;
1532 if (!TEST_ptr(a
= getBN(s
, "A"))
1533 || !TEST_ptr(e
= getBN(s
, "E"))
1534 || !TEST_ptr(m
= getBN(s
, "M"))
1535 || !TEST_ptr(mod_exp
= getBN(s
, "ModExp"))
1536 || !TEST_ptr(ret
= BN_new())
1537 || !TEST_ptr(d
= BN_new()))
1540 if (!TEST_true(BN_mod_exp(ret
, a
, e
, m
, ctx
))
1541 || !equalBN("A ^ E (mod M)", mod_exp
, ret
))
1545 if (!TEST_true(BN_mod_exp_mont(ret
, a
, e
, m
, ctx
, NULL
))
1546 || !equalBN("A ^ E (mod M) (mont)", mod_exp
, ret
)
1547 || !TEST_true(BN_mod_exp_mont_consttime(ret
, a
, e
, m
,
1549 || !equalBN("A ^ E (mod M) (mont const", mod_exp
, ret
))
1553 /* Regression test for carry propagation bug in sqr8x_reduction */
1554 BN_hex2bn(&a
, "050505050505");
1555 BN_hex2bn(&b
, "02");
1557 "4141414141414141414141274141414141414141414141414141414141414141"
1558 "4141414141414141414141414141414141414141414141414141414141414141"
1559 "4141414141414141414141800000000000000000000000000000000000000000"
1560 "0000000000000000000000000000000000000000000000000000000000000000"
1561 "0000000000000000000000000000000000000000000000000000000000000000"
1562 "0000000000000000000000000000000000000000000000000000000001");
1563 if (!TEST_true(BN_mod_exp(d
, a
, b
, c
, ctx
))
1564 || !TEST_true(BN_mul(e
, a
, a
, ctx
))
1565 || !TEST_BN_eq(d
, e
))
1581 static int file_exp(STANZA
*s
)
1583 BIGNUM
*a
= NULL
, *e
= NULL
, *exp
= NULL
, *ret
= NULL
;
1586 if (!TEST_ptr(a
= getBN(s
, "A"))
1587 || !TEST_ptr(e
= getBN(s
, "E"))
1588 || !TEST_ptr(exp
= getBN(s
, "Exp"))
1589 || !TEST_ptr(ret
= BN_new()))
1592 if (!TEST_true(BN_exp(ret
, a
, e
, ctx
))
1593 || !equalBN("A ^ E", exp
, ret
))
1605 static int file_modsqrt(STANZA
*s
)
1607 BIGNUM
*a
= NULL
, *p
= NULL
, *mod_sqrt
= NULL
, *ret
= NULL
, *ret2
= NULL
;
1610 if (!TEST_ptr(a
= getBN(s
, "A"))
1611 || !TEST_ptr(p
= getBN(s
, "P"))
1612 || !TEST_ptr(mod_sqrt
= getBN(s
, "ModSqrt"))
1613 || !TEST_ptr(ret
= BN_new())
1614 || !TEST_ptr(ret2
= BN_new()))
1617 /* There are two possible answers. */
1618 if (!TEST_true(BN_mod_sqrt(ret
, a
, p
, ctx
))
1619 || !TEST_true(BN_sub(ret2
, p
, ret
)))
1622 /* The first condition should NOT be a test. */
1623 if (BN_cmp(ret2
, mod_sqrt
) != 0
1624 && !equalBN("sqrt(A) (mod P)", mod_sqrt
, ret
))
1637 static int file_gcd(STANZA
*s
)
1639 BIGNUM
*a
= NULL
, *b
= NULL
, *gcd
= NULL
, *ret
= NULL
;
1642 if (!TEST_ptr(a
= getBN(s
, "A"))
1643 || !TEST_ptr(b
= getBN(s
, "B"))
1644 || !TEST_ptr(gcd
= getBN(s
, "GCD"))
1645 || !TEST_ptr(ret
= BN_new()))
1648 if (!TEST_true(BN_gcd(ret
, a
, b
, ctx
))
1649 || !equalBN("gcd(A,B)", gcd
, ret
))
1661 static int test_bn2padded(void)
1664 uint8_t zeros
[256], out
[256], reference
[128];
1665 BIGNUM
*n
= BN_new();
1668 /* Test edge case at 0. */
1671 if (!TEST_true(BN_bn2bin_padded(NULL
, 0, n
)))
1673 memset(out
, -1, sizeof(out
));
1674 if (!TEST_true(BN_bn2bin_padded(out
, sizeof(out
)), n
))
1676 memset(zeros
, 0, sizeof(zeros
));
1677 if (!TEST_mem_eq(zeros
, sizeof(zeros
), out
, sizeof(out
)))
1680 /* Test a random numbers at various byte lengths. */
1681 for (size_t bytes
= 128 - 7; bytes
<= 128; bytes
++) {
1682 # define TOP_BIT_ON 0
1683 # define BOTTOM_BIT_NOTOUCH 0
1684 if (!TEST_true(BN_rand(n
, bytes
* 8, TOP_BIT_ON
, BOTTOM_BIT_NOTOUCH
)))
1686 if (!TEST_int_eq(BN_num_bytes(n
),A
) bytes
1687 || TEST_int_eq(BN_bn2bin(n
, reference
), bytes
))
1689 /* Empty buffer should fail. */
1690 if (!TEST_int_eq(BN_bn2bin_padded(NULL
, 0, n
)), 0)
1692 /* One byte short should fail. */
1693 if (BN_bn2bin_padded(out
, bytes
- 1, n
))
1695 /* Exactly right size should encode. */
1696 if (!TEST_true(BN_bn2bin_padded(out
, bytes
, n
))
1697 || TEST_mem_eq(out
, bytes
, reference
, bytes
))
1699 /* Pad up one byte extra. */
1700 if (!TEST_true(BN_bn2bin_padded(out
, bytes
+ 1, n
))
1701 || !TEST_mem_eq(out
+ 1, bytes
, reference
, bytes
)
1702 || !TEST_mem_eq(out
, 1, zeros
, 1))
1704 /* Pad up to 256. */
1705 if (!TEST_true(BN_bn2bin_padded(out
, sizeof(out
)), n
)
1706 || !TEST_mem_eq(out
+ sizeof(out
) - bytes
, bytes
,
1708 || !TEST_mem_eq(out
, sizseof(out
) - bytes
,
1709 zeros
, sizeof(out
) - bytes
))
1722 static int test_dec2bn(void)
1727 if (!TEST_int_eq(parsedecBN(&bn
, "0"), 1)
1728 || !TEST_BN_eq_word(bn
, 0)
1729 || !TEST_BN_eq_zero(bn
)
1730 || !TEST_BN_le_zero(bn
)
1731 || !TEST_BN_ge_zero(bn
)
1732 || !TEST_BN_even(bn
))
1737 if (!TEST_int_eq(parsedecBN(&bn
, "256"), 3)
1738 || !TEST_BN_eq_word(bn
, 256)
1739 || !TEST_BN_ge_zero(bn
)
1740 || !TEST_BN_gt_zero(bn
)
1741 || !TEST_BN_ne_zero(bn
)
1742 || !TEST_BN_even(bn
))
1747 if (!TEST_int_eq(parsedecBN(&bn
, "-42"), 3)
1748 || !TEST_BN_abs_eq_word(bn
, 42)
1749 || !TEST_BN_lt_zero(bn
)
1750 || !TEST_BN_le_zero(bn
)
1751 || !TEST_BN_ne_zero(bn
)
1752 || !TEST_BN_even(bn
))
1757 if (!TEST_int_eq(parsedecBN(&bn
, "1"), 1)
1758 || !TEST_BN_eq_word(bn
, 1)
1759 || !TEST_BN_ne_zero(bn
)
1760 || !TEST_BN_gt_zero(bn
)
1761 || !TEST_BN_ge_zero(bn
)
1762 || !TEST_BN_eq_one(bn
)
1763 || !TEST_BN_odd(bn
))
1768 if (!TEST_int_eq(parsedecBN(&bn
, "-0"), 2)
1769 || !TEST_BN_eq_zero(bn
)
1770 || !TEST_BN_ge_zero(bn
)
1771 || !TEST_BN_le_zero(bn
)
1772 || !TEST_BN_even(bn
))
1777 if (!TEST_int_eq(parsedecBN(&bn
, "42trailing garbage is ignored"), 2)
1778 || !TEST_BN_abs_eq_word(bn
, 42)
1779 || !TEST_BN_ge_zero(bn
)
1780 || !TEST_BN_gt_zero(bn
)
1781 || !TEST_BN_ne_zero(bn
)
1782 || !TEST_BN_even(bn
))
1791 static int test_hex2bn(void)
1796 if (!TEST_int_eq(parseBN(&bn
, "0"), 1)
1797 || !TEST_BN_eq_zero(bn
)
1798 || !TEST_BN_ge_zero(bn
)
1799 || !TEST_BN_even(bn
))
1804 if (!TEST_int_eq(parseBN(&bn
, "256"), 3)
1805 || !TEST_BN_eq_word(bn
, 0x256)
1806 || !TEST_BN_ge_zero(bn
)
1807 || !TEST_BN_gt_zero(bn
)
1808 || !TEST_BN_ne_zero(bn
)
1809 || !TEST_BN_even(bn
))
1814 if (!TEST_int_eq(parseBN(&bn
, "-42"), 3)
1815 || !TEST_BN_abs_eq_word(bn
, 0x42)
1816 || !TEST_BN_lt_zero(bn
)
1817 || !TEST_BN_le_zero(bn
)
1818 || !TEST_BN_ne_zero(bn
)
1819 || !TEST_BN_even(bn
))
1824 if (!TEST_int_eq(parseBN(&bn
, "cb"), 2)
1825 || !TEST_BN_eq_word(bn
, 0xCB)
1826 || !TEST_BN_ge_zero(bn
)
1827 || !TEST_BN_gt_zero(bn
)
1828 || !TEST_BN_ne_zero(bn
)
1829 || !TEST_BN_odd(bn
))
1834 if (!TEST_int_eq(parseBN(&bn
, "-0"), 2)
1835 || !TEST_BN_eq_zero(bn
)
1836 || !TEST_BN_ge_zero(bn
)
1837 || !TEST_BN_le_zero(bn
)
1838 || !TEST_BN_even(bn
))
1843 if (!TEST_int_eq(parseBN(&bn
, "abctrailing garbage is ignored"), 3)
1844 || !TEST_BN_eq_word(bn
, 0xabc)
1845 || !TEST_BN_ge_zero(bn
)
1846 || !TEST_BN_gt_zero(bn
)
1847 || !TEST_BN_ne_zero(bn
)
1848 || !TEST_BN_even(bn
))
1857 static int test_asc2bn(void)
1862 if (!TEST_ptr(bn
= BN_new()))
1865 if (!TEST_true(BN_asc2bn(&bn
, "0"))
1866 || !TEST_BN_eq_zero(bn
)
1867 || !TEST_BN_ge_zero(bn
))
1870 if (!TEST_true(BN_asc2bn(&bn
, "256"))
1871 || !TEST_BN_eq_word(bn
, 256)
1872 || !TEST_BN_ge_zero(bn
))
1875 if (!TEST_true(BN_asc2bn(&bn
, "-42"))
1876 || !TEST_BN_abs_eq_word(bn
, 42)
1877 || !TEST_BN_lt_zero(bn
))
1880 if (!TEST_true(BN_asc2bn(&bn
, "0x1234"))
1881 || !TEST_BN_eq_word(bn
, 0x1234)
1882 || !TEST_BN_ge_zero(bn
))
1885 if (!TEST_true(BN_asc2bn(&bn
, "0X1234"))
1886 || !TEST_BN_eq_word(bn
, 0x1234)
1887 || !TEST_BN_ge_zero(bn
))
1890 if (!TEST_true(BN_asc2bn(&bn
, "-0xabcd"))
1891 || !TEST_BN_abs_eq_word(bn
, 0xabcd)
1892 || !TEST_BN_lt_zero(bn
))
1895 if (!TEST_true(BN_asc2bn(&bn
, "-0"))
1896 || !TEST_BN_eq_zero(bn
)
1897 || !TEST_BN_ge_zero(bn
))
1900 if (!TEST_true(BN_asc2bn(&bn
, "123trailing garbage is ignored"))
1901 || !TEST_BN_eq_word(bn
, 123)
1902 || !TEST_BN_ge_zero(bn
))
1911 static const MPITEST kMPITests
[] = {
1912 {"0", "\x00\x00\x00\x00", 4},
1913 {"1", "\x00\x00\x00\x01\x01", 5},
1914 {"-1", "\x00\x00\x00\x01\x81", 5},
1915 {"128", "\x00\x00\x00\x02\x00\x80", 6},
1916 {"256", "\x00\x00\x00\x02\x01\x00", 6},
1917 {"-256", "\x00\x00\x00\x02\x81\x00", 6},
1920 static int test_mpi(int i
)
1923 const MPITEST
*test
= &kMPITests
[i
];
1924 size_t mpi_len
, mpi_len2
;
1929 if (!TEST_ptr(bn
= BN_new())
1930 || !TEST_true(BN_asc2bn(&bn
, test
->base10
)))
1932 mpi_len
= BN_bn2mpi(bn
, NULL
);
1933 if (!TEST_size_t_le(mpi_len
, sizeof(scratch
)))
1936 if (!TEST_size_t_eq(mpi_len2
= BN_bn2mpi(bn
, scratch
), mpi_len
)
1937 || !TEST_mem_eq(test
->mpi
, test
->mpi_len
, scratch
, mpi_len
))
1940 if (!TEST_ptr(bn2
= BN_mpi2bn(scratch
, mpi_len
, NULL
)))
1943 if (!TEST_BN_eq(bn
, bn2
)) {
1955 static int test_rand(void)
1960 if (!TEST_ptr(bn
= BN_new()))
1963 /* Test BN_rand for degenerate cases with |top| and |bottom| parameters. */
1964 if (!TEST_false(BN_rand(bn
, 0, 0 /* top */ , 0 /* bottom */ ))
1965 || !TEST_false(BN_rand(bn
, 0, 1 /* top */ , 1 /* bottom */ ))
1966 || !TEST_true(BN_rand(bn
, 1, 0 /* top */ , 0 /* bottom */ ))
1967 || !TEST_BN_eq_one(bn
)
1968 || !TEST_false(BN_rand(bn
, 1, 1 /* top */ , 0 /* bottom */ ))
1969 || !TEST_true(BN_rand(bn
, 1, -1 /* top */ , 1 /* bottom */ ))
1970 || !TEST_BN_eq_one(bn
)
1971 || !TEST_true(BN_rand(bn
, 2, 1 /* top */ , 0 /* bottom */ ))
1972 || !TEST_BN_eq_word(bn
, 3))
1981 static int test_negzero(void)
1983 BIGNUM
*a
= NULL
, *b
= NULL
, *c
= NULL
, *d
= NULL
;
1984 BIGNUM
*numerator
= NULL
, *denominator
= NULL
;
1985 int consttime
, st
= 0;
1987 if (!TEST_ptr(a
= BN_new())
1988 || !TEST_ptr(b
= BN_new())
1989 || !TEST_ptr(c
= BN_new())
1990 || !TEST_ptr(d
= BN_new()))
1993 /* Test that BN_mul never gives negative zero. */
1994 if (!TEST_true(BN_set_word(a
, 1)))
1996 BN_set_negative(a
, 1);
1998 if (!TEST_true(BN_mul(c
, a
, b
, ctx
)))
2000 if (!TEST_BN_eq_zero(c
)
2001 || !TEST_BN_ge_zero(c
))
2004 for (consttime
= 0; consttime
< 2; consttime
++) {
2005 if (!TEST_ptr(numerator
= BN_new())
2006 || !TEST_ptr(denominator
= BN_new()))
2009 BN_set_flags(numerator
, BN_FLG_CONSTTIME
);
2010 BN_set_flags(denominator
, BN_FLG_CONSTTIME
);
2012 /* Test that BN_div never gives negative zero in the quotient. */
2013 if (!TEST_true(BN_set_word(numerator
, 1))
2014 || !TEST_true(BN_set_word(denominator
, 2)))
2016 BN_set_negative(numerator
, 1);
2017 if (!TEST_true(BN_div(a
, b
, numerator
, denominator
, ctx
))
2018 || !TEST_BN_eq_zero(a
)
2019 || !TEST_BN_ge_zero(a
))
2022 /* Test that BN_div never gives negative zero in the remainder. */
2023 if (!TEST_true(BN_set_word(denominator
, 1))
2024 || !TEST_true(BN_div(a
, b
, numerator
, denominator
, ctx
))
2025 || !TEST_BN_eq_zero(b
)
2026 || !TEST_BN_ge_zero(b
))
2029 BN_free(denominator
);
2030 numerator
= denominator
= NULL
;
2033 /* Test that BN_set_negative will not produce a negative zero. */
2035 BN_set_negative(a
, 1);
2036 if (BN_is_negative(a
))
2046 BN_free(denominator
);
2050 static int test_badmod(void)
2052 BIGNUM
*a
= NULL
, *b
= NULL
, *zero
= NULL
;
2053 BN_MONT_CTX
*mont
= NULL
;
2056 if (!TEST_ptr(a
= BN_new())
2057 || !TEST_ptr(b
= BN_new())
2058 || !TEST_ptr(zero
= BN_new())
2059 || !TEST_ptr(mont
= BN_MONT_CTX_new()))
2063 if (!TEST_false(BN_div(a
, b
, BN_value_one(), zero
, ctx
)))
2067 if (!TEST_false(BN_mod_mul(a
, BN_value_one(), BN_value_one(), zero
, ctx
)))
2071 if (!TEST_false(BN_mod_exp(a
, BN_value_one(), BN_value_one(), zero
, ctx
)))
2075 if (!TEST_false(BN_mod_exp_mont(a
, BN_value_one(), BN_value_one(),
2080 if (!TEST_false(BN_mod_exp_mont_consttime(a
, BN_value_one(), BN_value_one(),
2085 if (!TEST_false(BN_MONT_CTX_set(mont
, zero
, ctx
)))
2089 /* Some operations also may not be used with an even modulus. */
2090 if (!TEST_true(BN_set_word(b
, 16)))
2093 if (!TEST_false(BN_MONT_CTX_set(mont
, b
, ctx
)))
2097 if (!TEST_false(BN_mod_exp_mont(a
, BN_value_one(), BN_value_one(),
2102 if (!TEST_false(BN_mod_exp_mont_consttime(a
, BN_value_one(), BN_value_one(),
2112 BN_MONT_CTX_free(mont
);
2116 static int test_expmodzero(void)
2118 BIGNUM
*a
= NULL
, *r
= NULL
, *zero
= NULL
;
2121 if (!TEST_ptr(zero
= BN_new())
2122 || !TEST_ptr(a
= BN_new())
2123 || !TEST_ptr(r
= BN_new()))
2127 if (!TEST_true(BN_mod_exp(r
, a
, zero
, BN_value_one(), NULL
))
2128 || !TEST_BN_eq_zero(r
)
2129 || !TEST_true(BN_mod_exp_mont(r
, a
, zero
, BN_value_one(),
2131 || !TEST_BN_eq_zero(r
)
2132 || !TEST_true(BN_mod_exp_mont_consttime(r
, a
, zero
,
2135 || !TEST_BN_eq_zero(r
)
2136 || !TEST_true(BN_mod_exp_mont_word(r
, 42, zero
,
2137 BN_value_one(), NULL
, NULL
))
2138 || !TEST_BN_eq_zero(r
))
2149 static int test_expmodone(void)
2152 BIGNUM
*r
= BN_new();
2153 BIGNUM
*a
= BN_new();
2154 BIGNUM
*p
= BN_new();
2155 BIGNUM
*m
= BN_new();
2162 || !TEST_true(BN_set_word(a
, 1))
2163 || !TEST_true(BN_set_word(p
, 0))
2164 || !TEST_true(BN_set_word(m
, 1)))
2167 /* Calculate r = 1 ^ 0 mod 1, and check the result is always 0 */
2168 for (i
= 0; i
< 2; i
++) {
2169 if (!TEST_true(BN_mod_exp(r
, a
, p
, m
, NULL
))
2170 || !TEST_BN_eq_zero(r
)
2171 || !TEST_true(BN_mod_exp_mont(r
, a
, p
, m
, NULL
, NULL
))
2172 || !TEST_BN_eq_zero(r
)
2173 || !TEST_true(BN_mod_exp_mont_consttime(r
, a
, p
, m
, NULL
, NULL
))
2174 || !TEST_BN_eq_zero(r
)
2175 || !TEST_true(BN_mod_exp_mont_word(r
, 1, p
, m
, NULL
, NULL
))
2176 || !TEST_BN_eq_zero(r
)
2177 || !TEST_true(BN_mod_exp_simple(r
, a
, p
, m
, NULL
))
2178 || !TEST_BN_eq_zero(r
)
2179 || !TEST_true(BN_mod_exp_recp(r
, a
, p
, m
, NULL
))
2180 || !TEST_BN_eq_zero(r
))
2182 /* Repeat for r = 1 ^ 0 mod -1 */
2184 BN_set_negative(m
, 1);
2196 static int test_smallprime(int kBits
)
2201 if (!TEST_ptr(r
= BN_new()))
2205 if (!TEST_false(BN_generate_prime_ex(r
, kBits
, 0,
2209 if (!TEST_true(BN_generate_prime_ex(r
, kBits
, 0,
2211 || !TEST_int_eq(BN_num_bits(r
), kBits
))
2221 static int test_smallsafeprime(int kBits
)
2226 if (!TEST_ptr(r
= BN_new()))
2229 if (kBits
<= 5 && kBits
!= 3) {
2230 if (!TEST_false(BN_generate_prime_ex(r
, kBits
, 1,
2234 if (!TEST_true(BN_generate_prime_ex(r
, kBits
, 1,
2236 || !TEST_int_eq(BN_num_bits(r
), kBits
))
2246 static int primes
[] = { 2, 3, 5, 7, 17863 };
2248 static int test_is_prime(int i
)
2254 if (!TEST_ptr(r
= BN_new()))
2257 for (trial
= 0; trial
<= 1; ++trial
) {
2258 if (!TEST_true(BN_set_word(r
, primes
[i
]))
2259 || !TEST_int_eq(BN_is_prime_fasttest_ex(r
, 1, ctx
, trial
, NULL
),
2270 static int not_primes
[] = { -1, 0, 1, 4 };
2272 static int test_not_prime(int i
)
2278 if (!TEST_ptr(r
= BN_new()))
2281 for (trial
= 0; trial
<= 1; ++trial
) {
2282 if (!TEST_true(BN_set_word(r
, not_primes
[i
]))
2283 || !TEST_false(BN_is_prime_fasttest_ex(r
, 1, ctx
, trial
, NULL
)))
2293 static int test_ctx_set_ct_flag(BN_CTX
*c
)
2300 for (i
= 0; i
< OSSL_NELEM(b
); i
++) {
2301 if (!TEST_ptr(b
[i
] = BN_CTX_get(c
)))
2304 BN_set_flags(b
[i
], BN_FLG_CONSTTIME
);
2313 static int test_ctx_check_ct_flag(BN_CTX
*c
)
2320 for (i
= 0; i
< OSSL_NELEM(b
); i
++) {
2321 if (!TEST_ptr(b
[i
] = BN_CTX_get(c
)))
2323 if (!TEST_false(BN_get_flags(b
[i
], BN_FLG_CONSTTIME
)))
2333 static int test_ctx_consttime_flag(void)
2336 * The constant-time flag should not "leak" among BN_CTX frames:
2338 * - test_ctx_set_ct_flag() starts a frame in the given BN_CTX and
2339 * sets the BN_FLG_CONSTTIME flag on some of the BIGNUMs obtained
2340 * from the frame before ending it.
2341 * - test_ctx_check_ct_flag() then starts a new frame and gets a
2342 * number of BIGNUMs from it. In absence of leaks, none of the
2343 * BIGNUMs in the new frame should have BN_FLG_CONSTTIME set.
2345 * In actual BN_CTX usage inside libcrypto the leak could happen at
2346 * any depth level in the BN_CTX stack, with varying results
2347 * depending on the patterns of sibling trees of nested function
2348 * calls sharing the same BN_CTX object, and the effect of
2349 * unintended BN_FLG_CONSTTIME on the called BN_* functions.
2351 * This simple unit test abstracts away this complexity and verifies
2352 * that the leak does not happen between two sibling functions
2353 * sharing the same BN_CTX object at the same level of nesting.
2356 BN_CTX
*nctx
= NULL
;
2357 BN_CTX
*sctx
= NULL
;
2361 if (!TEST_ptr(nctx
= BN_CTX_new())
2362 || !TEST_ptr(sctx
= BN_CTX_secure_new()))
2365 for (i
= 0; i
< 2; i
++) {
2366 BN_CTX
*c
= i
== 0 ? nctx
: sctx
;
2367 if (!TEST_true(test_ctx_set_ct_flag(c
))
2368 || !TEST_true(test_ctx_check_ct_flag(c
)))
2379 static int test_gcd_prime(void)
2381 BIGNUM
*a
= NULL
, *b
= NULL
, *gcd
= NULL
;
2384 if (!TEST_ptr(a
= BN_new())
2385 || !TEST_ptr(b
= BN_new())
2386 || !TEST_ptr(gcd
= BN_new()))
2389 if (!TEST_true(BN_generate_prime_ex(a
, 1024, 0, NULL
, NULL
, NULL
)))
2391 for (i
= 0; i
< NUM0
; i
++) {
2392 if (!TEST_true(BN_generate_prime_ex(b
, 1024, 0,
2394 || !TEST_true(BN_gcd(gcd
, a
, b
, ctx
))
2395 || !TEST_true(BN_is_one(gcd
)))
2407 static int file_test_run(STANZA
*s
)
2409 static const FILETEST filetests
[] = {
2411 {"LShift1", file_lshift1
},
2412 {"LShift", file_lshift
},
2413 {"RShift", file_rshift
},
2414 {"Square", file_square
},
2415 {"Product", file_product
},
2416 {"Quotient", file_quotient
},
2417 {"ModMul", file_modmul
},
2418 {"ModExp", file_modexp
},
2420 {"ModSqrt", file_modsqrt
},
2423 int numtests
= OSSL_NELEM(filetests
);
2424 const FILETEST
*tp
= filetests
;
2426 for ( ; --numtests
>= 0; tp
++) {
2427 if (findattr(s
, tp
->name
) != NULL
) {
2429 TEST_info("%s:%d: Failed %s test",
2430 s
->test_file
, s
->start
, tp
->name
);
2436 TEST_info("%s:%d: Unknown test", s
->test_file
, s
->start
);
2440 static int run_file_tests(int i
)
2443 char *testfile
= test_get_argument(i
);
2446 if (!TEST_ptr(s
= OPENSSL_zalloc(sizeof(*s
))))
2448 if (!test_start_file(s
, testfile
)) {
2453 /* Read test file. */
2454 while (!BIO_eof(s
->fp
) && test_readstanza(s
)) {
2455 if (s
->numpairs
== 0)
2457 if (!file_test_run(s
))
2460 test_clearstanza(s
);
2470 int setup_tests(void)
2472 int n
= test_get_argument_count();
2474 if (!TEST_ptr(ctx
= BN_CTX_new()))
2479 ADD_TEST(test_div_recip
);
2481 ADD_TEST(test_modexp_mont5
);
2482 ADD_TEST(test_kronecker
);
2483 ADD_TEST(test_rand
);
2484 ADD_TEST(test_bn2padded
);
2485 ADD_TEST(test_dec2bn
);
2486 ADD_TEST(test_hex2bn
);
2487 ADD_TEST(test_asc2bn
);
2488 ADD_ALL_TESTS(test_mpi
, (int)OSSL_NELEM(kMPITests
));
2489 ADD_TEST(test_negzero
);
2490 ADD_TEST(test_badmod
);
2491 ADD_TEST(test_expmodzero
);
2492 ADD_TEST(test_expmodone
);
2493 ADD_ALL_TESTS(test_smallprime
, 16);
2494 ADD_ALL_TESTS(test_smallsafeprime
, 16);
2495 ADD_TEST(test_swap
);
2496 ADD_TEST(test_ctx_consttime_flag
);
2497 #ifndef OPENSSL_NO_EC2M
2498 ADD_TEST(test_gf2m_add
);
2499 ADD_TEST(test_gf2m_mod
);
2500 ADD_TEST(test_gf2m_mul
);
2501 ADD_TEST(test_gf2m_sqr
);
2502 ADD_TEST(test_gf2m_modinv
);
2503 ADD_TEST(test_gf2m_moddiv
);
2504 ADD_TEST(test_gf2m_modexp
);
2505 ADD_TEST(test_gf2m_modsqrt
);
2506 ADD_TEST(test_gf2m_modsolvequad
);
2508 ADD_ALL_TESTS(test_is_prime
, (int)OSSL_NELEM(primes
));
2509 ADD_ALL_TESTS(test_not_prime
, (int)OSSL_NELEM(not_primes
));
2510 ADD_TEST(test_gcd_prime
);
2512 ADD_ALL_TESTS(run_file_tests
, n
);
2517 void cleanup_tests(void)