2 * Copyright 1995-2022 The OpenSSL Project Authors. All Rights Reserved.
4 * Licensed under the Apache License 2.0 (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
14 # include <strings.h> /* strcasecmp */
18 #include <openssl/bn.h>
19 #include <openssl/crypto.h>
20 #include <openssl/err.h>
21 #include <openssl/rand.h>
22 #include "internal/nelem.h"
23 #include "internal/numbers.h"
27 * Things in boring, not in openssl.
29 #define HAVE_BN_SQRT 0
31 typedef struct filetest_st {
33 int (*func)(STANZA *s);
36 typedef struct mpitest_st {
42 static const int NUM0 = 100; /* number of tests */
43 static const int NUM1 = 50; /* additional tests for some functions */
44 static const int NUM_PRIME_TESTS = 20;
48 * Polynomial coefficients used in GFM tests.
50 #ifndef OPENSSL_NO_EC2M
51 static int p0[] = { 163, 7, 6, 3, 0, -1 };
52 static int p1[] = { 193, 15, 0, -1 };
56 * Look for |key| in the stanza and return it or NULL if not found.
58 static const char *findattr(STANZA *s, const char *key)
63 for ( ; --i >= 0; pp++)
64 if (OPENSSL_strcasecmp(pp->key, key) == 0)
70 * Parse BIGNUM from sparse hex-strings, return |BN_hex2bn| result.
72 static int parse_bigBN(BIGNUM **out, const char *bn_strings[])
74 char *bigstring = glue_strings(bn_strings, NULL);
75 int ret = BN_hex2bn(out, bigstring);
77 OPENSSL_free(bigstring);
82 * Parse BIGNUM, return number of bytes parsed.
84 static int parseBN(BIGNUM **out, const char *in)
87 return BN_hex2bn(out, in);
90 static int parsedecBN(BIGNUM **out, const char *in)
93 return BN_dec2bn(out, in);
96 static BIGNUM *getBN(STANZA *s, const char *attribute)
101 if ((hex = findattr(s, attribute)) == NULL) {
102 TEST_error("%s:%d: Can't find %s", s->test_file, s->start, attribute);
106 if (parseBN(&ret, hex) != (int)strlen(hex)) {
107 TEST_error("Could not decode '%s'", hex);
113 static int getint(STANZA *s, int *out, const char *attribute)
119 if (!TEST_ptr(ret = getBN(s, attribute))
120 || !TEST_ulong_le(word = BN_get_word(ret), INT_MAX))
130 static int equalBN(const char *op, const BIGNUM *expected, const BIGNUM *actual)
132 if (BN_cmp(expected, actual) == 0)
135 TEST_error("unexpected %s value", op);
136 TEST_BN_eq(expected, actual);
141 * Return a "random" flag for if a BN should be negated.
143 static int rand_neg(void)
145 static unsigned int neg = 0;
146 static int sign[8] = { 0, 0, 0, 1, 1, 0, 1, 1 };
148 return sign[(neg++) % 8];
151 static int test_swap(void)
153 BIGNUM *a = NULL, *b = NULL, *c = NULL, *d = NULL;
154 int top, cond, st = 0;
156 if (!TEST_ptr(a = BN_new())
157 || !TEST_ptr(b = BN_new())
158 || !TEST_ptr(c = BN_new())
159 || !TEST_ptr(d = BN_new()))
162 if (!(TEST_true(BN_bntest_rand(a, 1024, 1, 0))
163 && TEST_true(BN_bntest_rand(b, 1024, 1, 0))
164 && TEST_ptr(BN_copy(c, a))
165 && TEST_ptr(BN_copy(d, b))))
167 top = BN_num_bits(a) / BN_BITS2;
171 if (!equalBN("swap", a, d)
172 || !equalBN("swap", b, c))
175 /* regular swap: same pointer */
177 if (!equalBN("swap with same pointer", a, d))
180 /* conditional swap: true */
182 BN_consttime_swap(cond, a, b, top);
183 if (!equalBN("cswap true", a, c)
184 || !equalBN("cswap true", b, d))
187 /* conditional swap: true, same pointer */
188 BN_consttime_swap(cond, a, a, top);
189 if (!equalBN("cswap true", a, c))
192 /* conditional swap: false */
194 BN_consttime_swap(cond, a, b, top);
195 if (!equalBN("cswap false", a, c)
196 || !equalBN("cswap false", b, d))
199 /* conditional swap: false, same pointer */
200 BN_consttime_swap(cond, a, a, top);
201 if (!equalBN("cswap false", a, c))
204 /* same tests but checking flag swap */
205 BN_set_flags(a, BN_FLG_CONSTTIME);
208 if (!equalBN("swap, flags", a, d)
209 || !equalBN("swap, flags", b, c)
210 || !TEST_true(BN_get_flags(b, BN_FLG_CONSTTIME))
211 || !TEST_false(BN_get_flags(a, BN_FLG_CONSTTIME)))
215 BN_consttime_swap(cond, a, b, top);
216 if (!equalBN("cswap true, flags", a, c)
217 || !equalBN("cswap true, flags", b, d)
218 || !TEST_true(BN_get_flags(a, BN_FLG_CONSTTIME))
219 || !TEST_false(BN_get_flags(b, BN_FLG_CONSTTIME)))
223 BN_consttime_swap(cond, a, b, top);
224 if (!equalBN("cswap false, flags", a, c)
225 || !equalBN("cswap false, flags", b, d)
226 || !TEST_true(BN_get_flags(a, BN_FLG_CONSTTIME))
227 || !TEST_false(BN_get_flags(b, BN_FLG_CONSTTIME)))
239 static int test_sub(void)
241 BIGNUM *a = NULL, *b = NULL, *c = NULL;
244 if (!TEST_ptr(a = BN_new())
245 || !TEST_ptr(b = BN_new())
246 || !TEST_ptr(c = BN_new()))
249 for (i = 0; i < NUM0 + NUM1; i++) {
251 if (!(TEST_true(BN_bntest_rand(a, 512, 0, 0)))
252 && TEST_ptr(BN_copy(b, a))
253 && TEST_int_ne(BN_set_bit(a, i), 0)
254 && TEST_true(BN_add_word(b, i)))
257 if (!TEST_true(BN_bntest_rand(b, 400 + i - NUM1, 0, 0)))
259 BN_set_negative(a, rand_neg());
260 BN_set_negative(b, rand_neg());
262 if (!(TEST_true(BN_sub(c, a, b))
263 && TEST_true(BN_add(c, c, b))
264 && TEST_true(BN_sub(c, c, a))
265 && TEST_BN_eq_zero(c)))
276 static int test_div_recip(void)
278 BIGNUM *a = NULL, *b = NULL, *c = NULL, *d = NULL, *e = NULL;
279 BN_RECP_CTX *recp = NULL;
282 if (!TEST_ptr(a = BN_new())
283 || !TEST_ptr(b = BN_new())
284 || !TEST_ptr(c = BN_new())
285 || !TEST_ptr(d = BN_new())
286 || !TEST_ptr(e = BN_new())
287 || !TEST_ptr(recp = BN_RECP_CTX_new()))
290 for (i = 0; i < NUM0 + NUM1; i++) {
292 if (!(TEST_true(BN_bntest_rand(a, 400, 0, 0))
293 && TEST_ptr(BN_copy(b, a))
294 && TEST_true(BN_lshift(a, a, i))
295 && TEST_true(BN_add_word(a, i))))
298 if (!(TEST_true(BN_bntest_rand(b, 50 + 3 * (i - NUM1), 0, 0))))
301 BN_set_negative(a, rand_neg());
302 BN_set_negative(b, rand_neg());
303 if (!(TEST_true(BN_RECP_CTX_set(recp, b, ctx))
304 && TEST_true(BN_div_recp(d, c, a, recp, ctx))
305 && TEST_true(BN_mul(e, d, b, ctx))
306 && TEST_true(BN_add(d, e, c))
307 && TEST_true(BN_sub(d, d, a))
308 && TEST_BN_eq_zero(d)))
318 BN_RECP_CTX_free(recp);
323 int n, divisor, result, remainder;
324 } signed_mod_tests[] = {
331 static BIGNUM *set_signed_bn(int value)
333 BIGNUM *bn = BN_new();
337 if (!BN_set_word(bn, value < 0 ? -value : value)) {
341 BN_set_negative(bn, value < 0);
345 static int test_signed_mod_replace_ab(int n)
347 BIGNUM *a = NULL, *b = NULL, *c = NULL, *d = NULL;
350 if (!TEST_ptr(a = set_signed_bn(signed_mod_tests[n].n))
351 || !TEST_ptr(b = set_signed_bn(signed_mod_tests[n].divisor))
352 || !TEST_ptr(c = set_signed_bn(signed_mod_tests[n].result))
353 || !TEST_ptr(d = set_signed_bn(signed_mod_tests[n].remainder)))
356 if (TEST_true(BN_div(a, b, a, b, ctx))
368 static int test_signed_mod_replace_ba(int n)
370 BIGNUM *a = NULL, *b = NULL, *c = NULL, *d = NULL;
373 if (!TEST_ptr(a = set_signed_bn(signed_mod_tests[n].n))
374 || !TEST_ptr(b = set_signed_bn(signed_mod_tests[n].divisor))
375 || !TEST_ptr(c = set_signed_bn(signed_mod_tests[n].result))
376 || !TEST_ptr(d = set_signed_bn(signed_mod_tests[n].remainder)))
379 if (TEST_true(BN_div(b, a, a, b, ctx))
391 static int test_mod(void)
393 BIGNUM *a = NULL, *b = NULL, *c = NULL, *d = NULL, *e = NULL;
396 if (!TEST_ptr(a = BN_new())
397 || !TEST_ptr(b = BN_new())
398 || !TEST_ptr(c = BN_new())
399 || !TEST_ptr(d = BN_new())
400 || !TEST_ptr(e = BN_new()))
403 if (!(TEST_true(BN_bntest_rand(a, 1024, 0, 0))))
405 for (i = 0; i < NUM0; i++) {
406 if (!(TEST_true(BN_bntest_rand(b, 450 + i * 10, 0, 0))))
408 BN_set_negative(a, rand_neg());
409 BN_set_negative(b, rand_neg());
410 if (!(TEST_true(BN_mod(c, a, b, ctx))
411 && TEST_true(BN_div(d, e, a, b, ctx))
413 && TEST_true(BN_mul(c, d, b, ctx))
414 && TEST_true(BN_add(d, c, e))
415 && TEST_BN_eq(d, a)))
428 static const char *bn1strings[] = {
429 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
430 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
431 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
432 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
433 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
434 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
435 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
436 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000000000FFFFFFFF00",
437 "0000000000000000000000000000000000000000000000000000000000000000",
438 "0000000000000000000000000000000000000000000000000000000000000000",
439 "0000000000000000000000000000000000000000000000000000000000000000",
440 "0000000000000000000000000000000000000000000000000000000000000000",
441 "0000000000000000000000000000000000000000000000000000000000000000",
442 "0000000000000000000000000000000000000000000000000000000000000000",
443 "0000000000000000000000000000000000000000000000000000000000000000",
444 "00000000000000000000000000000000000000000000000000FFFFFFFFFFFFFF",
448 static const char *bn2strings[] = {
449 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
450 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
451 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
452 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
453 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
454 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
455 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
456 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00000000000000FFFFFFFF0000000000",
457 "0000000000000000000000000000000000000000000000000000000000000000",
458 "0000000000000000000000000000000000000000000000000000000000000000",
459 "0000000000000000000000000000000000000000000000000000000000000000",
460 "0000000000000000000000000000000000000000000000000000000000000000",
461 "0000000000000000000000000000000000000000000000000000000000000000",
462 "0000000000000000000000000000000000000000000000000000000000000000",
463 "0000000000000000000000000000000000000000000000000000000000000000",
464 "000000000000000000000000000000000000000000FFFFFFFFFFFFFF00000000",
469 * Test constant-time modular exponentiation with 1024-bit inputs, which on
470 * x86_64 cause a different code branch to be taken.
472 static int test_modexp_mont5(void)
474 BIGNUM *a = NULL, *p = NULL, *m = NULL, *d = NULL, *e = NULL;
475 BIGNUM *b = NULL, *n = NULL, *c = NULL;
476 BN_MONT_CTX *mont = NULL;
479 if (!TEST_ptr(a = BN_new())
480 || !TEST_ptr(p = BN_new())
481 || !TEST_ptr(m = BN_new())
482 || !TEST_ptr(d = BN_new())
483 || !TEST_ptr(e = BN_new())
484 || !TEST_ptr(b = BN_new())
485 || !TEST_ptr(n = BN_new())
486 || !TEST_ptr(c = BN_new())
487 || !TEST_ptr(mont = BN_MONT_CTX_new()))
490 /* must be odd for montgomery */
491 if (!(TEST_true(BN_bntest_rand(m, 1024, 0, 1))
493 && TEST_true(BN_bntest_rand(a, 1024, 0, 0))))
497 if (!TEST_true(BN_mod_exp_mont_consttime(d, a, p, m, ctx, NULL)))
499 if (!TEST_BN_eq_one(d))
502 /* Regression test for carry bug in mulx4x_mont */
503 if (!(TEST_true(BN_hex2bn(&a,
504 "7878787878787878787878787878787878787878787878787878787878787878"
505 "7878787878787878787878787878787878787878787878787878787878787878"
506 "7878787878787878787878787878787878787878787878787878787878787878"
507 "7878787878787878787878787878787878787878787878787878787878787878"))
508 && TEST_true(BN_hex2bn(&b,
509 "095D72C08C097BA488C5E439C655A192EAFB6380073D8C2664668EDDB4060744"
510 "E16E57FB4EDB9AE10A0CEFCDC28A894F689A128379DB279D48A2E20849D68593"
511 "9B7803BCF46CEBF5C533FB0DD35B080593DE5472E3FE5DB951B8BFF9B4CB8F03"
512 "9CC638A5EE8CDD703719F8000E6A9F63BEED5F2FCD52FF293EA05A251BB4AB81"))
513 && TEST_true(BN_hex2bn(&n,
514 "D78AF684E71DB0C39CFF4E64FB9DB567132CB9C50CC98009FEB820B26F2DED9B"
515 "91B9B5E2B83AE0AE4EB4E0523CA726BFBE969B89FD754F674CE99118C3F2D1C5"
516 "D81FDC7C54E02B60262B241D53C040E99E45826ECA37A804668E690E1AFC1CA4"
517 "2C9A15D84D4954425F0B7642FC0BD9D7B24E2618D2DCC9B729D944BADACFDDAF"))))
520 if (!(TEST_true(BN_MONT_CTX_set(mont, n, ctx))
521 && TEST_true(BN_mod_mul_montgomery(c, a, b, mont, ctx))
522 && TEST_true(BN_mod_mul_montgomery(d, b, a, mont, ctx))
523 && TEST_BN_eq(c, d)))
526 /* Regression test for carry bug in sqr[x]8x_mont */
527 if (!(TEST_true(parse_bigBN(&n, bn1strings))
528 && TEST_true(parse_bigBN(&a, bn2strings))))
531 if (!(TEST_ptr(b = BN_dup(a))
532 && TEST_true(BN_MONT_CTX_set(mont, n, ctx))
533 && TEST_true(BN_mod_mul_montgomery(c, a, a, mont, ctx))
534 && TEST_true(BN_mod_mul_montgomery(d, a, b, mont, ctx))
535 && TEST_BN_eq(c, d)))
538 /* Regression test for carry bug in bn_sqrx8x_internal */
540 static const char *ahex[] = {
541 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
542 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
543 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
544 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
545 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF8FFEADBCFC4DAE7FFF908E92820306B",
546 "9544D954000000006C0000000000000000000000000000000000000000000000",
547 "00000000000000000000FF030202FFFFF8FFEBDBCFC4DAE7FFF908E92820306B",
548 "9544D954000000006C000000FF0302030000000000FFFFFFFFFFFFFFFFFFFFFF",
549 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF01FC00FF02FFFFFFFF",
550 "00FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF00FCFD",
551 "FCFFFFFFFFFF000000000000000000FF0302030000000000FFFFFFFFFFFFFFFF",
552 "FF00FCFDFDFF030202FF00000000FFFFFFFFFFFFFFFFFF00FCFDFCFFFFFFFFFF",
555 static const char *nhex[] = {
556 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
557 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
558 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
559 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
560 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF8F8F8F8000000",
561 "00000010000000006C0000000000000000000000000000000000000000000000",
562 "00000000000000000000000000000000000000FFFFFFFFFFFFF8F8F8F8000000",
563 "00000010000000006C000000000000000000000000FFFFFFFFFFFFFFFFFFFFFF",
564 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
565 "00FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
566 "FFFFFFFFFFFF000000000000000000000000000000000000FFFFFFFFFFFFFFFF",
567 "FFFFFFFFFFFFFFFFFFFF00000000FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF",
571 if (!(TEST_true(parse_bigBN(&a, ahex))
572 && TEST_true(parse_bigBN(&n, nhex))))
576 if (!(TEST_ptr(b = BN_dup(a))
577 && TEST_true(BN_MONT_CTX_set(mont, n, ctx))))
580 if (!TEST_true(BN_mod_mul_montgomery(c, a, a, mont, ctx))
581 || !TEST_true(BN_mod_mul_montgomery(d, a, b, mont, ctx))
582 || !TEST_BN_eq(c, d))
585 /* Regression test for bug in BN_from_montgomery_word */
586 if (!(TEST_true(BN_hex2bn(&a,
587 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
588 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
589 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"))
590 && TEST_true(BN_hex2bn(&n,
591 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
592 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"))
593 && TEST_true(BN_MONT_CTX_set(mont, n, ctx))
594 && TEST_false(BN_mod_mul_montgomery(d, a, a, mont, ctx))))
597 /* Regression test for bug in rsaz_1024_mul_avx2 */
598 if (!(TEST_true(BN_hex2bn(&a,
599 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
600 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
601 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
602 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF2020202020DF"))
603 && TEST_true(BN_hex2bn(&b,
604 "2020202020202020202020202020202020202020202020202020202020202020"
605 "2020202020202020202020202020202020202020202020202020202020202020"
606 "20202020202020FF202020202020202020202020202020202020202020202020"
607 "2020202020202020202020202020202020202020202020202020202020202020"))
608 && TEST_true(BN_hex2bn(&n,
609 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
610 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
611 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
612 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF2020202020FF"))
613 && TEST_true(BN_MONT_CTX_set(mont, n, ctx))
614 && TEST_true(BN_mod_exp_mont_consttime(c, a, b, n, ctx, mont))
615 && TEST_true(BN_mod_exp_mont(d, a, b, n, ctx, mont))
616 && TEST_BN_eq(c, d)))
620 * rsaz_1024_mul_avx2 expects fully-reduced inputs.
621 * BN_mod_exp_mont_consttime should reduce the input first.
623 if (!(TEST_true(BN_hex2bn(&a,
624 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
625 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
626 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
627 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF2020202020DF"))
628 && TEST_true(BN_hex2bn(&b,
629 "1FA53F26F8811C58BE0357897AA5E165693230BC9DF5F01DFA6A2D59229EC69D"
630 "9DE6A89C36E3B6957B22D6FAAD5A3C73AE587B710DBE92E83D3A9A3339A085CB"
631 "B58F508CA4F837924BB52CC1698B7FDC2FD74362456A595A5B58E38E38E38E38"
632 "E38E38E38E38E38E38E38E38E38E38E38E38E38E38E38E38E38E38E38E38E38E"))
633 && TEST_true(BN_hex2bn(&n,
634 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
635 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
636 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF"
637 "FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF2020202020DF"))
638 && TEST_true(BN_MONT_CTX_set(mont, n, ctx))
639 && TEST_true(BN_mod_exp_mont_consttime(c, a, b, n, ctx, mont))))
642 if (!TEST_BN_eq(c, d))
646 * Regression test for overflow bug in bn_sqr_comba4/8 for
647 * mips-linux-gnu and mipsel-linux-gnu 32bit targets.
650 static const char *ehex[] = {
651 "95564994a96c45954227b845a1e99cb939d5a1da99ee91acc962396ae999a9ee",
652 "38603790448f2f7694c242a875f0cad0aae658eba085f312d2febbbd128dd2b5",
653 "8f7d1149f03724215d704344d0d62c587ae3c5939cba4b9b5f3dc5e8e911ef9a",
654 "5ce1a5a749a4989d0d8368f6e1f8cdf3a362a6c97fb02047ff152b480a4ad985",
655 "2d45efdf0770542992afca6a0590d52930434bba96017afbc9f99e112950a8b1",
656 "a359473ec376f329bdae6a19f503be6d4be7393c4e43468831234e27e3838680",
657 "b949390d2e416a3f9759e5349ab4c253f6f29f819a6fe4cbfd27ada34903300e",
658 "da021f62839f5878a36f1bc3085375b00fd5fa3e68d316c0fdace87a97558465",
660 static const char *phex[] = {
661 "f95dc0f980fbd22e90caa5a387cc4a369f3f830d50dd321c40db8c09a7e1a241",
662 "a536e096622d3280c0c1ba849c1f4a79bf490f60006d081e8cf69960189f0d31",
663 "2cd9e17073a3fba7881b21474a13b334116cb2f5dbf3189a6de3515d0840f053",
664 "c776d3982d391b6d04d642dda5cc6d1640174c09875addb70595658f89efb439",
665 "dc6fbd55f903aadd307982d3f659207f265e1ec6271b274521b7a5e28e8fd7a5",
666 "5df089292820477802a43cf5b6b94e999e8c9944ddebb0d0e95a60f88cb7e813",
667 "ba110d20e1024774107dd02949031864923b3cb8c3f7250d6d1287b0a40db6a4",
668 "7bd5a469518eb65aa207ddc47d8c6e5fc8e0c105be8fc1d4b57b2e27540471d5",
670 static const char *mhex[] = {
671 "fef15d5ce4625f1bccfbba49fc8439c72bf8202af039a2259678941b60bb4a8f",
672 "2987e965d58fd8cf86a856674d519763d0e1211cc9f8596971050d56d9b35db3",
673 "785866cfbca17cfdbed6060be3629d894f924a89fdc1efc624f80d41a22f1900",
674 "9503fcc3824ef62ccb9208430c26f2d8ceb2c63488ec4c07437aa4c96c43dd8b",
675 "9289ed00a712ff66ee195dc71f5e4ead02172b63c543d69baf495f5fd63ba7bc",
676 "c633bd309c016e37736da92129d0b053d4ab28d21ad7d8b6fab2a8bbdc8ee647",
677 "d2fbcf2cf426cf892e6f5639e0252993965dfb73ccd277407014ea784aaa280c",
678 "b7b03972bc8b0baa72360bdb44b82415b86b2f260f877791cd33ba8f2d65229b",
681 if (!TEST_true(parse_bigBN(&e, ehex))
682 || !TEST_true(parse_bigBN(&p, phex))
683 || !TEST_true(parse_bigBN(&m, mhex))
684 || !TEST_true(BN_mod_exp_mont_consttime(d, e, p, m, ctx, NULL))
685 || !TEST_true(BN_mod_exp_simple(a, e, p, m, ctx))
686 || !TEST_BN_eq(a, d))
691 if (!TEST_true(BN_bntest_rand(p, 1024, 0, 0)))
694 if (!TEST_true(BN_mod_exp_mont_consttime(d, a, p, m, ctx, NULL))
695 || !TEST_BN_eq_zero(d))
699 * Craft an input whose Montgomery representation is 1, i.e., shorter
700 * than the modulus m, in order to test the const time precomputation
701 * scattering/gathering.
703 if (!(TEST_true(BN_one(a))
704 && TEST_true(BN_MONT_CTX_set(mont, m, ctx))))
706 if (!TEST_true(BN_from_montgomery(e, a, mont, ctx))
707 || !TEST_true(BN_mod_exp_mont_consttime(d, e, p, m, ctx, NULL))
708 || !TEST_true(BN_mod_exp_simple(a, e, p, m, ctx))
709 || !TEST_BN_eq(a, d))
712 /* Finally, some regular test vectors. */
713 if (!(TEST_true(BN_bntest_rand(e, 1024, 0, 0))
714 && TEST_true(BN_mod_exp_mont_consttime(d, e, p, m, ctx, NULL))
715 && TEST_true(BN_mod_exp_simple(a, e, p, m, ctx))
716 && TEST_BN_eq(a, d)))
722 BN_MONT_CTX_free(mont);
734 #ifndef OPENSSL_NO_EC2M
735 static int test_gf2m_add(void)
737 BIGNUM *a = NULL, *b = NULL, *c = NULL;
740 if (!TEST_ptr(a = BN_new())
741 || !TEST_ptr(b = BN_new())
742 || !TEST_ptr(c = BN_new()))
745 for (i = 0; i < NUM0; i++) {
746 if (!(TEST_true(BN_rand(a, 512, 0, 0))
747 && TEST_ptr(BN_copy(b, BN_value_one()))))
749 BN_set_negative(a, rand_neg());
750 BN_set_negative(b, rand_neg());
751 if (!(TEST_true(BN_GF2m_add(c, a, b))
752 /* Test that two added values have the correct parity. */
753 && TEST_false((BN_is_odd(a) && BN_is_odd(c))
754 || (!BN_is_odd(a) && !BN_is_odd(c)))))
756 if (!(TEST_true(BN_GF2m_add(c, c, c))
757 /* Test that c + c = 0. */
758 && TEST_BN_eq_zero(c)))
769 static int test_gf2m_mod(void)
771 BIGNUM *a = NULL, *b[2] = {NULL, NULL}, *c = NULL, *d = NULL, *e = NULL;
774 if (!TEST_ptr(a = BN_new())
775 || !TEST_ptr(b[0] = BN_new())
776 || !TEST_ptr(b[1] = BN_new())
777 || !TEST_ptr(c = BN_new())
778 || !TEST_ptr(d = BN_new())
779 || !TEST_ptr(e = BN_new()))
782 if (!(TEST_true(BN_GF2m_arr2poly(p0, b[0]))
783 && TEST_true(BN_GF2m_arr2poly(p1, b[1]))))
786 for (i = 0; i < NUM0; i++) {
787 if (!TEST_true(BN_bntest_rand(a, 1024, 0, 0)))
789 for (j = 0; j < 2; j++) {
790 if (!(TEST_true(BN_GF2m_mod(c, a, b[j]))
791 && TEST_true(BN_GF2m_add(d, a, c))
792 && TEST_true(BN_GF2m_mod(e, d, b[j]))
793 /* Test that a + (a mod p) mod p == 0. */
794 && TEST_BN_eq_zero(e)))
809 static int test_gf2m_mul(void)
811 BIGNUM *a, *b[2] = {NULL, NULL}, *c = NULL, *d = NULL;
812 BIGNUM *e = NULL, *f = NULL, *g = NULL, *h = NULL;
815 if (!TEST_ptr(a = BN_new())
816 || !TEST_ptr(b[0] = BN_new())
817 || !TEST_ptr(b[1] = BN_new())
818 || !TEST_ptr(c = BN_new())
819 || !TEST_ptr(d = BN_new())
820 || !TEST_ptr(e = BN_new())
821 || !TEST_ptr(f = BN_new())
822 || !TEST_ptr(g = BN_new())
823 || !TEST_ptr(h = BN_new()))
826 if (!(TEST_true(BN_GF2m_arr2poly(p0, b[0]))
827 && TEST_true(BN_GF2m_arr2poly(p1, b[1]))))
830 for (i = 0; i < NUM0; i++) {
831 if (!(TEST_true(BN_bntest_rand(a, 1024, 0, 0))
832 && TEST_true(BN_bntest_rand(c, 1024, 0, 0))
833 && TEST_true(BN_bntest_rand(d, 1024, 0, 0))))
835 for (j = 0; j < 2; j++) {
836 if (!(TEST_true(BN_GF2m_mod_mul(e, a, c, b[j], ctx))
837 && TEST_true(BN_GF2m_add(f, a, d))
838 && TEST_true(BN_GF2m_mod_mul(g, f, c, b[j], ctx))
839 && TEST_true(BN_GF2m_mod_mul(h, d, c, b[j], ctx))
840 && TEST_true(BN_GF2m_add(f, e, g))
841 && TEST_true(BN_GF2m_add(f, f, h))
842 /* Test that (a+d)*c = a*c + d*c. */
843 && TEST_BN_eq_zero(f)))
862 static int test_gf2m_sqr(void)
864 BIGNUM *a = NULL, *b[2] = {NULL, NULL}, *c = NULL, *d = NULL;
867 if (!TEST_ptr(a = BN_new())
868 || !TEST_ptr(b[0] = BN_new())
869 || !TEST_ptr(b[1] = BN_new())
870 || !TEST_ptr(c = BN_new())
871 || !TEST_ptr(d = BN_new()))
874 if (!(TEST_true(BN_GF2m_arr2poly(p0, b[0]))
875 && TEST_true(BN_GF2m_arr2poly(p1, b[1]))))
878 for (i = 0; i < NUM0; i++) {
879 if (!TEST_true(BN_bntest_rand(a, 1024, 0, 0)))
881 for (j = 0; j < 2; j++) {
882 if (!(TEST_true(BN_GF2m_mod_sqr(c, a, b[j], ctx))
883 && TEST_true(BN_copy(d, a))
884 && TEST_true(BN_GF2m_mod_mul(d, a, d, b[j], ctx))
885 && TEST_true(BN_GF2m_add(d, c, d))
886 /* Test that a*a = a^2. */
887 && TEST_BN_eq_zero(d)))
901 static int test_gf2m_modinv(void)
903 BIGNUM *a = NULL, *b[2] = {NULL, NULL}, *c = NULL, *d = 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()))
913 if (!(TEST_true(BN_GF2m_arr2poly(p0, b[0]))
914 && TEST_true(BN_GF2m_arr2poly(p1, b[1]))))
917 for (i = 0; i < NUM0; i++) {
918 if (!TEST_true(BN_bntest_rand(a, 512, 0, 0)))
920 for (j = 0; j < 2; j++) {
921 if (!(TEST_true(BN_GF2m_mod_inv(c, a, b[j], ctx))
922 && TEST_true(BN_GF2m_mod_mul(d, a, c, b[j], ctx))
923 /* Test that ((1/a)*a) = 1. */
924 && TEST_BN_eq_one(d)))
938 static int test_gf2m_moddiv(void)
940 BIGNUM *a = NULL, *b[2] = {NULL, NULL}, *c = NULL, *d = NULL;
941 BIGNUM *e = NULL, *f = NULL;
944 if (!TEST_ptr(a = BN_new())
945 || !TEST_ptr(b[0] = BN_new())
946 || !TEST_ptr(b[1] = BN_new())
947 || !TEST_ptr(c = BN_new())
948 || !TEST_ptr(d = BN_new())
949 || !TEST_ptr(e = BN_new())
950 || !TEST_ptr(f = BN_new()))
953 if (!(TEST_true(BN_GF2m_arr2poly(p0, b[0]))
954 && TEST_true(BN_GF2m_arr2poly(p1, b[1]))))
957 for (i = 0; i < NUM0; i++) {
958 if (!(TEST_true(BN_bntest_rand(a, 512, 0, 0))
959 && TEST_true(BN_bntest_rand(c, 512, 0, 0))))
961 for (j = 0; j < 2; j++) {
962 if (!(TEST_true(BN_GF2m_mod_div(d, a, c, b[j], ctx))
963 && TEST_true(BN_GF2m_mod_mul(e, d, c, b[j], ctx))
964 && TEST_true(BN_GF2m_mod_div(f, a, e, b[j], ctx))
965 /* Test that ((a/c)*c)/a = 1. */
966 && TEST_BN_eq_one(f)))
982 static int test_gf2m_modexp(void)
984 BIGNUM *a = NULL, *b[2] = {NULL, NULL}, *c = NULL, *d = NULL;
985 BIGNUM *e = NULL, *f = NULL;
988 if (!TEST_ptr(a = BN_new())
989 || !TEST_ptr(b[0] = BN_new())
990 || !TEST_ptr(b[1] = BN_new())
991 || !TEST_ptr(c = BN_new())
992 || !TEST_ptr(d = BN_new())
993 || !TEST_ptr(e = BN_new())
994 || !TEST_ptr(f = BN_new()))
997 if (!(TEST_true(BN_GF2m_arr2poly(p0, b[0]))
998 && TEST_true(BN_GF2m_arr2poly(p1, b[1]))))
1001 for (i = 0; i < NUM0; i++) {
1002 if (!(TEST_true(BN_bntest_rand(a, 512, 0, 0))
1003 && TEST_true(BN_bntest_rand(c, 512, 0, 0))
1004 && TEST_true(BN_bntest_rand(d, 512, 0, 0))))
1006 for (j = 0; j < 2; j++) {
1007 if (!(TEST_true(BN_GF2m_mod_exp(e, a, c, b[j], ctx))
1008 && TEST_true(BN_GF2m_mod_exp(f, a, d, b[j], ctx))
1009 && TEST_true(BN_GF2m_mod_mul(e, e, f, b[j], ctx))
1010 && TEST_true(BN_add(f, c, d))
1011 && TEST_true(BN_GF2m_mod_exp(f, a, f, b[j], ctx))
1012 && TEST_true(BN_GF2m_add(f, e, f))
1013 /* Test that a^(c+d)=a^c*a^d. */
1014 && TEST_BN_eq_zero(f)))
1030 static int test_gf2m_modsqrt(void)
1032 BIGNUM *a = NULL, *b[2] = {NULL, NULL}, *c = NULL, *d = NULL;
1033 BIGNUM *e = NULL, *f = NULL;
1036 if (!TEST_ptr(a = BN_new())
1037 || !TEST_ptr(b[0] = BN_new())
1038 || !TEST_ptr(b[1] = BN_new())
1039 || !TEST_ptr(c = BN_new())
1040 || !TEST_ptr(d = BN_new())
1041 || !TEST_ptr(e = BN_new())
1042 || !TEST_ptr(f = BN_new()))
1045 if (!(TEST_true(BN_GF2m_arr2poly(p0, b[0]))
1046 && TEST_true(BN_GF2m_arr2poly(p1, b[1]))))
1049 for (i = 0; i < NUM0; i++) {
1050 if (!TEST_true(BN_bntest_rand(a, 512, 0, 0)))
1053 for (j = 0; j < 2; j++) {
1054 if (!(TEST_true(BN_GF2m_mod(c, a, b[j]))
1055 && TEST_true(BN_GF2m_mod_sqrt(d, a, b[j], ctx))
1056 && TEST_true(BN_GF2m_mod_sqr(e, d, b[j], ctx))
1057 && TEST_true(BN_GF2m_add(f, c, e))
1058 /* Test that d^2 = a, where d = sqrt(a). */
1059 && TEST_BN_eq_zero(f)))
1075 static int test_gf2m_modsolvequad(void)
1077 BIGNUM *a = NULL, *b[2] = {NULL, NULL}, *c = NULL, *d = NULL;
1079 int i, j, s = 0, t, st = 0;
1081 if (!TEST_ptr(a = BN_new())
1082 || !TEST_ptr(b[0] = BN_new())
1083 || !TEST_ptr(b[1] = BN_new())
1084 || !TEST_ptr(c = BN_new())
1085 || !TEST_ptr(d = BN_new())
1086 || !TEST_ptr(e = BN_new()))
1089 if (!(TEST_true(BN_GF2m_arr2poly(p0, b[0]))
1090 && TEST_true(BN_GF2m_arr2poly(p1, b[1]))))
1093 for (i = 0; i < NUM0; i++) {
1094 if (!TEST_true(BN_bntest_rand(a, 512, 0, 0)))
1096 for (j = 0; j < 2; j++) {
1097 t = BN_GF2m_mod_solve_quad(c, a, b[j], ctx);
1100 if (!(TEST_true(BN_GF2m_mod_sqr(d, c, b[j], ctx))
1101 && TEST_true(BN_GF2m_add(d, c, d))
1102 && TEST_true(BN_GF2m_mod(e, a, b[j]))
1103 && TEST_true(BN_GF2m_add(e, e, d))
1105 * Test that solution of quadratic c
1106 * satisfies c^2 + c = a.
1108 && TEST_BN_eq_zero(e)))
1113 if (!TEST_int_ge(s, 0)) {
1114 TEST_info("%d tests found no roots; probably an error", NUM0);
1129 static int test_kronecker(void)
1131 BIGNUM *a = NULL, *b = NULL, *r = NULL, *t = NULL;
1132 int i, legendre, kronecker, st = 0;
1134 if (!TEST_ptr(a = BN_new())
1135 || !TEST_ptr(b = BN_new())
1136 || !TEST_ptr(r = BN_new())
1137 || !TEST_ptr(t = BN_new()))
1141 * We test BN_kronecker(a, b, ctx) just for b odd (Jacobi symbol). In
1142 * this case we know that if b is prime, then BN_kronecker(a, b, ctx) is
1143 * congruent to $a^{(b-1)/2}$, modulo $b$ (Legendre symbol). So we
1144 * generate a random prime b and compare these values for a number of
1145 * random a's. (That is, we run the Solovay-Strassen primality test to
1146 * confirm that b is prime, except that we don't want to test whether b
1147 * is prime but whether BN_kronecker works.)
1150 if (!TEST_true(BN_generate_prime_ex(b, 512, 0, NULL, NULL, NULL)))
1152 BN_set_negative(b, rand_neg());
1154 for (i = 0; i < NUM0; i++) {
1155 if (!TEST_true(BN_bntest_rand(a, 512, 0, 0)))
1157 BN_set_negative(a, rand_neg());
1159 /* t := (|b|-1)/2 (note that b is odd) */
1160 if (!TEST_true(BN_copy(t, b)))
1162 BN_set_negative(t, 0);
1163 if (!TEST_true(BN_sub_word(t, 1)))
1165 if (!TEST_true(BN_rshift1(t, t)))
1167 /* r := a^t mod b */
1168 BN_set_negative(b, 0);
1170 if (!TEST_true(BN_mod_exp_recp(r, a, t, b, ctx)))
1172 BN_set_negative(b, 1);
1174 if (BN_is_word(r, 1))
1176 else if (BN_is_zero(r))
1179 if (!TEST_true(BN_add_word(r, 1)))
1181 if (!TEST_int_eq(BN_ucmp(r, b), 0)) {
1182 TEST_info("Legendre symbol computation failed");
1188 if (!TEST_int_ge(kronecker = BN_kronecker(a, b, ctx), -1))
1190 /* we actually need BN_kronecker(a, |b|) */
1191 if (BN_is_negative(a) && BN_is_negative(b))
1192 kronecker = -kronecker;
1194 if (!TEST_int_eq(legendre, kronecker))
1207 static int file_sum(STANZA *s)
1209 BIGNUM *a = NULL, *b = NULL, *sum = NULL, *ret = NULL;
1213 if (!TEST_ptr(a = getBN(s, "A"))
1214 || !TEST_ptr(b = getBN(s, "B"))
1215 || !TEST_ptr(sum = getBN(s, "Sum"))
1216 || !TEST_ptr(ret = BN_new()))
1219 if (!TEST_true(BN_add(ret, a, b))
1220 || !equalBN("A + B", sum, ret)
1221 || !TEST_true(BN_sub(ret, sum, a))
1222 || !equalBN("Sum - A", b, ret)
1223 || !TEST_true(BN_sub(ret, sum, b))
1224 || !equalBN("Sum - B", a, ret))
1228 * Test that the functions work when |r| and |a| point to the same BIGNUM,
1229 * or when |r| and |b| point to the same BIGNUM.
1230 * There is no test for all of |r|, |a|, and |b| pointint to the same BIGNUM.
1232 if (!TEST_true(BN_copy(ret, a))
1233 || !TEST_true(BN_add(ret, ret, b))
1234 || !equalBN("A + B (r is a)", sum, ret)
1235 || !TEST_true(BN_copy(ret, b))
1236 || !TEST_true(BN_add(ret, a, ret))
1237 || !equalBN("A + B (r is b)", sum, ret)
1238 || !TEST_true(BN_copy(ret, sum))
1239 || !TEST_true(BN_sub(ret, ret, a))
1240 || !equalBN("Sum - A (r is a)", b, ret)
1241 || !TEST_true(BN_copy(ret, a))
1242 || !TEST_true(BN_sub(ret, sum, ret))
1243 || !equalBN("Sum - A (r is b)", b, ret)
1244 || !TEST_true(BN_copy(ret, sum))
1245 || !TEST_true(BN_sub(ret, ret, b))
1246 || !equalBN("Sum - B (r is a)", a, ret)
1247 || !TEST_true(BN_copy(ret, b))
1248 || !TEST_true(BN_sub(ret, sum, ret))
1249 || !equalBN("Sum - B (r is b)", a, ret))
1253 * Test BN_uadd() and BN_usub() with the prerequisites they are
1254 * documented as having. Note that these functions are frequently used
1255 * when the prerequisites don't hold. In those cases, they are supposed
1256 * to work as if the prerequisite hold, but we don't test that yet.
1258 if (!BN_is_negative(a) && !BN_is_negative(b) && BN_cmp(a, b) >= 0) {
1259 if (!TEST_true(BN_uadd(ret, a, b))
1260 || !equalBN("A +u B", sum, ret)
1261 || !TEST_true(BN_usub(ret, sum, a))
1262 || !equalBN("Sum -u A", b, ret)
1263 || !TEST_true(BN_usub(ret, sum, b))
1264 || !equalBN("Sum -u B", a, ret))
1267 * Test that the functions work when |r| and |a| point to the same
1268 * BIGNUM, or when |r| and |b| point to the same BIGNUM.
1269 * There is no test for all of |r|, |a|, and |b| pointint to the same
1272 if (!TEST_true(BN_copy(ret, a))
1273 || !TEST_true(BN_uadd(ret, ret, b))
1274 || !equalBN("A +u B (r is a)", sum, ret)
1275 || !TEST_true(BN_copy(ret, b))
1276 || !TEST_true(BN_uadd(ret, a, ret))
1277 || !equalBN("A +u B (r is b)", sum, ret)
1278 || !TEST_true(BN_copy(ret, sum))
1279 || !TEST_true(BN_usub(ret, ret, a))
1280 || !equalBN("Sum -u A (r is a)", b, ret)
1281 || !TEST_true(BN_copy(ret, a))
1282 || !TEST_true(BN_usub(ret, sum, ret))
1283 || !equalBN("Sum -u A (r is b)", b, ret)
1284 || !TEST_true(BN_copy(ret, sum))
1285 || !TEST_true(BN_usub(ret, ret, b))
1286 || !equalBN("Sum -u B (r is a)", a, ret)
1287 || !TEST_true(BN_copy(ret, b))
1288 || !TEST_true(BN_usub(ret, sum, ret))
1289 || !equalBN("Sum -u B (r is b)", a, ret))
1294 * Test with BN_add_word() and BN_sub_word() if |b| is small enough.
1296 b_word = BN_get_word(b);
1297 if (!BN_is_negative(b) && b_word != (BN_ULONG)-1) {
1298 if (!TEST_true(BN_copy(ret, a))
1299 || !TEST_true(BN_add_word(ret, b_word))
1300 || !equalBN("A + B (word)", sum, ret)
1301 || !TEST_true(BN_copy(ret, sum))
1302 || !TEST_true(BN_sub_word(ret, b_word))
1303 || !equalBN("Sum - B (word)", a, ret))
1316 static int file_lshift1(STANZA *s)
1318 BIGNUM *a = NULL, *lshift1 = NULL, *zero = NULL, *ret = NULL;
1319 BIGNUM *two = NULL, *remainder = NULL;
1322 if (!TEST_ptr(a = getBN(s, "A"))
1323 || !TEST_ptr(lshift1 = getBN(s, "LShift1"))
1324 || !TEST_ptr(zero = BN_new())
1325 || !TEST_ptr(ret = BN_new())
1326 || !TEST_ptr(two = BN_new())
1327 || !TEST_ptr(remainder = BN_new()))
1332 if (!TEST_true(BN_set_word(two, 2))
1333 || !TEST_true(BN_add(ret, a, a))
1334 || !equalBN("A + A", lshift1, ret)
1335 || !TEST_true(BN_mul(ret, a, two, ctx))
1336 || !equalBN("A * 2", lshift1, ret)
1337 || !TEST_true(BN_div(ret, remainder, lshift1, two, ctx))
1338 || !equalBN("LShift1 / 2", a, ret)
1339 || !equalBN("LShift1 % 2", zero, remainder)
1340 || !TEST_true(BN_lshift1(ret, a))
1341 || !equalBN("A << 1", lshift1, ret)
1342 || !TEST_true(BN_rshift1(ret, lshift1))
1343 || !equalBN("LShift >> 1", a, ret)
1344 || !TEST_true(BN_rshift1(ret, lshift1))
1345 || !equalBN("LShift >> 1", a, ret))
1348 /* Set the LSB to 1 and test rshift1 again. */
1349 if (!TEST_true(BN_set_bit(lshift1, 0))
1350 || !TEST_true(BN_div(ret, NULL /* rem */ , lshift1, two, ctx))
1351 || !equalBN("(LShift1 | 1) / 2", a, ret)
1352 || !TEST_true(BN_rshift1(ret, lshift1))
1353 || !equalBN("(LShift | 1) >> 1", a, ret))
1368 static int file_lshift(STANZA *s)
1370 BIGNUM *a = NULL, *lshift = NULL, *ret = NULL;
1373 if (!TEST_ptr(a = getBN(s, "A"))
1374 || !TEST_ptr(lshift = getBN(s, "LShift"))
1375 || !TEST_ptr(ret = BN_new())
1376 || !getint(s, &n, "N"))
1379 if (!TEST_true(BN_lshift(ret, a, n))
1380 || !equalBN("A << N", lshift, ret)
1381 || !TEST_true(BN_rshift(ret, lshift, n))
1382 || !equalBN("A >> N", a, ret))
1393 static int file_rshift(STANZA *s)
1395 BIGNUM *a = NULL, *rshift = NULL, *ret = NULL;
1398 if (!TEST_ptr(a = getBN(s, "A"))
1399 || !TEST_ptr(rshift = getBN(s, "RShift"))
1400 || !TEST_ptr(ret = BN_new())
1401 || !getint(s, &n, "N"))
1404 if (!TEST_true(BN_rshift(ret, a, n))
1405 || !equalBN("A >> N", rshift, ret))
1408 /* If N == 1, try with rshift1 as well */
1410 if (!TEST_true(BN_rshift1(ret, a))
1411 || !equalBN("A >> 1 (rshift1)", rshift, ret))
1423 static int file_square(STANZA *s)
1425 BIGNUM *a = NULL, *square = NULL, *zero = NULL, *ret = NULL;
1426 BIGNUM *remainder = NULL, *tmp = NULL;
1429 if (!TEST_ptr(a = getBN(s, "A"))
1430 || !TEST_ptr(square = getBN(s, "Square"))
1431 || !TEST_ptr(zero = BN_new())
1432 || !TEST_ptr(ret = BN_new())
1433 || !TEST_ptr(remainder = BN_new()))
1437 if (!TEST_true(BN_sqr(ret, a, ctx))
1438 || !equalBN("A^2", square, ret)
1439 || !TEST_true(BN_mul(ret, a, a, ctx))
1440 || !equalBN("A * A", square, ret)
1441 || !TEST_true(BN_div(ret, remainder, square, a, ctx))
1442 || !equalBN("Square / A", a, ret)
1443 || !equalBN("Square % A", zero, remainder))
1447 BN_set_negative(a, 0);
1448 if (!TEST_true(BN_sqrt(ret, square, ctx))
1449 || !equalBN("sqrt(Square)", a, ret))
1452 /* BN_sqrt should fail on non-squares and negative numbers. */
1453 if (!TEST_BN_eq_zero(square)) {
1454 if (!TEST_ptr(tmp = BN_new())
1455 || !TEST_true(BN_copy(tmp, square)))
1457 BN_set_negative(tmp, 1);
1459 if (!TEST_int_eq(BN_sqrt(ret, tmp, ctx), 0))
1463 BN_set_negative(tmp, 0);
1464 if (BN_add(tmp, tmp, BN_value_one()))
1466 if (!TEST_int_eq(BN_sqrt(ret, tmp, ctx)))
1483 static int file_product(STANZA *s)
1485 BIGNUM *a = NULL, *b = NULL, *product = NULL, *ret = NULL;
1486 BIGNUM *remainder = NULL, *zero = NULL;
1489 if (!TEST_ptr(a = getBN(s, "A"))
1490 || !TEST_ptr(b = getBN(s, "B"))
1491 || !TEST_ptr(product = getBN(s, "Product"))
1492 || !TEST_ptr(ret = BN_new())
1493 || !TEST_ptr(remainder = BN_new())
1494 || !TEST_ptr(zero = BN_new()))
1499 if (!TEST_true(BN_mul(ret, a, b, ctx))
1500 || !equalBN("A * B", product, ret)
1501 || !TEST_true(BN_div(ret, remainder, product, a, ctx))
1502 || !equalBN("Product / A", b, ret)
1503 || !equalBN("Product % A", zero, remainder)
1504 || !TEST_true(BN_div(ret, remainder, product, b, ctx))
1505 || !equalBN("Product / B", a, ret)
1506 || !equalBN("Product % B", zero, remainder))
1520 static int file_quotient(STANZA *s)
1522 BIGNUM *a = NULL, *b = NULL, *quotient = NULL, *remainder = NULL;
1523 BIGNUM *ret = NULL, *ret2 = NULL, *nnmod = NULL;
1524 BN_ULONG b_word, ret_word;
1527 if (!TEST_ptr(a = getBN(s, "A"))
1528 || !TEST_ptr(b = getBN(s, "B"))
1529 || !TEST_ptr(quotient = getBN(s, "Quotient"))
1530 || !TEST_ptr(remainder = getBN(s, "Remainder"))
1531 || !TEST_ptr(ret = BN_new())
1532 || !TEST_ptr(ret2 = BN_new())
1533 || !TEST_ptr(nnmod = BN_new()))
1536 if (!TEST_true(BN_div(ret, ret2, a, b, ctx))
1537 || !equalBN("A / B", quotient, ret)
1538 || !equalBN("A % B", remainder, ret2)
1539 || !TEST_true(BN_mul(ret, quotient, b, ctx))
1540 || !TEST_true(BN_add(ret, ret, remainder))
1541 || !equalBN("Quotient * B + Remainder", a, ret))
1545 * Test with BN_mod_word() and BN_div_word() if the divisor is
1548 b_word = BN_get_word(b);
1549 if (!BN_is_negative(b) && b_word != (BN_ULONG)-1) {
1550 BN_ULONG remainder_word = BN_get_word(remainder);
1552 assert(remainder_word != (BN_ULONG)-1);
1553 if (!TEST_ptr(BN_copy(ret, a)))
1555 ret_word = BN_div_word(ret, b_word);
1556 if (ret_word != remainder_word) {
1559 "Got A %% B (word) = " BN_DEC_FMT1 ", wanted " BN_DEC_FMT1,
1560 ret_word, remainder_word);
1562 TEST_error("Got A %% B (word) mismatch");
1566 if (!equalBN ("A / B (word)", quotient, ret))
1569 ret_word = BN_mod_word(a, b_word);
1570 if (ret_word != remainder_word) {
1573 "Got A %% B (word) = " BN_DEC_FMT1 ", wanted " BN_DEC_FMT1 "",
1574 ret_word, remainder_word);
1576 TEST_error("Got A %% B (word) mismatch");
1582 /* Test BN_nnmod. */
1583 if (!BN_is_negative(b)) {
1584 if (!TEST_true(BN_copy(nnmod, remainder))
1585 || (BN_is_negative(nnmod)
1586 && !TEST_true(BN_add(nnmod, nnmod, b)))
1587 || !TEST_true(BN_nnmod(ret, a, b, ctx))
1588 || !equalBN("A % B (non-negative)", nnmod, ret))
1604 static int file_modmul(STANZA *s)
1606 BIGNUM *a = NULL, *b = NULL, *m = NULL, *mod_mul = NULL, *ret = NULL;
1609 if (!TEST_ptr(a = getBN(s, "A"))
1610 || !TEST_ptr(b = getBN(s, "B"))
1611 || !TEST_ptr(m = getBN(s, "M"))
1612 || !TEST_ptr(mod_mul = getBN(s, "ModMul"))
1613 || !TEST_ptr(ret = BN_new()))
1616 if (!TEST_true(BN_mod_mul(ret, a, b, m, ctx))
1617 || !equalBN("A * B (mod M)", mod_mul, ret))
1621 /* Reduce |a| and |b| and test the Montgomery version. */
1622 BN_MONT_CTX *mont = BN_MONT_CTX_new();
1623 BIGNUM *a_tmp = BN_new();
1624 BIGNUM *b_tmp = BN_new();
1626 if (mont == NULL || a_tmp == NULL || b_tmp == NULL
1627 || !TEST_true(BN_MONT_CTX_set(mont, m, ctx))
1628 || !TEST_true(BN_nnmod(a_tmp, a, m, ctx))
1629 || !TEST_true(BN_nnmod(b_tmp, b, m, ctx))
1630 || !TEST_true(BN_to_montgomery(a_tmp, a_tmp, mont, ctx))
1631 || !TEST_true(BN_to_montgomery(b_tmp, b_tmp, mont, ctx))
1632 || !TEST_true(BN_mod_mul_montgomery(ret, a_tmp, b_tmp,
1634 || !TEST_true(BN_from_montgomery(ret, ret, mont, ctx))
1635 || !equalBN("A * B (mod M) (mont)", mod_mul, ret))
1639 BN_MONT_CTX_free(mont);
1656 static int file_modexp(STANZA *s)
1658 BIGNUM *a = NULL, *e = NULL, *m = NULL, *mod_exp = NULL, *ret = NULL;
1659 BIGNUM *b = NULL, *c = NULL, *d = NULL;
1662 if (!TEST_ptr(a = getBN(s, "A"))
1663 || !TEST_ptr(e = getBN(s, "E"))
1664 || !TEST_ptr(m = getBN(s, "M"))
1665 || !TEST_ptr(mod_exp = getBN(s, "ModExp"))
1666 || !TEST_ptr(ret = BN_new())
1667 || !TEST_ptr(d = BN_new()))
1670 if (!TEST_true(BN_mod_exp(ret, a, e, m, ctx))
1671 || !equalBN("A ^ E (mod M)", mod_exp, ret))
1675 if (!TEST_true(BN_mod_exp_mont(ret, a, e, m, ctx, NULL))
1676 || !equalBN("A ^ E (mod M) (mont)", mod_exp, ret)
1677 || !TEST_true(BN_mod_exp_mont_consttime(ret, a, e, m,
1679 || !equalBN("A ^ E (mod M) (mont const", mod_exp, ret))
1683 /* Regression test for carry propagation bug in sqr8x_reduction */
1684 BN_hex2bn(&a, "050505050505");
1685 BN_hex2bn(&b, "02");
1687 "4141414141414141414141274141414141414141414141414141414141414141"
1688 "4141414141414141414141414141414141414141414141414141414141414141"
1689 "4141414141414141414141800000000000000000000000000000000000000000"
1690 "0000000000000000000000000000000000000000000000000000000000000000"
1691 "0000000000000000000000000000000000000000000000000000000000000000"
1692 "0000000000000000000000000000000000000000000000000000000001");
1693 if (!TEST_true(BN_mod_exp(d, a, b, c, ctx))
1694 || !TEST_true(BN_mul(e, a, a, ctx))
1695 || !TEST_BN_eq(d, e))
1711 static int file_exp(STANZA *s)
1713 BIGNUM *a = NULL, *e = NULL, *exp = NULL, *ret = NULL;
1716 if (!TEST_ptr(a = getBN(s, "A"))
1717 || !TEST_ptr(e = getBN(s, "E"))
1718 || !TEST_ptr(exp = getBN(s, "Exp"))
1719 || !TEST_ptr(ret = BN_new()))
1722 if (!TEST_true(BN_exp(ret, a, e, ctx))
1723 || !equalBN("A ^ E", exp, ret))
1735 static int file_modsqrt(STANZA *s)
1737 BIGNUM *a = NULL, *p = NULL, *mod_sqrt = NULL, *ret = NULL, *ret2 = NULL;
1740 if (!TEST_ptr(a = getBN(s, "A"))
1741 || !TEST_ptr(p = getBN(s, "P"))
1742 || !TEST_ptr(mod_sqrt = getBN(s, "ModSqrt"))
1743 || !TEST_ptr(ret = BN_new())
1744 || !TEST_ptr(ret2 = BN_new()))
1747 if (BN_is_negative(mod_sqrt)) {
1748 /* A negative testcase */
1749 if (!TEST_ptr_null(BN_mod_sqrt(ret, a, p, ctx)))
1756 /* There are two possible answers. */
1757 if (!TEST_ptr(BN_mod_sqrt(ret, a, p, ctx))
1758 || !TEST_true(BN_sub(ret2, p, ret)))
1761 /* The first condition should NOT be a test. */
1762 if (BN_cmp(ret2, mod_sqrt) != 0
1763 && !equalBN("sqrt(A) (mod P)", mod_sqrt, ret))
1776 static int file_gcd(STANZA *s)
1778 BIGNUM *a = NULL, *b = NULL, *gcd = NULL, *ret = NULL;
1781 if (!TEST_ptr(a = getBN(s, "A"))
1782 || !TEST_ptr(b = getBN(s, "B"))
1783 || !TEST_ptr(gcd = getBN(s, "GCD"))
1784 || !TEST_ptr(ret = BN_new()))
1787 if (!TEST_true(BN_gcd(ret, a, b, ctx))
1788 || !equalBN("gcd(A,B)", gcd, ret))
1800 static int test_bn2padded(void)
1802 uint8_t zeros[256], out[256], reference[128];
1807 /* Test edge case at 0. */
1808 if (!TEST_ptr((n = BN_new())))
1810 if (!TEST_int_eq(BN_bn2binpad(n, NULL, 0), 0))
1812 memset(out, -1, sizeof(out));
1813 if (!TEST_int_eq(BN_bn2binpad(n, out, sizeof(out)), sizeof(out)))
1815 memset(zeros, 0, sizeof(zeros));
1816 if (!TEST_mem_eq(zeros, sizeof(zeros), out, sizeof(out)))
1819 /* Test a random numbers at various byte lengths. */
1820 for (bytes = 128 - 7; bytes <= 128; bytes++) {
1821 # define TOP_BIT_ON 0
1822 # define BOTTOM_BIT_NOTOUCH 0
1823 if (!TEST_true(BN_rand(n, bytes * 8, TOP_BIT_ON, BOTTOM_BIT_NOTOUCH)))
1825 if (!TEST_int_eq(BN_num_bytes(n), bytes)
1826 || !TEST_int_eq(BN_bn2bin(n, reference), bytes))
1828 /* Empty buffer should fail. */
1829 if (!TEST_int_eq(BN_bn2binpad(n, NULL, 0), -1))
1831 /* One byte short should fail. */
1832 if (!TEST_int_eq(BN_bn2binpad(n, out, bytes - 1), -1))
1834 /* Exactly right size should encode. */
1835 if (!TEST_int_eq(BN_bn2binpad(n, out, bytes), bytes)
1836 || !TEST_mem_eq(out, bytes, reference, bytes))
1838 /* Pad up one byte extra. */
1839 if (!TEST_int_eq(BN_bn2binpad(n, out, bytes + 1), bytes + 1)
1840 || !TEST_mem_eq(out + 1, bytes, reference, bytes)
1841 || !TEST_mem_eq(out, 1, zeros, 1))
1843 /* Pad up to 256. */
1844 if (!TEST_int_eq(BN_bn2binpad(n, out, sizeof(out)), sizeof(out))
1845 || !TEST_mem_eq(out + sizeof(out) - bytes, bytes,
1847 || !TEST_mem_eq(out, sizeof(out) - bytes,
1848 zeros, sizeof(out) - bytes))
1858 static const MPITEST kSignedTests_BE[] = {
1863 * The above cover the basics, now let's go for possible bignum
1864 * chunk edges and other word edges (for a broad definition of
1865 * "word", i.e. 1 byte included).
1869 {"-127", "\x81", 1},
1870 {"128", "\x00\x80", 2},
1871 {"-128", "\x80", 1},
1872 {"129", "\x00\x81", 2},
1873 {"-129", "\xff\x7f", 2},
1874 {"255", "\x00\xff", 2},
1875 {"-255", "\xff\x01", 2},
1876 {"256", "\x01\x00", 2},
1877 {"-256", "\xff\x00", 2},
1879 {"32767", "\x7f\xff", 2},
1880 {"-32767", "\x80\x01", 2},
1881 {"32768", "\x00\x80\x00", 3},
1882 {"-32768", "\x80\x00", 2},
1883 {"32769", "\x00\x80\x01", 3},
1884 {"-32769", "\xff\x7f\xff", 3},
1885 {"65535", "\x00\xff\xff", 3},
1886 {"-65535", "\xff\x00\x01", 3},
1887 {"65536", "\x01\x00\x00", 3},
1888 {"-65536", "\xff\x00\x00", 3},
1890 {"2147483647", "\x7f\xff\xff\xff", 4},
1891 {"-2147483647", "\x80\x00\x00\x01", 4},
1892 {"2147483648", "\x00\x80\x00\x00\x00", 5},
1893 {"-2147483648", "\x80\x00\x00\x00", 4},
1894 {"2147483649", "\x00\x80\x00\x00\x01", 5},
1895 {"-2147483649", "\xff\x7f\xff\xff\xff", 5},
1896 {"4294967295", "\x00\xff\xff\xff\xff", 5},
1897 {"-4294967295", "\xff\x00\x00\x00\x01", 5},
1898 {"4294967296", "\x01\x00\x00\x00\x00", 5},
1899 {"-4294967296", "\xff\x00\x00\x00\x00", 5},
1901 {"9223372036854775807", "\x7f\xff\xff\xff\xff\xff\xff\xff", 8},
1902 {"-9223372036854775807", "\x80\x00\x00\x00\x00\x00\x00\x01", 8},
1903 {"9223372036854775808", "\x00\x80\x00\x00\x00\x00\x00\x00\x00", 9},
1904 {"-9223372036854775808", "\x80\x00\x00\x00\x00\x00\x00\x00", 8},
1905 {"9223372036854775809", "\x00\x80\x00\x00\x00\x00\x00\x00\x01", 9},
1906 {"-9223372036854775809", "\xff\x7f\xff\xff\xff\xff\xff\xff\xff", 9},
1907 {"18446744073709551615", "\x00\xff\xff\xff\xff\xff\xff\xff\xff", 9},
1908 {"-18446744073709551615", "\xff\x00\x00\x00\x00\x00\x00\x00\x01", 9},
1909 {"18446744073709551616", "\x01\x00\x00\x00\x00\x00\x00\x00\x00", 9},
1910 {"-18446744073709551616", "\xff\x00\x00\x00\x00\x00\x00\x00\x00", 9},
1913 static int copy_reversed(uint8_t *dst, uint8_t *src, size_t len)
1915 for (dst += len - 1; len > 0; src++, dst--, len--)
1920 static int test_bn2signed(int i)
1922 uint8_t scratch[10], reversed[10];
1923 const MPITEST *test = &kSignedTests_BE[i];
1924 BIGNUM *bn = NULL, *bn2 = NULL;
1927 if (!TEST_ptr(bn = BN_new())
1928 || !TEST_true(BN_asc2bn(&bn, test->base10)))
1932 * Check BN_signed_bn2bin() / BN_signed_bin2bn()
1933 * The interesting stuff happens in the last bytes of the buffers,
1934 * the beginning is just padding (i.e. sign extension).
1936 i = sizeof(scratch) - test->mpi_len;
1937 if (!TEST_int_eq(BN_signed_bn2bin(bn, scratch, sizeof(scratch)),
1939 || !TEST_true(copy_reversed(reversed, scratch, sizeof(scratch)))
1940 || !TEST_mem_eq(test->mpi, test->mpi_len, scratch + i, test->mpi_len))
1943 if (!TEST_ptr(bn2 = BN_signed_bin2bn(scratch, sizeof(scratch), NULL))
1944 || !TEST_BN_eq(bn, bn2))
1950 /* Check that a parse of the reversed buffer works too */
1951 if (!TEST_ptr(bn2 = BN_signed_lebin2bn(reversed, sizeof(reversed), NULL))
1952 || !TEST_BN_eq(bn, bn2))
1959 * Check BN_signed_bn2lebin() / BN_signed_lebin2bn()
1960 * The interesting stuff happens in the first bytes of the buffers,
1961 * the end is just padding (i.e. sign extension).
1963 i = sizeof(reversed) - test->mpi_len;
1964 if (!TEST_int_eq(BN_signed_bn2lebin(bn, scratch, sizeof(scratch)),
1966 || !TEST_true(copy_reversed(reversed, scratch, sizeof(scratch)))
1967 || !TEST_mem_eq(test->mpi, test->mpi_len, reversed + i, test->mpi_len))
1970 if (!TEST_ptr(bn2 = BN_signed_lebin2bn(scratch, sizeof(scratch), NULL))
1971 || !TEST_BN_eq(bn, bn2))
1977 /* Check that a parse of the reversed buffer works too */
1978 if (!TEST_ptr(bn2 = BN_signed_bin2bn(reversed, sizeof(reversed), NULL))
1979 || !TEST_BN_eq(bn, bn2))
1989 static int test_dec2bn(void)
1994 if (!TEST_int_eq(parsedecBN(&bn, "0"), 1)
1995 || !TEST_BN_eq_word(bn, 0)
1996 || !TEST_BN_eq_zero(bn)
1997 || !TEST_BN_le_zero(bn)
1998 || !TEST_BN_ge_zero(bn)
1999 || !TEST_BN_even(bn))
2004 if (!TEST_int_eq(parsedecBN(&bn, "256"), 3)
2005 || !TEST_BN_eq_word(bn, 256)
2006 || !TEST_BN_ge_zero(bn)
2007 || !TEST_BN_gt_zero(bn)
2008 || !TEST_BN_ne_zero(bn)
2009 || !TEST_BN_even(bn))
2014 if (!TEST_int_eq(parsedecBN(&bn, "-42"), 3)
2015 || !TEST_BN_abs_eq_word(bn, 42)
2016 || !TEST_BN_lt_zero(bn)
2017 || !TEST_BN_le_zero(bn)
2018 || !TEST_BN_ne_zero(bn)
2019 || !TEST_BN_even(bn))
2024 if (!TEST_int_eq(parsedecBN(&bn, "1"), 1)
2025 || !TEST_BN_eq_word(bn, 1)
2026 || !TEST_BN_ne_zero(bn)
2027 || !TEST_BN_gt_zero(bn)
2028 || !TEST_BN_ge_zero(bn)
2029 || !TEST_BN_eq_one(bn)
2030 || !TEST_BN_odd(bn))
2035 if (!TEST_int_eq(parsedecBN(&bn, "-0"), 2)
2036 || !TEST_BN_eq_zero(bn)
2037 || !TEST_BN_ge_zero(bn)
2038 || !TEST_BN_le_zero(bn)
2039 || !TEST_BN_even(bn))
2044 if (!TEST_int_eq(parsedecBN(&bn, "42trailing garbage is ignored"), 2)
2045 || !TEST_BN_abs_eq_word(bn, 42)
2046 || !TEST_BN_ge_zero(bn)
2047 || !TEST_BN_gt_zero(bn)
2048 || !TEST_BN_ne_zero(bn)
2049 || !TEST_BN_even(bn))
2058 static int test_hex2bn(void)
2063 if (!TEST_int_eq(parseBN(&bn, "0"), 1)
2064 || !TEST_BN_eq_zero(bn)
2065 || !TEST_BN_ge_zero(bn)
2066 || !TEST_BN_even(bn))
2071 if (!TEST_int_eq(parseBN(&bn, "256"), 3)
2072 || !TEST_BN_eq_word(bn, 0x256)
2073 || !TEST_BN_ge_zero(bn)
2074 || !TEST_BN_gt_zero(bn)
2075 || !TEST_BN_ne_zero(bn)
2076 || !TEST_BN_even(bn))
2081 if (!TEST_int_eq(parseBN(&bn, "-42"), 3)
2082 || !TEST_BN_abs_eq_word(bn, 0x42)
2083 || !TEST_BN_lt_zero(bn)
2084 || !TEST_BN_le_zero(bn)
2085 || !TEST_BN_ne_zero(bn)
2086 || !TEST_BN_even(bn))
2091 if (!TEST_int_eq(parseBN(&bn, "cb"), 2)
2092 || !TEST_BN_eq_word(bn, 0xCB)
2093 || !TEST_BN_ge_zero(bn)
2094 || !TEST_BN_gt_zero(bn)
2095 || !TEST_BN_ne_zero(bn)
2096 || !TEST_BN_odd(bn))
2101 if (!TEST_int_eq(parseBN(&bn, "-0"), 2)
2102 || !TEST_BN_eq_zero(bn)
2103 || !TEST_BN_ge_zero(bn)
2104 || !TEST_BN_le_zero(bn)
2105 || !TEST_BN_even(bn))
2110 if (!TEST_int_eq(parseBN(&bn, "abctrailing garbage is ignored"), 3)
2111 || !TEST_BN_eq_word(bn, 0xabc)
2112 || !TEST_BN_ge_zero(bn)
2113 || !TEST_BN_gt_zero(bn)
2114 || !TEST_BN_ne_zero(bn)
2115 || !TEST_BN_even(bn))
2124 static int test_asc2bn(void)
2129 if (!TEST_ptr(bn = BN_new()))
2132 if (!TEST_true(BN_asc2bn(&bn, "0"))
2133 || !TEST_BN_eq_zero(bn)
2134 || !TEST_BN_ge_zero(bn))
2137 if (!TEST_true(BN_asc2bn(&bn, "256"))
2138 || !TEST_BN_eq_word(bn, 256)
2139 || !TEST_BN_ge_zero(bn))
2142 if (!TEST_true(BN_asc2bn(&bn, "-42"))
2143 || !TEST_BN_abs_eq_word(bn, 42)
2144 || !TEST_BN_lt_zero(bn))
2147 if (!TEST_true(BN_asc2bn(&bn, "0x1234"))
2148 || !TEST_BN_eq_word(bn, 0x1234)
2149 || !TEST_BN_ge_zero(bn))
2152 if (!TEST_true(BN_asc2bn(&bn, "0X1234"))
2153 || !TEST_BN_eq_word(bn, 0x1234)
2154 || !TEST_BN_ge_zero(bn))
2157 if (!TEST_true(BN_asc2bn(&bn, "-0xabcd"))
2158 || !TEST_BN_abs_eq_word(bn, 0xabcd)
2159 || !TEST_BN_lt_zero(bn))
2162 if (!TEST_true(BN_asc2bn(&bn, "-0"))
2163 || !TEST_BN_eq_zero(bn)
2164 || !TEST_BN_ge_zero(bn))
2167 if (!TEST_true(BN_asc2bn(&bn, "123trailing garbage is ignored"))
2168 || !TEST_BN_eq_word(bn, 123)
2169 || !TEST_BN_ge_zero(bn))
2178 static const MPITEST kMPITests[] = {
2179 {"0", "\x00\x00\x00\x00", 4},
2180 {"1", "\x00\x00\x00\x01\x01", 5},
2181 {"-1", "\x00\x00\x00\x01\x81", 5},
2182 {"128", "\x00\x00\x00\x02\x00\x80", 6},
2183 {"256", "\x00\x00\x00\x02\x01\x00", 6},
2184 {"-256", "\x00\x00\x00\x02\x81\x00", 6},
2187 static int test_mpi(int i)
2190 const MPITEST *test = &kMPITests[i];
2191 size_t mpi_len, mpi_len2;
2196 if (!TEST_ptr(bn = BN_new())
2197 || !TEST_true(BN_asc2bn(&bn, test->base10)))
2199 mpi_len = BN_bn2mpi(bn, NULL);
2200 if (!TEST_size_t_le(mpi_len, sizeof(scratch)))
2203 if (!TEST_size_t_eq(mpi_len2 = BN_bn2mpi(bn, scratch), mpi_len)
2204 || !TEST_mem_eq(test->mpi, test->mpi_len, scratch, mpi_len))
2207 if (!TEST_ptr(bn2 = BN_mpi2bn(scratch, mpi_len, NULL)))
2210 if (!TEST_BN_eq(bn, bn2)) {
2222 static int test_bin2zero(void)
2224 unsigned char input[] = { 0 };
2228 if (!TEST_ptr(zbn = BN_new()))
2231 #define zerotest(fn) \
2232 if (!TEST_ptr(fn(input, 1, zbn)) \
2233 || !TEST_true(BN_is_zero(zbn)) \
2234 || !TEST_ptr(fn(input, 0, zbn)) \
2235 || !TEST_true(BN_is_zero(zbn)) \
2236 || !TEST_ptr(fn(NULL, 0, zbn)) \
2237 || !TEST_true(BN_is_zero(zbn))) \
2240 zerotest(BN_bin2bn);
2241 zerotest(BN_signed_bin2bn);
2242 zerotest(BN_lebin2bn);
2243 zerotest(BN_signed_lebin2bn);
2252 static int test_bin2bn_lengths(void)
2254 unsigned char input[] = { 1, 2 };
2255 BIGNUM *bn_be = NULL, *bn_expected_be = NULL;
2256 BIGNUM *bn_le = NULL, *bn_expected_le = NULL;
2259 if (!TEST_ptr(bn_be = BN_new())
2260 || !TEST_ptr(bn_expected_be = BN_new())
2261 || !TEST_true(BN_set_word(bn_expected_be, 0x102))
2262 || !TEST_ptr(bn_le = BN_new())
2263 || !TEST_ptr(bn_expected_le = BN_new())
2264 || !TEST_true(BN_set_word(bn_expected_le, 0x201)))
2267 #define lengthtest(fn, e) \
2268 if (!TEST_ptr_null(fn(input, -1, bn_##e)) \
2269 || !TEST_ptr(fn(input, 0, bn_##e)) \
2270 || !TEST_true(BN_is_zero(bn_##e)) \
2271 || !TEST_ptr(fn(input, 2, bn_##e)) \
2272 || !TEST_int_eq(BN_cmp(bn_##e, bn_expected_##e), 0)) \
2275 lengthtest(BN_bin2bn, be);
2276 lengthtest(BN_signed_bin2bn, be);
2277 lengthtest(BN_lebin2bn, le);
2278 lengthtest(BN_signed_lebin2bn, le);
2284 BN_free(bn_expected_be);
2286 BN_free(bn_expected_le);
2290 static int test_rand(void)
2295 if (!TEST_ptr(bn = BN_new()))
2298 /* Test BN_rand for degenerate cases with |top| and |bottom| parameters. */
2299 if (!TEST_false(BN_rand(bn, 0, 0 /* top */ , 0 /* bottom */ ))
2300 || !TEST_false(BN_rand(bn, 0, 1 /* top */ , 1 /* bottom */ ))
2301 || !TEST_true(BN_rand(bn, 1, 0 /* top */ , 0 /* bottom */ ))
2302 || !TEST_BN_eq_one(bn)
2303 || !TEST_false(BN_rand(bn, 1, 1 /* top */ , 0 /* bottom */ ))
2304 || !TEST_true(BN_rand(bn, 1, -1 /* top */ , 1 /* bottom */ ))
2305 || !TEST_BN_eq_one(bn)
2306 || !TEST_true(BN_rand(bn, 2, 1 /* top */ , 0 /* bottom */ ))
2307 || !TEST_BN_eq_word(bn, 3))
2317 * Run some statistical tests to provide a degree confidence that the
2318 * BN_rand_range() function works as expected. The test cases and
2319 * critical values are generated by the bn_rand_range script.
2321 * Each individual test is a Chi^2 goodness of fit for a specified number
2322 * of samples and range. The samples are assumed to be independent and
2323 * that they are from a discrete uniform distribution.
2325 * Some of these individual tests are expected to fail, the success/failure
2326 * of each is an independent Bernoulli trial. The number of such successes
2327 * will form a binomial distribution. The count of the successes is compared
2328 * against a precomputed critical value to determine the overall outcome.
2330 struct rand_range_case {
2332 unsigned int iterations;
2336 #include "bn_rand_range.h"
2338 static int test_rand_range_single(size_t n)
2340 const unsigned int range = rand_range_cases[n].range;
2341 const unsigned int iterations = rand_range_cases[n].iterations;
2342 const double critical = rand_range_cases[n].critical;
2343 const double expected = iterations / (double)range;
2345 BIGNUM *rng = NULL, *val = NULL;
2350 if (!TEST_ptr(counts = OPENSSL_zalloc(sizeof(*counts) * range))
2351 || !TEST_ptr(rng = BN_new())
2352 || !TEST_ptr(val = BN_new())
2353 || !TEST_true(BN_set_word(rng, range)))
2355 for (i = 0; i < iterations; i++) {
2356 if (!TEST_true(BN_rand_range(val, rng))
2357 || !TEST_uint_lt(v = (unsigned int)BN_get_word(val), range))
2362 for (i = 0; i < range; i++) {
2363 const double delta = counts[i] - expected;
2364 sum += delta * delta;
2368 if (sum > critical) {
2369 TEST_info("Chi^2 test negative %.4f > %4.f", sum, critical);
2370 TEST_note("test case %zu range %u iterations %u", n + 1, range,
2379 OPENSSL_free(counts);
2383 static int test_rand_range(void)
2388 for (i = 0; i < OSSL_NELEM(rand_range_cases); i++)
2389 n_success += test_rand_range_single(i);
2390 if (TEST_int_ge(n_success, binomial_critical))
2392 TEST_note("This test is expected to fail by chance 0.01%% of the time.");
2396 static int test_negzero(void)
2398 BIGNUM *a = NULL, *b = NULL, *c = NULL, *d = NULL;
2399 BIGNUM *numerator = NULL, *denominator = NULL;
2400 int consttime, st = 0;
2402 if (!TEST_ptr(a = BN_new())
2403 || !TEST_ptr(b = BN_new())
2404 || !TEST_ptr(c = BN_new())
2405 || !TEST_ptr(d = BN_new()))
2408 /* Test that BN_mul never gives negative zero. */
2409 if (!TEST_true(BN_set_word(a, 1)))
2411 BN_set_negative(a, 1);
2413 if (!TEST_true(BN_mul(c, a, b, ctx)))
2415 if (!TEST_BN_eq_zero(c)
2416 || !TEST_BN_ge_zero(c))
2419 for (consttime = 0; consttime < 2; consttime++) {
2420 if (!TEST_ptr(numerator = BN_new())
2421 || !TEST_ptr(denominator = BN_new()))
2424 BN_set_flags(numerator, BN_FLG_CONSTTIME);
2425 BN_set_flags(denominator, BN_FLG_CONSTTIME);
2427 /* Test that BN_div never gives negative zero in the quotient. */
2428 if (!TEST_true(BN_set_word(numerator, 1))
2429 || !TEST_true(BN_set_word(denominator, 2)))
2431 BN_set_negative(numerator, 1);
2432 if (!TEST_true(BN_div(a, b, numerator, denominator, ctx))
2433 || !TEST_BN_eq_zero(a)
2434 || !TEST_BN_ge_zero(a))
2437 /* Test that BN_div never gives negative zero in the remainder. */
2438 if (!TEST_true(BN_set_word(denominator, 1))
2439 || !TEST_true(BN_div(a, b, numerator, denominator, ctx))
2440 || !TEST_BN_eq_zero(b)
2441 || !TEST_BN_ge_zero(b))
2444 BN_free(denominator);
2445 numerator = denominator = NULL;
2448 /* Test that BN_set_negative will not produce a negative zero. */
2450 BN_set_negative(a, 1);
2451 if (BN_is_negative(a))
2461 BN_free(denominator);
2465 static int test_badmod(void)
2467 BIGNUM *a = NULL, *b = NULL, *zero = NULL;
2468 BN_MONT_CTX *mont = NULL;
2471 if (!TEST_ptr(a = BN_new())
2472 || !TEST_ptr(b = BN_new())
2473 || !TEST_ptr(zero = BN_new())
2474 || !TEST_ptr(mont = BN_MONT_CTX_new()))
2478 if (!TEST_false(BN_div(a, b, BN_value_one(), zero, ctx)))
2482 if (!TEST_false(BN_mod_mul(a, BN_value_one(), BN_value_one(), zero, ctx)))
2486 if (!TEST_false(BN_mod_exp(a, BN_value_one(), BN_value_one(), zero, ctx)))
2490 if (!TEST_false(BN_mod_exp_mont(a, BN_value_one(), BN_value_one(),
2495 if (!TEST_false(BN_mod_exp_mont_consttime(a, BN_value_one(), BN_value_one(),
2500 if (!TEST_false(BN_MONT_CTX_set(mont, zero, ctx)))
2504 /* Some operations also may not be used with an even modulus. */
2505 if (!TEST_true(BN_set_word(b, 16)))
2508 if (!TEST_false(BN_MONT_CTX_set(mont, b, ctx)))
2512 if (!TEST_false(BN_mod_exp_mont(a, BN_value_one(), BN_value_one(),
2517 if (!TEST_false(BN_mod_exp_mont_consttime(a, BN_value_one(), BN_value_one(),
2527 BN_MONT_CTX_free(mont);
2531 static int test_expmodzero(void)
2533 BIGNUM *a = NULL, *r = NULL, *zero = NULL;
2536 if (!TEST_ptr(zero = BN_new())
2537 || !TEST_ptr(a = BN_new())
2538 || !TEST_ptr(r = BN_new()))
2542 if (!TEST_true(BN_mod_exp(r, a, zero, BN_value_one(), NULL))
2543 || !TEST_BN_eq_zero(r)
2544 || !TEST_true(BN_mod_exp_mont(r, a, zero, BN_value_one(),
2546 || !TEST_BN_eq_zero(r)
2547 || !TEST_true(BN_mod_exp_mont_consttime(r, a, zero,
2550 || !TEST_BN_eq_zero(r)
2551 || !TEST_true(BN_mod_exp_mont_word(r, 42, zero,
2552 BN_value_one(), NULL, NULL))
2553 || !TEST_BN_eq_zero(r))
2564 static int test_expmodone(void)
2567 BIGNUM *r = BN_new();
2568 BIGNUM *a = BN_new();
2569 BIGNUM *p = BN_new();
2570 BIGNUM *m = BN_new();
2577 || !TEST_true(BN_set_word(a, 1))
2578 || !TEST_true(BN_set_word(p, 0))
2579 || !TEST_true(BN_set_word(m, 1)))
2582 /* Calculate r = 1 ^ 0 mod 1, and check the result is always 0 */
2583 for (i = 0; i < 2; i++) {
2584 if (!TEST_true(BN_mod_exp(r, a, p, m, NULL))
2585 || !TEST_BN_eq_zero(r)
2586 || !TEST_true(BN_mod_exp_mont(r, a, p, m, NULL, NULL))
2587 || !TEST_BN_eq_zero(r)
2588 || !TEST_true(BN_mod_exp_mont_consttime(r, a, p, m, NULL, NULL))
2589 || !TEST_BN_eq_zero(r)
2590 || !TEST_true(BN_mod_exp_mont_word(r, 1, p, m, NULL, NULL))
2591 || !TEST_BN_eq_zero(r)
2592 || !TEST_true(BN_mod_exp_simple(r, a, p, m, NULL))
2593 || !TEST_BN_eq_zero(r)
2594 || !TEST_true(BN_mod_exp_recp(r, a, p, m, NULL))
2595 || !TEST_BN_eq_zero(r))
2597 /* Repeat for r = 1 ^ 0 mod -1 */
2599 BN_set_negative(m, 1);
2611 static int test_smallprime(int kBits)
2616 if (!TEST_ptr(r = BN_new()))
2620 if (!TEST_false(BN_generate_prime_ex(r, kBits, 0,
2624 if (!TEST_true(BN_generate_prime_ex(r, kBits, 0,
2626 || !TEST_int_eq(BN_num_bits(r), kBits))
2636 static int test_smallsafeprime(int kBits)
2641 if (!TEST_ptr(r = BN_new()))
2644 if (kBits <= 5 && kBits != 3) {
2645 if (!TEST_false(BN_generate_prime_ex(r, kBits, 1,
2649 if (!TEST_true(BN_generate_prime_ex(r, kBits, 1,
2651 || !TEST_int_eq(BN_num_bits(r), kBits))
2661 static int primes[] = { 2, 3, 5, 7, 17863 };
2663 static int test_is_prime(int i)
2669 if (!TEST_ptr(r = BN_new()))
2672 for (trial = 0; trial <= 1; ++trial) {
2673 if (!TEST_true(BN_set_word(r, primes[i]))
2674 || !TEST_int_eq(BN_check_prime(r, ctx, NULL),
2685 static int not_primes[] = { -1, 0, 1, 4 };
2687 static int test_not_prime(int i)
2693 if (!TEST_ptr(r = BN_new()))
2696 for (trial = 0; trial <= 1; ++trial) {
2697 if (!TEST_true(BN_set_word(r, not_primes[i]))
2698 || !TEST_false(BN_check_prime(r, ctx, NULL)))
2708 static int test_ctx_set_ct_flag(BN_CTX *c)
2715 for (i = 0; i < OSSL_NELEM(b); i++) {
2716 if (!TEST_ptr(b[i] = BN_CTX_get(c)))
2719 BN_set_flags(b[i], BN_FLG_CONSTTIME);
2728 static int test_ctx_check_ct_flag(BN_CTX *c)
2735 for (i = 0; i < OSSL_NELEM(b); i++) {
2736 if (!TEST_ptr(b[i] = BN_CTX_get(c)))
2738 if (!TEST_false(BN_get_flags(b[i], BN_FLG_CONSTTIME)))
2748 static int test_ctx_consttime_flag(void)
2751 * The constant-time flag should not "leak" among BN_CTX frames:
2753 * - test_ctx_set_ct_flag() starts a frame in the given BN_CTX and
2754 * sets the BN_FLG_CONSTTIME flag on some of the BIGNUMs obtained
2755 * from the frame before ending it.
2756 * - test_ctx_check_ct_flag() then starts a new frame and gets a
2757 * number of BIGNUMs from it. In absence of leaks, none of the
2758 * BIGNUMs in the new frame should have BN_FLG_CONSTTIME set.
2760 * In actual BN_CTX usage inside libcrypto the leak could happen at
2761 * any depth level in the BN_CTX stack, with varying results
2762 * depending on the patterns of sibling trees of nested function
2763 * calls sharing the same BN_CTX object, and the effect of
2764 * unintended BN_FLG_CONSTTIME on the called BN_* functions.
2766 * This simple unit test abstracts away this complexity and verifies
2767 * that the leak does not happen between two sibling functions
2768 * sharing the same BN_CTX object at the same level of nesting.
2771 BN_CTX *nctx = NULL;
2772 BN_CTX *sctx = NULL;
2776 if (!TEST_ptr(nctx = BN_CTX_new())
2777 || !TEST_ptr(sctx = BN_CTX_secure_new()))
2780 for (i = 0; i < 2; i++) {
2781 BN_CTX *c = i == 0 ? nctx : sctx;
2782 if (!TEST_true(test_ctx_set_ct_flag(c))
2783 || !TEST_true(test_ctx_check_ct_flag(c)))
2794 static int test_coprime(void)
2796 BIGNUM *a = NULL, *b = NULL;
2799 ret = TEST_ptr(a = BN_new())
2800 && TEST_ptr(b = BN_new())
2801 && TEST_true(BN_set_word(a, 66))
2802 && TEST_true(BN_set_word(b, 99))
2803 && TEST_int_eq(BN_are_coprime(a, b, ctx), 0)
2804 && TEST_int_eq(BN_are_coprime(b, a, ctx), 0)
2805 && TEST_true(BN_set_word(a, 67))
2806 && TEST_int_eq(BN_are_coprime(a, b, ctx), 1)
2807 && TEST_int_eq(BN_are_coprime(b, a, ctx), 1);
2813 static int test_gcd_prime(void)
2815 BIGNUM *a = NULL, *b = NULL, *gcd = NULL;
2818 if (!TEST_ptr(a = BN_new())
2819 || !TEST_ptr(b = BN_new())
2820 || !TEST_ptr(gcd = BN_new()))
2823 if (!TEST_true(BN_generate_prime_ex(a, 1024, 0, NULL, NULL, NULL)))
2825 for (i = 0; i < NUM_PRIME_TESTS; i++) {
2826 if (!TEST_true(BN_generate_prime_ex(b, 1024, 0,
2828 || !TEST_true(BN_gcd(gcd, a, b, ctx))
2829 || !TEST_true(BN_is_one(gcd))
2830 || !TEST_true(BN_are_coprime(a, b, ctx)))
2842 typedef struct mod_exp_test_st
2850 static const MOD_EXP_TEST ModExpTests[] = {
2851 /* original test vectors for rsaz_512_sqr bug, by OSS-Fuzz */
2853 "1166180238001879113042182292626169621106255558914000595999312084"
2854 "4627946820899490684928760491249738643524880720584249698100907201"
2855 "002086675047927600340800371",
2856 "8000000000000000000000000000000000000000000000000000000000000000"
2857 "0000000000000000000000000000000000000000000000000000000000000000"
2859 "1340780792684523720980737645613191762604395855615117867483316354"
2860 "3294276330515137663421134775482798690129946803802212663956180562"
2861 "088664022929883876655300863",
2862 "8243904058268085430037326628480645845409758077568738532059032482"
2863 "8294114415890603594730158120426756266457928475330450251339773498"
2864 "26758407619521544102068438"
2867 "4974270041410803822078866696159586946995877618987010219312844726"
2868 "0284386121835740784990869050050504348861513337232530490826340663"
2869 "197278031692737429054",
2870 "4974270041410803822078866696159586946995877428188754995041148539"
2871 "1663243362592271353668158565195557417149981094324650322556843202"
2872 "946445882670777892608",
2873 "1340780716511420227215592830971452482815377482627251725537099028"
2874 "4429769497230131760206012644403029349547320953206103351725462999"
2875 "947509743623340557059752191",
2876 "5296244594780707015616522701706118082963369547253192207884519362"
2877 "1767869984947542695665420219028522815539559194793619684334900442"
2878 "49304558011362360473525933"
2880 /* test vectors for rsaz_512_srq bug, with rcx/rbx=1 */
2881 { /* between first and second iteration */
2882 "5148719036160389201525610950887605325980251964889646556085286545"
2883 "3931548809178823413169359635978762036512397113080988070677858033"
2884 "36463909753993540214027190",
2885 "6703903964971298549787012499102923063739682910296196688861780721"
2886 "8608820150367734884009371490834517138450159290932430254268769414"
2887 "05973284973216824503042158",
2888 "6703903964971298549787012499102923063739682910296196688861780721"
2889 "8608820150367734884009371490834517138450159290932430254268769414"
2890 "05973284973216824503042159",
2893 { /* between second and third iteration */
2894 "8908340854353752577419678771330460827942371434853054158622636544"
2895 "8151360109722890949471912566649465436296659601091730745087014189"
2896 "2672764191218875181826063",
2897 "6703903964971298549787012499102923063739682910296196688861780721"
2898 "8608820150367734884009371490834517138450159290932430254268769414"
2899 "05973284973216824503042158",
2900 "6703903964971298549787012499102923063739682910296196688861780721"
2901 "8608820150367734884009371490834517138450159290932430254268769414"
2902 "05973284973216824503042159",
2905 { /* between third and fourth iteration */
2906 "3427446396505596330634350984901719674479522569002785244080234738"
2907 "4288743635435746136297299366444548736533053717416735379073185344"
2908 "26985272974404612945608761",
2909 "6703903964971298549787012499102923063739682910296196688861780721"
2910 "8608820150367734884009371490834517138450159290932430254268769414"
2911 "05973284973216824503042158",
2912 "6703903964971298549787012499102923063739682910296196688861780721"
2913 "8608820150367734884009371490834517138450159290932430254268769414"
2914 "05973284973216824503042159",
2917 { /* between fourth and fifth iteration */
2918 "3472743044917564564078857826111874560045331237315597383869652985"
2919 "6919870028890895988478351133601517365908445058405433832718206902"
2920 "4088133164805266956353542",
2921 "6703903964971298549787012499102923063739682910296196688861780721"
2922 "8608820150367734884009371490834517138450159290932430254268769414"
2923 "05973284973216824503042158",
2924 "6703903964971298549787012499102923063739682910296196688861780721"
2925 "8608820150367734884009371490834517138450159290932430254268769414"
2926 "05973284973216824503042159",
2929 { /* between fifth and sixth iteration */
2930 "3608632990153469264412378349742339216742409743898601587274768025"
2931 "0110772032985643555192767717344946174122842255204082586753499651"
2932 "14483434992887431333675068",
2933 "6703903964971298549787012499102923063739682910296196688861780721"
2934 "8608820150367734884009371490834517138450159290932430254268769414"
2935 "05973284973216824503042158",
2936 "6703903964971298549787012499102923063739682910296196688861780721"
2937 "8608820150367734884009371490834517138450159290932430254268769414"
2938 "05973284973216824503042159",
2941 { /* between sixth and seventh iteration */
2942 "8455374370234070242910508226941981520235709767260723212165264877"
2943 "8689064388017521524568434328264431772644802567028663962962025746"
2944 "9283458217850119569539086",
2945 "6703903964971298549787012499102923063739682910296196688861780721"
2946 "8608820150367734884009371490834517138450159290932430254268769414"
2947 "05973284973216824503042158",
2948 "6703903964971298549787012499102923063739682910296196688861780721"
2949 "8608820150367734884009371490834517138450159290932430254268769414"
2950 "05973284973216824503042159",
2953 { /* between seventh and eighth iteration */
2954 "5155371529688532178421209781159131443543419764974688878527112131"
2955 "7446518205609427412336183157918981038066636807317733319323257603"
2956 "04416292040754017461076359",
2957 "1005585594745694782468051874865438459560952436544429503329267108"
2958 "2791323022555160232601405723625177570767523893639864538140315412"
2959 "108959927459825236754563832",
2960 "1005585594745694782468051874865438459560952436544429503329267108"
2961 "2791323022555160232601405723625177570767523893639864538140315412"
2962 "108959927459825236754563833",
2965 /* test vectors for rsaz_512_srq bug, with rcx/rbx=2 */
2966 { /* between first and second iteration */
2967 "3155666506033786929967309937640790361084670559125912405342594979"
2968 "4345142818528956285490897841406338022378565972533508820577760065"
2969 "58494345853302083699912572",
2970 "6703903964971298549787012499102923063739682910296196688861780721"
2971 "8608820150367734884009371490834517138450159290932430254268769414"
2972 "05973284973216824503042158",
2973 "6703903964971298549787012499102923063739682910296196688861780721"
2974 "8608820150367734884009371490834517138450159290932430254268769414"
2975 "05973284973216824503042159",
2978 { /* between second and third iteration */
2979 "3789819583801342198190405714582958759005991915505282362397087750"
2980 "4213544724644823098843135685133927198668818185338794377239590049"
2981 "41019388529192775771488319",
2982 "6703903964971298549787012499102923063739682910296196688861780721"
2983 "8608820150367734884009371490834517138450159290932430254268769414"
2984 "05973284973216824503042158",
2985 "6703903964971298549787012499102923063739682910296196688861780721"
2986 "8608820150367734884009371490834517138450159290932430254268769414"
2987 "05973284973216824503042159",
2990 { /* between third and forth iteration */
2991 "4695752552040706867080542538786056470322165281761525158189220280"
2992 "4025547447667484759200742764246905647644662050122968912279199065"
2993 "48065034299166336940507214",
2994 "6703903964971298549787012499102923063739682910296196688861780721"
2995 "8608820150367734884009371490834517138450159290932430254268769414"
2996 "05973284973216824503042158",
2997 "6703903964971298549787012499102923063739682910296196688861780721"
2998 "8608820150367734884009371490834517138450159290932430254268769414"
2999 "05973284973216824503042159",
3002 { /* between forth and fifth iteration */
3003 "2159140240970485794188159431017382878636879856244045329971239574"
3004 "8919691133560661162828034323196457386059819832804593989740268964"
3005 "74502911811812651475927076",
3006 "6703903964971298549787012499102923063739682910296196688861780721"
3007 "8608820150367734884009371490834517138450159290932430254268769414"
3008 "05973284973216824503042158",
3009 "6703903964971298549787012499102923063739682910296196688861780721"
3010 "8608820150367734884009371490834517138450159290932430254268769414"
3011 "05973284973216824503042159",
3014 { /* between fifth and sixth iteration */
3015 "5239312332984325668414624633307915097111691815000872662334695514"
3016 "5436533521392362443557163429336808208137221322444780490437871903"
3017 "99972784701334569424519255",
3018 "6703903964971298549787012499102923063739682910296196688861780721"
3019 "8608820150367734884009371490834517138450159290932430254268769414"
3020 "05973284973216824503042158",
3021 "6703903964971298549787012499102923063739682910296196688861780721"
3022 "8608820150367734884009371490834517138450159290932430254268769414"
3023 "05973284973216824503042159",
3026 { /* between sixth and seventh iteration */
3027 "1977953647322612860406858017869125467496941904523063466791308891"
3028 "1172796739058531929470539758361774569875505293428856181093904091"
3029 "33788264851714311303725089",
3030 "6703903964971298549787012499102923063739682910296196688861780721"
3031 "8608820150367734884009371490834517138450159290932430254268769414"
3032 "05973284973216824503042158",
3033 "6703903964971298549787012499102923063739682910296196688861780721"
3034 "8608820150367734884009371490834517138450159290932430254268769414"
3035 "05973284973216824503042159",
3038 { /* between seventh and eighth iteration */
3039 "6456987954117763835533395796948878140715006860263624787492985786"
3040 "8514630216966738305923915688821526449499763719943997120302368211"
3041 "04813318117996225041943964",
3042 "1340780792994259709957402499820584612747936582059239337772356144"
3043 "3721764030073546976801874298166903427690031858186486050853753882"
3044 "811946551499689575296532556",
3045 "1340780792994259709957402499820584612747936582059239337772356144"
3046 "3721764030073546976801874298166903427690031858186486050853753882"
3047 "811946551499689575296532557",
3052 static int test_mod_exp(int i)
3054 const MOD_EXP_TEST *test = &ModExpTests[i];
3056 BIGNUM* result = NULL;
3057 BIGNUM *base = NULL, *exponent = NULL, *modulo = NULL;
3060 if (!TEST_ptr(result = BN_new())
3061 || !TEST_true(BN_dec2bn(&base, test->base))
3062 || !TEST_true(BN_dec2bn(&exponent, test->exp))
3063 || !TEST_true(BN_dec2bn(&modulo, test->mod)))
3066 if (!TEST_int_eq(BN_mod_exp(result, base, exponent, modulo, ctx), 1))
3069 if (!TEST_ptr(s = BN_bn2dec(result)))
3072 if (!TEST_mem_eq(s, strlen(s), test->res, strlen(test->res)))
3086 static int test_mod_exp_consttime(int i)
3088 const MOD_EXP_TEST *test = &ModExpTests[i];
3090 BIGNUM* result = NULL;
3091 BIGNUM *base = NULL, *exponent = NULL, *modulo = NULL;
3094 if (!TEST_ptr(result = BN_new())
3095 || !TEST_true(BN_dec2bn(&base, test->base))
3096 || !TEST_true(BN_dec2bn(&exponent, test->exp))
3097 || !TEST_true(BN_dec2bn(&modulo, test->mod)))
3100 BN_set_flags(base, BN_FLG_CONSTTIME);
3101 BN_set_flags(exponent, BN_FLG_CONSTTIME);
3102 BN_set_flags(modulo, BN_FLG_CONSTTIME);
3104 if (!TEST_int_eq(BN_mod_exp(result, base, exponent, modulo, ctx), 1))
3107 if (!TEST_ptr(s = BN_bn2dec(result)))
3110 if (!TEST_mem_eq(s, strlen(s), test->res, strlen(test->res)))
3125 * Regression test to ensure BN_mod_exp2_mont fails safely if argument m is
3128 static int test_mod_exp2_mont(void)
3131 BIGNUM *exp_result = NULL;
3132 BIGNUM *exp_a1 = NULL, *exp_p1 = NULL, *exp_a2 = NULL, *exp_p2 = NULL,
3135 if (!TEST_ptr(exp_result = BN_new())
3136 || !TEST_ptr(exp_a1 = BN_new())
3137 || !TEST_ptr(exp_p1 = BN_new())
3138 || !TEST_ptr(exp_a2 = BN_new())
3139 || !TEST_ptr(exp_p2 = BN_new())
3140 || !TEST_ptr(exp_m = BN_new()))
3143 if (!TEST_true(BN_one(exp_a1))
3144 || !TEST_true(BN_one(exp_p1))
3145 || !TEST_true(BN_one(exp_a2))
3146 || !TEST_true(BN_one(exp_p2)))
3151 /* input of 0 is even, so must fail */
3152 if (!TEST_int_eq(BN_mod_exp2_mont(exp_result, exp_a1, exp_p1, exp_a2,
3153 exp_p2, exp_m, ctx, NULL), 0))
3159 BN_free(exp_result);
3168 static int file_test_run(STANZA *s)
3170 static const FILETEST filetests[] = {
3172 {"LShift1", file_lshift1},
3173 {"LShift", file_lshift},
3174 {"RShift", file_rshift},
3175 {"Square", file_square},
3176 {"Product", file_product},
3177 {"Quotient", file_quotient},
3178 {"ModMul", file_modmul},
3179 {"ModExp", file_modexp},
3181 {"ModSqrt", file_modsqrt},
3184 int numtests = OSSL_NELEM(filetests);
3185 const FILETEST *tp = filetests;
3187 for ( ; --numtests >= 0; tp++) {
3188 if (findattr(s, tp->name) != NULL) {
3190 TEST_info("%s:%d: Failed %s test",
3191 s->test_file, s->start, tp->name);
3197 TEST_info("%s:%d: Unknown test", s->test_file, s->start);
3201 static int run_file_tests(int i)
3204 char *testfile = test_get_argument(i);
3207 if (!TEST_ptr(s = OPENSSL_zalloc(sizeof(*s))))
3209 if (!test_start_file(s, testfile)) {
3214 /* Read test file. */
3215 while (!BIO_eof(s->fp) && test_readstanza(s)) {
3216 if (s->numpairs == 0)
3218 if (!file_test_run(s))
3221 test_clearstanza(s);
3230 typedef enum OPTION_choice {
3233 OPT_STOCHASTIC_TESTS,
3237 const OPTIONS *test_get_options(void)
3239 static const OPTIONS test_options[] = {
3240 OPT_TEST_OPTIONS_WITH_EXTRA_USAGE("[file...]\n"),
3241 { "stochastic", OPT_STOCHASTIC_TESTS, '-', "Run stochastic tests" },
3242 { OPT_HELP_STR, 1, '-',
3243 "file\tFile to run tests on. Normal tests are not run\n" },
3246 return test_options;
3249 int setup_tests(void)
3252 int n, stochastic = 0;
3254 while ((o = opt_next()) != OPT_EOF) {
3256 case OPT_STOCHASTIC_TESTS:
3259 case OPT_TEST_CASES:
3266 n = test_get_argument_count();
3268 if (!TEST_ptr(ctx = BN_CTX_new()))
3273 ADD_TEST(test_div_recip);
3274 ADD_ALL_TESTS(test_signed_mod_replace_ab, OSSL_NELEM(signed_mod_tests));
3275 ADD_ALL_TESTS(test_signed_mod_replace_ba, OSSL_NELEM(signed_mod_tests));
3277 ADD_TEST(test_modexp_mont5);
3278 ADD_TEST(test_kronecker);
3279 ADD_TEST(test_rand);
3280 ADD_TEST(test_bn2padded);
3281 ADD_TEST(test_dec2bn);
3282 ADD_TEST(test_hex2bn);
3283 ADD_TEST(test_asc2bn);
3284 ADD_TEST(test_bin2zero);
3285 ADD_TEST(test_bin2bn_lengths);
3286 ADD_ALL_TESTS(test_mpi, (int)OSSL_NELEM(kMPITests));
3287 ADD_ALL_TESTS(test_bn2signed, (int)OSSL_NELEM(kSignedTests_BE));
3288 ADD_TEST(test_negzero);
3289 ADD_TEST(test_badmod);
3290 ADD_TEST(test_expmodzero);
3291 ADD_TEST(test_expmodone);
3292 ADD_ALL_TESTS(test_smallprime, 16);
3293 ADD_ALL_TESTS(test_smallsafeprime, 16);
3294 ADD_TEST(test_swap);
3295 ADD_TEST(test_ctx_consttime_flag);
3296 #ifndef OPENSSL_NO_EC2M
3297 ADD_TEST(test_gf2m_add);
3298 ADD_TEST(test_gf2m_mod);
3299 ADD_TEST(test_gf2m_mul);
3300 ADD_TEST(test_gf2m_sqr);
3301 ADD_TEST(test_gf2m_modinv);
3302 ADD_TEST(test_gf2m_moddiv);
3303 ADD_TEST(test_gf2m_modexp);
3304 ADD_TEST(test_gf2m_modsqrt);
3305 ADD_TEST(test_gf2m_modsolvequad);
3307 ADD_ALL_TESTS(test_is_prime, (int)OSSL_NELEM(primes));
3308 ADD_ALL_TESTS(test_not_prime, (int)OSSL_NELEM(not_primes));
3309 ADD_TEST(test_gcd_prime);
3310 ADD_TEST(test_coprime);
3311 ADD_ALL_TESTS(test_mod_exp, (int)OSSL_NELEM(ModExpTests));
3312 ADD_ALL_TESTS(test_mod_exp_consttime, (int)OSSL_NELEM(ModExpTests));
3313 ADD_TEST(test_mod_exp2_mont);
3315 ADD_TEST(test_rand_range);
3317 ADD_ALL_TESTS(run_file_tests, n);
3322 void cleanup_tests(void)