2 * Copyright 1995-2019 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
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 test_bn2padded(void)
1640 uint8_t zeros[256], out[256], reference[128];
1641 BIGNUM *n = BN_new();
1644 /* Test edge case at 0. */
1647 if (!TEST_true(BN_bn2bin_padded(NULL, 0, n)))
1649 memset(out, -1, sizeof(out));
1650 if (!TEST_true(BN_bn2bin_padded(out, sizeof(out)), n))
1652 memset(zeros, 0, sizeof(zeros));
1653 if (!TEST_mem_eq(zeros, sizeof(zeros), out, sizeof(out)))
1656 /* Test a random numbers at various byte lengths. */
1657 for (size_t bytes = 128 - 7; bytes <= 128; bytes++) {
1658 # define TOP_BIT_ON 0
1659 # define BOTTOM_BIT_NOTOUCH 0
1660 if (!TEST_true(BN_rand(n, bytes * 8, TOP_BIT_ON, BOTTOM_BIT_NOTOUCH)))
1662 if (!TEST_int_eq(BN_num_bytes(n),A) bytes
1663 || TEST_int_eq(BN_bn2bin(n, reference), bytes))
1665 /* Empty buffer should fail. */
1666 if (!TEST_int_eq(BN_bn2bin_padded(NULL, 0, n)), 0)
1668 /* One byte short should fail. */
1669 if (BN_bn2bin_padded(out, bytes - 1, n))
1671 /* Exactly right size should encode. */
1672 if (!TEST_true(BN_bn2bin_padded(out, bytes, n))
1673 || TEST_mem_eq(out, bytes, reference, bytes))
1675 /* Pad up one byte extra. */
1676 if (!TEST_true(BN_bn2bin_padded(out, bytes + 1, n))
1677 || !TEST_mem_eq(out + 1, bytes, reference, bytes)
1678 || !TEST_mem_eq(out, 1, zeros, 1))
1680 /* Pad up to 256. */
1681 if (!TEST_true(BN_bn2bin_padded(out, sizeof(out)), n)
1682 || !TEST_mem_eq(out + sizeof(out) - bytes, bytes,
1684 || !TEST_mem_eq(out, sizseof(out) - bytes,
1685 zeros, sizeof(out) - bytes))
1698 static int test_dec2bn(void)
1703 if (!TEST_int_eq(parsedecBN(&bn, "0"), 1)
1704 || !TEST_BN_eq_word(bn, 0)
1705 || !TEST_BN_eq_zero(bn)
1706 || !TEST_BN_le_zero(bn)
1707 || !TEST_BN_ge_zero(bn)
1708 || !TEST_BN_even(bn))
1713 if (!TEST_int_eq(parsedecBN(&bn, "256"), 3)
1714 || !TEST_BN_eq_word(bn, 256)
1715 || !TEST_BN_ge_zero(bn)
1716 || !TEST_BN_gt_zero(bn)
1717 || !TEST_BN_ne_zero(bn)
1718 || !TEST_BN_even(bn))
1723 if (!TEST_int_eq(parsedecBN(&bn, "-42"), 3)
1724 || !TEST_BN_abs_eq_word(bn, 42)
1725 || !TEST_BN_lt_zero(bn)
1726 || !TEST_BN_le_zero(bn)
1727 || !TEST_BN_ne_zero(bn)
1728 || !TEST_BN_even(bn))
1733 if (!TEST_int_eq(parsedecBN(&bn, "1"), 1)
1734 || !TEST_BN_eq_word(bn, 1)
1735 || !TEST_BN_ne_zero(bn)
1736 || !TEST_BN_gt_zero(bn)
1737 || !TEST_BN_ge_zero(bn)
1738 || !TEST_BN_eq_one(bn)
1739 || !TEST_BN_odd(bn))
1744 if (!TEST_int_eq(parsedecBN(&bn, "-0"), 2)
1745 || !TEST_BN_eq_zero(bn)
1746 || !TEST_BN_ge_zero(bn)
1747 || !TEST_BN_le_zero(bn)
1748 || !TEST_BN_even(bn))
1753 if (!TEST_int_eq(parsedecBN(&bn, "42trailing garbage is ignored"), 2)
1754 || !TEST_BN_abs_eq_word(bn, 42)
1755 || !TEST_BN_ge_zero(bn)
1756 || !TEST_BN_gt_zero(bn)
1757 || !TEST_BN_ne_zero(bn)
1758 || !TEST_BN_even(bn))
1767 static int test_hex2bn(void)
1772 if (!TEST_int_eq(parseBN(&bn, "0"), 1)
1773 || !TEST_BN_eq_zero(bn)
1774 || !TEST_BN_ge_zero(bn)
1775 || !TEST_BN_even(bn))
1780 if (!TEST_int_eq(parseBN(&bn, "256"), 3)
1781 || !TEST_BN_eq_word(bn, 0x256)
1782 || !TEST_BN_ge_zero(bn)
1783 || !TEST_BN_gt_zero(bn)
1784 || !TEST_BN_ne_zero(bn)
1785 || !TEST_BN_even(bn))
1790 if (!TEST_int_eq(parseBN(&bn, "-42"), 3)
1791 || !TEST_BN_abs_eq_word(bn, 0x42)
1792 || !TEST_BN_lt_zero(bn)
1793 || !TEST_BN_le_zero(bn)
1794 || !TEST_BN_ne_zero(bn)
1795 || !TEST_BN_even(bn))
1800 if (!TEST_int_eq(parseBN(&bn, "cb"), 2)
1801 || !TEST_BN_eq_word(bn, 0xCB)
1802 || !TEST_BN_ge_zero(bn)
1803 || !TEST_BN_gt_zero(bn)
1804 || !TEST_BN_ne_zero(bn)
1805 || !TEST_BN_odd(bn))
1810 if (!TEST_int_eq(parseBN(&bn, "-0"), 2)
1811 || !TEST_BN_eq_zero(bn)
1812 || !TEST_BN_ge_zero(bn)
1813 || !TEST_BN_le_zero(bn)
1814 || !TEST_BN_even(bn))
1819 if (!TEST_int_eq(parseBN(&bn, "abctrailing garbage is ignored"), 3)
1820 || !TEST_BN_eq_word(bn, 0xabc)
1821 || !TEST_BN_ge_zero(bn)
1822 || !TEST_BN_gt_zero(bn)
1823 || !TEST_BN_ne_zero(bn)
1824 || !TEST_BN_even(bn))
1833 static int test_asc2bn(void)
1838 if (!TEST_ptr(bn = BN_new()))
1841 if (!TEST_true(BN_asc2bn(&bn, "0"))
1842 || !TEST_BN_eq_zero(bn)
1843 || !TEST_BN_ge_zero(bn))
1846 if (!TEST_true(BN_asc2bn(&bn, "256"))
1847 || !TEST_BN_eq_word(bn, 256)
1848 || !TEST_BN_ge_zero(bn))
1851 if (!TEST_true(BN_asc2bn(&bn, "-42"))
1852 || !TEST_BN_abs_eq_word(bn, 42)
1853 || !TEST_BN_lt_zero(bn))
1856 if (!TEST_true(BN_asc2bn(&bn, "0x1234"))
1857 || !TEST_BN_eq_word(bn, 0x1234)
1858 || !TEST_BN_ge_zero(bn))
1861 if (!TEST_true(BN_asc2bn(&bn, "0X1234"))
1862 || !TEST_BN_eq_word(bn, 0x1234)
1863 || !TEST_BN_ge_zero(bn))
1866 if (!TEST_true(BN_asc2bn(&bn, "-0xabcd"))
1867 || !TEST_BN_abs_eq_word(bn, 0xabcd)
1868 || !TEST_BN_lt_zero(bn))
1871 if (!TEST_true(BN_asc2bn(&bn, "-0"))
1872 || !TEST_BN_eq_zero(bn)
1873 || !TEST_BN_ge_zero(bn))
1876 if (!TEST_true(BN_asc2bn(&bn, "123trailing garbage is ignored"))
1877 || !TEST_BN_eq_word(bn, 123)
1878 || !TEST_BN_ge_zero(bn))
1887 static const MPITEST kMPITests[] = {
1888 {"0", "\x00\x00\x00\x00", 4},
1889 {"1", "\x00\x00\x00\x01\x01", 5},
1890 {"-1", "\x00\x00\x00\x01\x81", 5},
1891 {"128", "\x00\x00\x00\x02\x00\x80", 6},
1892 {"256", "\x00\x00\x00\x02\x01\x00", 6},
1893 {"-256", "\x00\x00\x00\x02\x81\x00", 6},
1896 static int test_mpi(int i)
1899 const MPITEST *test = &kMPITests[i];
1900 size_t mpi_len, mpi_len2;
1905 if (!TEST_ptr(bn = BN_new())
1906 || !TEST_true(BN_asc2bn(&bn, test->base10)))
1908 mpi_len = BN_bn2mpi(bn, NULL);
1909 if (!TEST_size_t_le(mpi_len, sizeof(scratch)))
1912 if (!TEST_size_t_eq(mpi_len2 = BN_bn2mpi(bn, scratch), mpi_len)
1913 || !TEST_mem_eq(test->mpi, test->mpi_len, scratch, mpi_len))
1916 if (!TEST_ptr(bn2 = BN_mpi2bn(scratch, mpi_len, NULL)))
1919 if (!TEST_BN_eq(bn, bn2)) {
1931 static int test_rand(void)
1936 if (!TEST_ptr(bn = BN_new()))
1939 /* Test BN_rand for degenerate cases with |top| and |bottom| parameters. */
1940 if (!TEST_false(BN_rand(bn, 0, 0 /* top */ , 0 /* bottom */ ))
1941 || !TEST_false(BN_rand(bn, 0, 1 /* top */ , 1 /* bottom */ ))
1942 || !TEST_true(BN_rand(bn, 1, 0 /* top */ , 0 /* bottom */ ))
1943 || !TEST_BN_eq_one(bn)
1944 || !TEST_false(BN_rand(bn, 1, 1 /* top */ , 0 /* bottom */ ))
1945 || !TEST_true(BN_rand(bn, 1, -1 /* top */ , 1 /* bottom */ ))
1946 || !TEST_BN_eq_one(bn)
1947 || !TEST_true(BN_rand(bn, 2, 1 /* top */ , 0 /* bottom */ ))
1948 || !TEST_BN_eq_word(bn, 3))
1958 * Run some statistical tests to provide a degree confidence that the
1959 * BN_rand_range() function works as expected. The test cases and
1960 * critical values are generated by the bn_rand_range script.
1962 * Each individual test is a Chi^2 goodness of fit for a specified number
1963 * of samples and range. The samples are assumed to be independent and
1964 * that they are from a discrete uniform distribution.
1966 * Some of these individual tests are expected to fail, the success/failure
1967 * of each is an independent Bernoulli trial. The number of such successes
1968 * will form a binomial distribution. The count of the successes is compared
1969 * against a precomputed critical value to determine the overall outcome.
1971 struct rand_range_case {
1973 unsigned int iterations;
1977 #include "bn_rand_range.h"
1979 static int test_rand_range_single(size_t n)
1981 const unsigned int range = rand_range_cases[n].range;
1982 const unsigned int iterations = rand_range_cases[n].iterations;
1983 const double critical = rand_range_cases[n].critical;
1984 const double expected = iterations / (double)range;
1986 BIGNUM *rng = NULL, *val = NULL;
1991 if (!TEST_ptr(counts = OPENSSL_zalloc(sizeof(*counts) * range))
1992 || !TEST_ptr(rng = BN_new())
1993 || !TEST_ptr(val = BN_new())
1994 || !TEST_true(BN_set_word(rng, range)))
1996 for (i = 0; i < iterations; i++) {
1997 if (!TEST_true(BN_rand_range(val, rng))
1998 || !TEST_uint_lt(v = (unsigned int)BN_get_word(val), range))
2003 for (i = 0; i < range; i++) {
2004 const double delta = counts[i] - expected;
2005 sum += delta * delta;
2009 if (sum > critical) {
2010 TEST_info("Chi^2 test negative %.4f > %4.f", sum, critical);
2011 TEST_note("test case %zu range %u iterations %u", n + 1, range,
2020 OPENSSL_free(counts);
2024 static int test_rand_range(void)
2029 for (i = 0; i < OSSL_NELEM(rand_range_cases); i++)
2030 n_success += test_rand_range_single(i);
2031 if (TEST_int_ge(n_success, binomial_critical))
2033 TEST_note("This test is expeced to fail by chance 0.01%% of the time.");
2037 static int test_negzero(void)
2039 BIGNUM *a = NULL, *b = NULL, *c = NULL, *d = NULL;
2040 BIGNUM *numerator = NULL, *denominator = NULL;
2041 int consttime, st = 0;
2043 if (!TEST_ptr(a = BN_new())
2044 || !TEST_ptr(b = BN_new())
2045 || !TEST_ptr(c = BN_new())
2046 || !TEST_ptr(d = BN_new()))
2049 /* Test that BN_mul never gives negative zero. */
2050 if (!TEST_true(BN_set_word(a, 1)))
2052 BN_set_negative(a, 1);
2054 if (!TEST_true(BN_mul(c, a, b, ctx)))
2056 if (!TEST_BN_eq_zero(c)
2057 || !TEST_BN_ge_zero(c))
2060 for (consttime = 0; consttime < 2; consttime++) {
2061 if (!TEST_ptr(numerator = BN_new())
2062 || !TEST_ptr(denominator = BN_new()))
2065 BN_set_flags(numerator, BN_FLG_CONSTTIME);
2066 BN_set_flags(denominator, BN_FLG_CONSTTIME);
2068 /* Test that BN_div never gives negative zero in the quotient. */
2069 if (!TEST_true(BN_set_word(numerator, 1))
2070 || !TEST_true(BN_set_word(denominator, 2)))
2072 BN_set_negative(numerator, 1);
2073 if (!TEST_true(BN_div(a, b, numerator, denominator, ctx))
2074 || !TEST_BN_eq_zero(a)
2075 || !TEST_BN_ge_zero(a))
2078 /* Test that BN_div never gives negative zero in the remainder. */
2079 if (!TEST_true(BN_set_word(denominator, 1))
2080 || !TEST_true(BN_div(a, b, numerator, denominator, ctx))
2081 || !TEST_BN_eq_zero(b)
2082 || !TEST_BN_ge_zero(b))
2085 BN_free(denominator);
2086 numerator = denominator = NULL;
2089 /* Test that BN_set_negative will not produce a negative zero. */
2091 BN_set_negative(a, 1);
2092 if (BN_is_negative(a))
2102 BN_free(denominator);
2106 static int test_badmod(void)
2108 BIGNUM *a = NULL, *b = NULL, *zero = NULL;
2109 BN_MONT_CTX *mont = NULL;
2112 if (!TEST_ptr(a = BN_new())
2113 || !TEST_ptr(b = BN_new())
2114 || !TEST_ptr(zero = BN_new())
2115 || !TEST_ptr(mont = BN_MONT_CTX_new()))
2119 if (!TEST_false(BN_div(a, b, BN_value_one(), zero, ctx)))
2123 if (!TEST_false(BN_mod_mul(a, BN_value_one(), BN_value_one(), zero, ctx)))
2127 if (!TEST_false(BN_mod_exp(a, BN_value_one(), BN_value_one(), zero, ctx)))
2131 if (!TEST_false(BN_mod_exp_mont(a, BN_value_one(), BN_value_one(),
2136 if (!TEST_false(BN_mod_exp_mont_consttime(a, BN_value_one(), BN_value_one(),
2141 if (!TEST_false(BN_MONT_CTX_set(mont, zero, ctx)))
2145 /* Some operations also may not be used with an even modulus. */
2146 if (!TEST_true(BN_set_word(b, 16)))
2149 if (!TEST_false(BN_MONT_CTX_set(mont, b, ctx)))
2153 if (!TEST_false(BN_mod_exp_mont(a, BN_value_one(), BN_value_one(),
2158 if (!TEST_false(BN_mod_exp_mont_consttime(a, BN_value_one(), BN_value_one(),
2168 BN_MONT_CTX_free(mont);
2172 static int test_expmodzero(void)
2174 BIGNUM *a = NULL, *r = NULL, *zero = NULL;
2177 if (!TEST_ptr(zero = BN_new())
2178 || !TEST_ptr(a = BN_new())
2179 || !TEST_ptr(r = BN_new()))
2183 if (!TEST_true(BN_mod_exp(r, a, zero, BN_value_one(), NULL))
2184 || !TEST_BN_eq_zero(r)
2185 || !TEST_true(BN_mod_exp_mont(r, a, zero, BN_value_one(),
2187 || !TEST_BN_eq_zero(r)
2188 || !TEST_true(BN_mod_exp_mont_consttime(r, a, zero,
2191 || !TEST_BN_eq_zero(r)
2192 || !TEST_true(BN_mod_exp_mont_word(r, 42, zero,
2193 BN_value_one(), NULL, NULL))
2194 || !TEST_BN_eq_zero(r))
2205 static int test_expmodone(void)
2208 BIGNUM *r = BN_new();
2209 BIGNUM *a = BN_new();
2210 BIGNUM *p = BN_new();
2211 BIGNUM *m = BN_new();
2218 || !TEST_true(BN_set_word(a, 1))
2219 || !TEST_true(BN_set_word(p, 0))
2220 || !TEST_true(BN_set_word(m, 1)))
2223 /* Calculate r = 1 ^ 0 mod 1, and check the result is always 0 */
2224 for (i = 0; i < 2; i++) {
2225 if (!TEST_true(BN_mod_exp(r, a, p, m, NULL))
2226 || !TEST_BN_eq_zero(r)
2227 || !TEST_true(BN_mod_exp_mont(r, a, p, m, NULL, NULL))
2228 || !TEST_BN_eq_zero(r)
2229 || !TEST_true(BN_mod_exp_mont_consttime(r, a, p, m, NULL, NULL))
2230 || !TEST_BN_eq_zero(r)
2231 || !TEST_true(BN_mod_exp_mont_word(r, 1, p, m, NULL, NULL))
2232 || !TEST_BN_eq_zero(r)
2233 || !TEST_true(BN_mod_exp_simple(r, a, p, m, NULL))
2234 || !TEST_BN_eq_zero(r)
2235 || !TEST_true(BN_mod_exp_recp(r, a, p, m, NULL))
2236 || !TEST_BN_eq_zero(r))
2238 /* Repeat for r = 1 ^ 0 mod -1 */
2240 BN_set_negative(m, 1);
2252 static int test_smallprime(int kBits)
2257 if (!TEST_ptr(r = BN_new()))
2261 if (!TEST_false(BN_generate_prime_ex(r, kBits, 0,
2265 if (!TEST_true(BN_generate_prime_ex(r, kBits, 0,
2267 || !TEST_int_eq(BN_num_bits(r), kBits))
2277 static int test_smallsafeprime(int kBits)
2282 if (!TEST_ptr(r = BN_new()))
2285 if (kBits <= 5 && kBits != 3) {
2286 if (!TEST_false(BN_generate_prime_ex(r, kBits, 1,
2290 if (!TEST_true(BN_generate_prime_ex(r, kBits, 1,
2292 || !TEST_int_eq(BN_num_bits(r), kBits))
2302 static int primes[] = { 2, 3, 5, 7, 17863 };
2304 static int test_is_prime(int i)
2310 if (!TEST_ptr(r = BN_new()))
2313 for (trial = 0; trial <= 1; ++trial) {
2314 if (!TEST_true(BN_set_word(r, primes[i]))
2315 || !TEST_int_eq(BN_check_prime(r, ctx, NULL),
2326 static int not_primes[] = { -1, 0, 1, 4 };
2328 static int test_not_prime(int i)
2334 if (!TEST_ptr(r = BN_new()))
2337 for (trial = 0; trial <= 1; ++trial) {
2338 if (!TEST_true(BN_set_word(r, not_primes[i]))
2339 || !TEST_false(BN_check_prime(r, ctx, NULL)))
2349 static int test_ctx_set_ct_flag(BN_CTX *c)
2356 for (i = 0; i < OSSL_NELEM(b); i++) {
2357 if (!TEST_ptr(b[i] = BN_CTX_get(c)))
2360 BN_set_flags(b[i], BN_FLG_CONSTTIME);
2369 static int test_ctx_check_ct_flag(BN_CTX *c)
2376 for (i = 0; i < OSSL_NELEM(b); i++) {
2377 if (!TEST_ptr(b[i] = BN_CTX_get(c)))
2379 if (!TEST_false(BN_get_flags(b[i], BN_FLG_CONSTTIME)))
2389 static int test_ctx_consttime_flag(void)
2392 * The constant-time flag should not "leak" among BN_CTX frames:
2394 * - test_ctx_set_ct_flag() starts a frame in the given BN_CTX and
2395 * sets the BN_FLG_CONSTTIME flag on some of the BIGNUMs obtained
2396 * from the frame before ending it.
2397 * - test_ctx_check_ct_flag() then starts a new frame and gets a
2398 * number of BIGNUMs from it. In absence of leaks, none of the
2399 * BIGNUMs in the new frame should have BN_FLG_CONSTTIME set.
2401 * In actual BN_CTX usage inside libcrypto the leak could happen at
2402 * any depth level in the BN_CTX stack, with varying results
2403 * depending on the patterns of sibling trees of nested function
2404 * calls sharing the same BN_CTX object, and the effect of
2405 * unintended BN_FLG_CONSTTIME on the called BN_* functions.
2407 * This simple unit test abstracts away this complexity and verifies
2408 * that the leak does not happen between two sibling functions
2409 * sharing the same BN_CTX object at the same level of nesting.
2412 BN_CTX *nctx = NULL;
2413 BN_CTX *sctx = NULL;
2417 if (!TEST_ptr(nctx = BN_CTX_new())
2418 || !TEST_ptr(sctx = BN_CTX_secure_new()))
2421 for (i = 0; i < 2; i++) {
2422 BN_CTX *c = i == 0 ? nctx : sctx;
2423 if (!TEST_true(test_ctx_set_ct_flag(c))
2424 || !TEST_true(test_ctx_check_ct_flag(c)))
2435 static int file_test_run(STANZA *s)
2437 static const FILETEST filetests[] = {
2439 {"LShift1", file_lshift1},
2440 {"LShift", file_lshift},
2441 {"RShift", file_rshift},
2442 {"Square", file_square},
2443 {"Product", file_product},
2444 {"Quotient", file_quotient},
2445 {"ModMul", file_modmul},
2446 {"ModExp", file_modexp},
2448 {"ModSqrt", file_modsqrt},
2450 int numtests = OSSL_NELEM(filetests);
2451 const FILETEST *tp = filetests;
2453 for ( ; --numtests >= 0; tp++) {
2454 if (findattr(s, tp->name) != NULL) {
2456 TEST_info("%s:%d: Failed %s test",
2457 s->test_file, s->start, tp->name);
2463 TEST_info("%s:%d: Unknown test", s->test_file, s->start);
2467 static int run_file_tests(int i)
2470 char *testfile = test_get_argument(i);
2473 if (!TEST_ptr(s = OPENSSL_zalloc(sizeof(*s))))
2475 if (!test_start_file(s, testfile)) {
2480 /* Read test file. */
2481 while (!BIO_eof(s->fp) && test_readstanza(s)) {
2482 if (s->numpairs == 0)
2484 if (!file_test_run(s))
2487 test_clearstanza(s);
2496 typedef enum OPTION_choice {
2499 OPT_STOCHASTIC_TESTS,
2503 const OPTIONS *test_get_options(void)
2505 static const OPTIONS test_options[] = {
2506 OPT_TEST_OPTIONS_WITH_EXTRA_USAGE("[file...]\n"),
2507 { "stochastic", OPT_STOCHASTIC_TESTS, '-', "Run stochastic tests" },
2508 { OPT_HELP_STR, 1, '-',
2509 "file\tFile to run tests on. Normal tests are not run\n" },
2512 return test_options;
2515 int setup_tests(void)
2518 int n, stochastic = 0;
2520 while ((o = opt_next()) != OPT_EOF) {
2522 case OPT_STOCHASTIC_TESTS:
2525 case OPT_TEST_CASES:
2532 n = test_get_argument_count();
2534 if (!TEST_ptr(ctx = BN_CTX_new()))
2539 ADD_TEST(test_div_recip);
2541 ADD_TEST(test_modexp_mont5);
2542 ADD_TEST(test_kronecker);
2543 ADD_TEST(test_rand);
2544 ADD_TEST(test_bn2padded);
2545 ADD_TEST(test_dec2bn);
2546 ADD_TEST(test_hex2bn);
2547 ADD_TEST(test_asc2bn);
2548 ADD_ALL_TESTS(test_mpi, (int)OSSL_NELEM(kMPITests));
2549 ADD_TEST(test_negzero);
2550 ADD_TEST(test_badmod);
2551 ADD_TEST(test_expmodzero);
2552 ADD_TEST(test_expmodone);
2553 ADD_ALL_TESTS(test_smallprime, 16);
2554 ADD_ALL_TESTS(test_smallsafeprime, 16);
2555 ADD_TEST(test_swap);
2556 ADD_TEST(test_ctx_consttime_flag);
2557 #ifndef OPENSSL_NO_EC2M
2558 ADD_TEST(test_gf2m_add);
2559 ADD_TEST(test_gf2m_mod);
2560 ADD_TEST(test_gf2m_mul);
2561 ADD_TEST(test_gf2m_sqr);
2562 ADD_TEST(test_gf2m_modinv);
2563 ADD_TEST(test_gf2m_moddiv);
2564 ADD_TEST(test_gf2m_modexp);
2565 ADD_TEST(test_gf2m_modsqrt);
2566 ADD_TEST(test_gf2m_modsolvequad);
2568 ADD_ALL_TESTS(test_is_prime, (int)OSSL_NELEM(primes));
2569 ADD_ALL_TESTS(test_not_prime, (int)OSSL_NELEM(not_primes));
2571 ADD_TEST(test_rand_range);
2573 ADD_ALL_TESTS(run_file_tests, n);
2578 void cleanup_tests(void)