Lines Matching defs:test
483 /* Regression test for carry bug in mulx4x_mont */
507 /* Regression test for carry bug in sqr[x]8x_mont */
519 /* Regression test for carry bug in bn_sqrx8x_internal */
566 /* Regression test for bug in BN_from_montgomery_word */
578 /* Regression test for bug in rsaz_1024_mul_avx2 */
627 * Regression test for overflow bug in bn_sqr_comba4/8 for
681 * than the modulus m, in order to test the const time precomputation
693 /* Finally, some regular test vectors. */
1122 * We test BN_kronecker(a, b, ctx) just for b odd (Jacobi symbol). In
1126 * random a's. (That is, we run the Solovay-Strassen primality test to
1127 * confirm that b is prime, except that we don't want to test whether b
1211 * There is no test for all of |r|, |a|, and |b| pointint to the same BIGNUM.
1237 * to work as if the prerequisite hold, but we don't test that yet.
1250 * There is no test for all of |r|, |a|, and |b| pointint to the same
1329 /* Set the LSB to 1 and test rshift1 again. */
1602 /* Reduce |a| and |b| and test the Montgomery version. */
1664 /* Regression test for carry propagation bug in sqr8x_reduction */
1742 /* The first condition should NOT be a test. */
2040 const MPITEST *test = &kMPITests[i];
2047 || !TEST_true(BN_asc2bn(&bn, test->base10)))
2054 || !TEST_mem_eq(test->mpi, test->mpi_len, scratch, mpi_len))
2100 * BN_rand_range() function works as expected. The test cases and
2103 * Each individual test is a Chi^2 goodness of fit for a specified number
2151 TEST_info("Chi^2 test negative %.4f > %4.f", sum, critical);
2152 TEST_note("test case %zu range %u iterations %u", n + 1, range,
2174 TEST_note("This test is expected to fail by chance 0.01%% of the time.");
2548 * This simple unit test abstracts away this complexity and verifies
2613 /* original test vectors for rsaz_512_sqr bug, by OSS-Fuzz */
2642 /* test vectors for rsaz_512_srq bug, with rcx/rbx=1 */
2727 /* test vectors for rsaz_512_srq bug, with rcx/rbx=2 */
2816 const MOD_EXP_TEST *test = &ModExpTests[i];
2823 || !TEST_true(BN_dec2bn(&base, test->base))
2824 || !TEST_true(BN_dec2bn(&exponent, test->exp))
2825 || !TEST_true(BN_dec2bn(&modulo, test->mod)))
2834 if (!TEST_mem_eq(s, strlen(s), test->res, strlen(test->res)))
2850 const MOD_EXP_TEST *test = &ModExpTests[i];
2857 || !TEST_true(BN_dec2bn(&base, test->base))
2858 || !TEST_true(BN_dec2bn(&exponent, test->exp))
2859 || !TEST_true(BN_dec2bn(&modulo, test->mod)))
2872 if (!TEST_mem_eq(s, strlen(s), test->res, strlen(test->res)))
2887 * Regression test to ensure BN_mod_exp2_mont fails safely if argument m is
2952 TEST_info("%s:%d: Failed %s test",
2959 TEST_info("%s:%d: Unknown test", s->test_file, s->start);
2976 /* Read test file. */