| /third_party/openssl/doc/man3/ |
| D | BN_mod_inverse.pod | 5 BN_mod_inverse - compute inverse modulo n
11 BIGNUM *BN_mod_inverse(BIGNUM *r, BIGNUM *a, const BIGNUM *n,
16 BN_mod_inverse() computes the inverse of B<a> modulo B<n>
25 BN_mod_inverse() returns the B<BIGNUM> containing the inverse, and
|
| /third_party/openssl/crypto/rsa/ |
| D | rsa_gen.c | 193 if (BN_mod_inverse(r1, r2, rsa->e, ctx) != NULL) { in rsa_builtin_keygen()
320 if (!BN_mod_inverse(rsa->d, rsa->e, pr0, ctx)) { in rsa_builtin_keygen()
365 if (!BN_mod_inverse(rsa->iqmp, rsa->q, p, ctx)) { in rsa_builtin_keygen()
374 if (!BN_mod_inverse(pinfo->t, pinfo->pp, p, ctx)) { in rsa_builtin_keygen()
|
| D | rsa_x931g.c | 111 rsa->d = BN_mod_inverse(NULL, rsa->e, r0, ctx2); /* d */ in RSA_X931_derive_ex()
130 rsa->iqmp = BN_mod_inverse(NULL, rsa->q, rsa->p, ctx2); in RSA_X931_derive_ex()
|
| D | rsa_chk.c | 184 if (!BN_mod_inverse(i, key->q, key->p, ctx)) { in RSA_check_key_ex()
210 if (!BN_mod_inverse(i, pinfo->pp, pinfo->r, ctx)) { in RSA_check_key_ex()
|
| D | rsa_crpt.c | 104 ret = BN_mod_inverse(NULL, d, r0, ctx); in rsa_get_public_exp()
|
| /third_party/openssl/crypto/bn/ |
| D | bn_x931p.c | 91 if (!BN_mod_inverse(p, p2, p1, ctx)) in BN_X931_derive_prime_ex()
97 if (!BN_mod_inverse(t, p1, p2, ctx)) in BN_X931_derive_prime_ex()
|
| D | bn_mont.c | 316 else if ((BN_mod_inverse(Ri, R, &tmod, ctx)) == NULL) in BN_MONT_CTX_set()
351 else if ((BN_mod_inverse(Ri, R, &tmod, ctx)) == NULL) in BN_MONT_CTX_set()
379 if ((BN_mod_inverse(Ri, R, &mont->N, ctx)) == NULL) in BN_MONT_CTX_set()
|
| D | bn_gcd.c | 513 BIGNUM *BN_mod_inverse(BIGNUM *in, in BN_mod_inverse() function
|
| /third_party/openssl/crypto/dsa/ |
| D | dsa_ossl.c | 151 if (BN_mod_inverse(blind, blind, dsa->q, ctx) == NULL) in dsa_do_sign()
346 if ((BN_mod_inverse(u2, s, dsa->q, ctx)) == NULL) in dsa_do_verify()
|
| /third_party/mindspore/mindspore/ccsrc/fl/armour/secure_protocol/ |
| D | secret_sharing.cc | 222 (void)BN_mod_inverse(tmp, denses[j], this->bn_prim_, ctx); in Combine()
|
| /third_party/openssl/include/openssl/ |
| D | bn.h | 318 BIGNUM *BN_mod_inverse(BIGNUM *ret,
|
| /third_party/wpa_supplicant/wpa_supplicant-2.9/src/crypto/ |
| D | crypto_openssl.c | 1426 res = BN_mod_inverse((BIGNUM *) c, (const BIGNUM *) a, in crypto_bignum_inverse()
|
| /third_party/openssl/crypto/ec/ |
| D | ecp_smpl.c | 1400 if (!BN_mod_inverse(r, r, group->field, ctx)) { in ec_GFp_simple_field_inv()
|
| /third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/crypto/ |
| D | crypto_openssl.c | 1499 res = BN_mod_inverse((BIGNUM *) c, (const BIGNUM *) a, in crypto_bignum_inverse()
|
| /third_party/grpc/src/boringssl/ |
| D | boringssl_prefix_symbols.h | 942 #define BN_mod_inverse BORINGSSL_ADD_PREFIX(BORINGSSL_PREFIX, BN_mod_inverse) macro
|
| /third_party/openssl/crypto/err/ |
| D | openssl.txt | 220 BN_F_BN_MOD_INVERSE:110:BN_mod_inverse
|
| /third_party/openssl/ |
| D | CHANGES | 900 mitigations are applied to the fallback BN_mod_inverse().
901 When using this function rather than BN_mod_inverse() directly, new
5994 BN_mod_inverse_no_branch() of BN_div() and BN_mod_inverse(),
5997 and BN_mod_inverse() if the flag BN_FLG_CONSTTIME is set for one
8523 *) Implement binary inversion algorithm for BN_mod_inverse in addition
9195 *) Make BN_mod_inverse faster by explicitly handling small quotients
|
| /third_party/openssl/util/ |
| D | libcrypto.num | 3870 BN_mod_inverse 3822 1_1_0 EXIST::FUNCTION:
|