/openssl/doc/man3/ |
H A 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> 29 BN_mod_inverse() returns the B<BIGNUM> containing the inverse, and
|
/openssl/crypto/bn/ |
H A D | bn_x931p.c | 93 if (!BN_mod_inverse(p, p2, p1, ctx)) in BN_X931_derive_prime_ex() 99 if (!BN_mod_inverse(t, p1, p2, ctx)) in BN_X931_derive_prime_ex()
|
H A D | bn_rsa_fips186_4.c | 330 && (BN_mod_inverse(tmp, r1x2, r2, ctx) != NULL) in ossl_bn_rsa_fips186_4_derive_prime() 332 && (BN_mod_inverse(R, r2, r1x2, ctx) != NULL) in ossl_bn_rsa_fips186_4_derive_prime()
|
H A D | bn_mont.c | 314 else if ((BN_mod_inverse(Ri, R, &tmod, ctx)) == NULL) in BN_MONT_CTX_set() 349 else if ((BN_mod_inverse(Ri, R, &tmod, ctx)) == NULL) in BN_MONT_CTX_set() 377 if ((BN_mod_inverse(Ri, R, &mont->N, ctx)) == NULL) in BN_MONT_CTX_set()
|
H A D | bn_gcd.c | 516 BIGNUM *BN_mod_inverse(BIGNUM *in, in BN_mod_inverse() function 561 ret = (BN_mod_inverse(tmp, a, b, ctx) != NULL); in BN_are_coprime()
|
/openssl/crypto/rsa/ |
H A D | rsa_x931g.c | 117 rsa->d = BN_mod_inverse(NULL, rsa->e, r0, ctx2); /* d */ in RSA_X931_derive_ex() 136 rsa->iqmp = BN_mod_inverse(NULL, rsa->q, rsa->p, ctx2); in RSA_X931_derive_ex()
|
H A D | rsa_gen.c | 138 if (BN_mod_inverse(r1, r2, rsa->e, ctx) == NULL) in DEFINE_STACK_OF() 225 if (BN_mod_inverse(iqmp, sk_BIGNUM_value(factors, 1), in DEFINE_STACK_OF() 237 if (BN_mod_inverse(newcoeff, newpp, sk_BIGNUM_value(factors, i), in DEFINE_STACK_OF() 411 if (BN_mod_inverse(r1, r2, rsa->e, ctx) != NULL) { in rsa_multiprime_keygen() 551 if (BN_mod_inverse(rsa->d, rsa->e, r0, ctx) == NULL) { in rsa_multiprime_keygen()
|
H A D | rsa_chk.c | 190 if (!BN_mod_inverse(i, key->q, key->p, ctx)) { in rsa_validate_keypair_multiprime() 216 if (!BN_mod_inverse(i, pinfo->pp, pinfo->r, ctx)) { in rsa_validate_keypair_multiprime()
|
H A D | rsa_sp800_56b_gen.c | 277 if (BN_mod_inverse(rsa->d, e, lcm, ctx) == NULL) in ossl_rsa_sp800_56b_derive_params_from_pq() 317 if (BN_mod_inverse(rsa->iqmp, rsa->q, rsa->p, ctx) == NULL) in ossl_rsa_sp800_56b_derive_params_from_pq()
|
H A D | rsa_crpt.c | 110 ret = BN_mod_inverse(NULL, d, r0, ctx); in rsa_get_public_exp()
|
/openssl/crypto/dsa/ |
H A D | dsa_ossl.c | 174 if (BN_mod_inverse(blind, blind, dsa->params.q, ctx) == NULL) in ossl_dsa_do_sign_int() 405 if ((BN_mod_inverse(u2, s, dsa->params.q, ctx)) == NULL) in dsa_do_verify()
|
/openssl/include/openssl/ |
H A D | bn.h | 354 BIGNUM *BN_mod_inverse(BIGNUM *ret,
|
/openssl/test/ |
H A D | bntest.c | 3189 if (!TEST_ptr_eq(BN_mod_inverse(r, a, b, ctx), r)) in test_mod_inverse() 3197 if (!TEST_ptr_null(BN_mod_inverse(b, a, b, ctx))) in test_mod_inverse()
|
/openssl/doc/ |
H A D | build.info | 742 DEPEND[html/man3/BN_mod_inverse.html]=man3/BN_mod_inverse.pod 743 GENERATE[html/man3/BN_mod_inverse.html]=man3/BN_mod_inverse.pod 744 DEPEND[man/man3/BN_mod_inverse.3]=man3/BN_mod_inverse.pod 745 GENERATE[man/man3/BN_mod_inverse.3]=man3/BN_mod_inverse.pod 3191 html/man3/BN_mod_inverse.html \ 3854 man/man3/BN_mod_inverse.3 \
|
/openssl/crypto/ec/ |
H A D | ecp_smpl.c | 1407 if (!BN_mod_inverse(r, r, group->field, ctx)) { in ossl_ec_GFp_simple_field_inv()
|
/openssl/ |
H A D | CHANGES.md | 4019 mitigations are applied to the fallback BN_mod_inverse(). 4020 When using this function rather than BN_mod_inverse() directly, new 11746 BN_mod_inverse_no_branch() of BN_div() and BN_mod_inverse(), 11749 and BN_mod_inverse() if the flag BN_FLG_CONSTTIME is set for one 14610 * Implement binary inversion algorithm for BN_mod_inverse in addition 15369 * Make BN_mod_inverse faster by explicitly handling small quotients
|
/openssl/util/ |
H A D | libcrypto.num | 3737 BN_mod_inverse 3822 3_0_0 EXIST::FUNCTION:
|