Searched refs:BN_gcd (Results 1 – 12 of 12) sorted by relevance
| /openssl-master/crypto/rsa/ |
| A D | rsa_sp800_56b_check.c | 161 && BN_gcd(gcd, p1, e, ctx) in ossl_rsa_check_prime_factor()
272 && BN_gcd(gcd, p1, q1, ctx) in ossl_rsa_get_lcm()
321 if (!BN_gcd(gcd, rsa->n, ossl_bn_get0_small_factors(), ctx)
|
| A D | rsa_chk.c | 123 if (!BN_gcd(m, i, j, ctx)) { in rsa_validate_keypair_multiprime()
137 if (!BN_gcd(m, m, k, ctx)) { in rsa_validate_keypair_multiprime()
|
| A D | rsa_x931g.c | 107 if (!BN_gcd(r3, r1, r2, ctx)) in RSA_X931_derive_ex()
|
| /openssl-master/crypto/bn/ |
| A D | bn_rsa_fips186_4.c | 291 && BN_gcd(tmp, r1x2, r2, ctx) in ossl_bn_rsa_fips186_4_derive_prime()
334 || !BN_gcd(tmp, y1, e, ctx)) in ossl_bn_rsa_fips186_4_derive_prime()
|
| A D | bn_x931p.c | 128 if (!BN_gcd(t, pm1, e, ctx)) in BN_X931_derive_prime_ex()
|
| A D | bn_prime.c | 395 if (!BN_gcd(g, b, w, ctx)) in ossl_bn_miller_rabin_is_prime()
435 if (!BN_sub_word(x, 1) || !BN_gcd(g, x, w, ctx)) in ossl_bn_miller_rabin_is_prime()
|
| A D | bn_gcd.c | 547 int BN_gcd(BIGNUM *r, const BIGNUM *in_a, const BIGNUM *in_b, BN_CTX *ctx) in BN_gcd() function
|
| /openssl-master/doc/man3/ |
| A D | BN_add.pod | 6 BN_mod_sub, BN_mod_mul, BN_mod_sqr, BN_exp, BN_mod_exp, BN_gcd -
44 int BN_gcd(BIGNUM *r, BIGNUM *a, BIGNUM *b, BN_CTX *ctx);
99 BN_gcd() computes the greatest common divisor of I<a> and I<b> and
|
| /openssl-master/include/openssl/ |
| A D | bn.h | 343 int BN_gcd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);
|
| /openssl-master/test/ |
| A D | bntest.c | 1722 if (!TEST_true(BN_gcd(ret, a, b, ctx)) in file_gcd()
2548 || !TEST_true(BN_gcd(gcd, a, b, ctx)) in test_gcd_prime()
|
| /openssl-master/util/ |
| A D | libcrypto.num | 1430 BN_gcd 1465 3_0_0 EXIST::FUNCTION:
|
| /openssl-master/ |
| A D | CHANGES.md | 13504 * Fix BN_gcd so that it works on negative inputs; the result is
|
Completed in 45 milliseconds