Home
last modified time | relevance | path

Searched refs:BN_gcd (Results 1 – 11 of 11) sorted by relevance

/openssl/crypto/rsa/
H A Drsa_sp800_56b_check.c161 && BN_gcd(gcd, p1, e, ctx) in ossl_rsa_check_prime_factor()
272 && BN_gcd(gcd, p1, q1, ctx) in ossl_rsa_get_lcm()
326 if (!BN_gcd(gcd, rsa->n, ossl_bn_get0_small_factors(), ctx)
H A Drsa_chk.c123 if (!BN_gcd(m, i, j, ctx)) { in rsa_validate_keypair_multiprime()
141 if (!BN_gcd(m, m, k, ctx)) { in rsa_validate_keypair_multiprime()
H A Drsa_x931g.c107 if (!BN_gcd(r3, r1, r2, ctx)) in RSA_X931_derive_ex()
/openssl/doc/man3/
H A DBN_add.pod6 BN_mod_sub, BN_mod_mul, BN_mod_sqr, BN_mod_sqrt, BN_exp, BN_mod_exp, BN_gcd -
46 int BN_gcd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);
107 BN_gcd() computes the greatest common divisor of I<a> and I<b> and
/openssl/crypto/bn/
H A Dbn_x931p.c128 if (!BN_gcd(t, pm1, e, ctx)) in BN_X931_derive_prime_ex()
H A Dbn_prime.c405 if (!BN_gcd(g, b, w, ctx)) in ossl_bn_miller_rabin_is_prime()
445 if (!BN_sub_word(x, 1) || !BN_gcd(g, x, w, ctx)) in ossl_bn_miller_rabin_is_prime()
H A Dbn_gcd.c581 int BN_gcd(BIGNUM *r, const BIGNUM *in_a, const BIGNUM *in_b, BN_CTX *ctx) in BN_gcd() function
/openssl/include/openssl/
H A Dbn.h349 int BN_gcd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);
/openssl/test/
H A Dbntest.c1795 if (!TEST_true(BN_gcd(ret, a, b, ctx)) in file_gcd()
2836 || !TEST_true(BN_gcd(gcd, a, b, ctx)) in test_gcd_prime()
/openssl/util/
H A Dlibcrypto.num1430 BN_gcd 1465 3_0_0 EXIST::FUNCTION:
/openssl/
H A DCHANGES.md15379 * Fix BN_gcd so that it works on negative inputs; the result is

Completed in 93 milliseconds