/third_party/openssl/crypto/rsa/ |
D | rsa_chk.c | 86 if (!BN_mul(i, key->p, key->q, ctx)) { in RSA_check_key_ex() 92 if (!BN_mul(i, i, pinfo->r, ctx)) { in RSA_check_key_ex() 117 if (!BN_mul(l, i, j, ctx)) { in RSA_check_key_ex() 131 if (!BN_mul(l, l, k, ctx)) { in RSA_check_key_ex()
|
D | rsa_gen.c | 214 if (!BN_mul(r1, rsa->p, rsa->q, ctx)) in rsa_builtin_keygen() 218 if (!BN_mul(r1, rsa->n, prime, ctx)) in rsa_builtin_keygen() 301 if (!BN_mul(r0, r1, r2, ctx)) in rsa_builtin_keygen() 309 if (!BN_mul(r0, r0, pinfo->d, ctx)) in rsa_builtin_keygen()
|
D | rsa_x931g.c | 90 if (!BN_mul(rsa->n, rsa->p, rsa->q, ctx)) in RSA_X931_derive_ex() 98 if (!BN_mul(r0, r1, r2, ctx)) in RSA_X931_derive_ex()
|
D | rsa_mp.c | 87 if (!BN_mul(pinfo->pp, p1, p2, ctx)) in rsa_multip_calc_product()
|
D | rsa_ossl.c | 825 if (!BN_mul(r1, r0, rsa->iqmp, ctx)) in rsa_ossl_mod_exp() 852 if (!BN_mul(r1, r0, rsa->q, ctx)) in rsa_ossl_mod_exp() 871 if (!BN_mul(r2, r1, pinfo->t, ctx)) { in rsa_ossl_mod_exp() 888 if (!BN_mul(r1, r1, pinfo->pp, ctx)) { in rsa_ossl_mod_exp()
|
D | rsa_crpt.c | 101 if (!BN_mul(r0, r1, r2, ctx)) in rsa_get_public_exp()
|
/third_party/openssl/crypto/bn/ |
D | bn_x931p.c | 86 if (!BN_mul(p1p2, p1, p2, ctx)) in BN_X931_derive_prime_ex() 94 if (!BN_mul(p, p, p2, ctx)) in BN_X931_derive_prime_ex() 100 if (!BN_mul(t, t, p1, ctx)) in BN_X931_derive_prime_ex()
|
D | bn_recp.c | 70 if (!BN_mul(a, x, y, ctx)) in BN_mod_mul_reciprocal() 134 if (!BN_mul(b, a, &(recp->Nr), ctx)) in BN_div_recp() 140 if (!BN_mul(b, &(recp->N), d, ctx)) in BN_div_recp()
|
D | bn_gcd.c | 140 if (!BN_mul(tmp, D, X, ctx)) in bn_mod_inverse_no_branch() 462 if (!BN_mul(tmp, D, X, ctx)) in int_bn_mod_inverse()
|
D | bn_mont.c | 199 if (!BN_mul(t2, t1, &mont->Ni, ctx)) in bn_from_mont_fixed_top() 203 if (!BN_mul(t1, t2, &mont->N, ctx)) in bn_from_mont_fixed_top()
|
D | bn_mod.c | 210 if (!BN_mul(t, a, b, ctx)) in BN_mod_mul()
|
D | bn_mul.c | 497 int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx) in BN_mul() function
|
D | README.pod | 179 BN_mul() calls bn_mul_normal(), or an optimized implementation if the
|
D | bn_exp.c | 75 if (!BN_mul(rr, rr, v, ctx)) in BN_exp()
|
/third_party/openssl/doc/man3/ |
D | BN_add.pod | 5 BN_add, BN_sub, BN_mul, BN_sqr, BN_div, BN_mod, BN_nnmod, BN_mod_add, 17 int BN_mul(BIGNUM *r, BIGNUM *a, BIGNUM *b, BN_CTX *ctx); 56 BN_mul() multiplies I<a> and I<b> and places the result in I<r> (C<r=a*b>). 62 This function is faster than BN_mul(r,a,a). 100 BN_mul().
|
/third_party/openssl/crypto/ec/ |
D | ecdh_ossl.c | 69 !BN_mul(x, x, priv_key, ctx)) { in ecdh_simple_compute_key()
|
D | ecp_nist.c | 134 if (!BN_mul(r, a, b, ctx)) in ec_GFp_nist_field_mul()
|
D | ec_mult.c | 196 if (!BN_mul(cardinality, group->order, group->cofactor, ctx)) { in ec_scalar_mul_ladder()
|
/third_party/openssl/fuzz/ |
D | bndiv.c | 92 OPENSSL_assert(BN_mul(b5, b3, b2, ctx)); in FuzzerTestOneInput()
|
/third_party/openssl/test/ |
D | bntest.c | 290 && TEST_true(BN_mul(e, d, b, ctx)) in test_div_recip() 398 && TEST_true(BN_mul(c, d, b, ctx)) in test_mod() 1320 || !TEST_true(BN_mul(ret, a, two, ctx)) in file_lshift1() 1424 || !TEST_true(BN_mul(ret, a, a, ctx)) in file_square() 1484 if (!TEST_true(BN_mul(ret, a, b, ctx)) in file_product() 1524 || !TEST_true(BN_mul(ret, quotient, b, ctx)) in file_quotient() 1679 || !TEST_true(BN_mul(e, a, a, ctx)) in file_modexp() 2119 if (!TEST_true(BN_mul(c, a, b, ctx))) in test_negzero()
|
D | ectest.c | 88 || !TEST_true(BN_mul(n2, n1, n2, ctx)) in group_order_tests()
|
/third_party/mindspore/mindspore/ccsrc/fl/armour/secure_protocol/ |
D | secret_sharing.cc | 69 if (BN_mul(z, x, y, ctx) != 1) { in field_mult()
|
/third_party/openssl/crypto/srp/ |
D | srp_lib.c | 203 if (!BN_mul(tmp3, u, xtmp, bn_ctx)) in SRP_Calc_client_key()
|
/third_party/openssl/include/openssl/ |
D | bn.h | 232 int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);
|
/third_party/grpc/src/boringssl/ |
D | boringssl_prefix_symbols.h | 958 #define BN_mul BORINGSSL_ADD_PREFIX(BORINGSSL_PREFIX, BN_mul) macro
|