Searched refs:BN_GF2m_mod_mul (Results 1 – 7 of 7) sorted by relevance
| /openssl/crypto/bn/ |
| H A D | bn_gf2m.c | 466 int BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, in BN_GF2m_mod_mul() function
753 if (!BN_GF2m_mod_mul(r, a, b, p, ctx)) in BN_GF2m_mod_inv()
761 if (!BN_GF2m_mod_mul(r, r, b, p, ctx)) in BN_GF2m_mod_inv()
819 if (!BN_GF2m_mod_mul(r, y, xinv, p, ctx)) in BN_GF2m_mod_div()
|
| /openssl/test/ |
| H A D | bntest.c | 836 if (!(TEST_true(BN_GF2m_mod_mul(e, a, c, b[j], ctx)) in test_gf2m_mul()
838 && TEST_true(BN_GF2m_mod_mul(g, f, c, b[j], ctx)) in test_gf2m_mul()
839 && TEST_true(BN_GF2m_mod_mul(h, d, c, b[j], ctx)) in test_gf2m_mul()
884 && TEST_true(BN_GF2m_mod_mul(d, a, d, b[j], ctx)) in test_gf2m_sqr()
930 && TEST_true(BN_GF2m_mod_mul(d, a, c, b[j], ctx)) in test_gf2m_modinv()
971 && TEST_true(BN_GF2m_mod_mul(e, d, c, b[j], ctx)) in test_gf2m_moddiv()
1017 && TEST_true(BN_GF2m_mod_mul(e, e, f, b[j], ctx)) in test_gf2m_modexp()
|
| /openssl/util/ |
| H A D | missingcrypto.txt | 231 BN_GF2m_mod_mul(3)
|
| H A D | missingcrypto111.txt | 258 BN_GF2m_mod_mul(3)
|
| H A D | libcrypto.num | 77 BN_GF2m_mod_mul 79 3_0_0 EXIST::FUNCTION:EC2M
|
| /openssl/include/openssl/ |
| H A D | bn.h | 486 int BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
|
| /openssl/ |
| H A D | CHANGES.md | 12860 BN_GF2m_mod_mul [wrapper for BN_GF2m_mod_mul_arr]
12900 BN_GF2m_mod_mul(). The alternative algorithm is compiled in only
|
Completed in 82 milliseconds
