Lines Matching full:bignum
117 static BIGNUM *euclid(BIGNUM *a, BIGNUM *b) {
118 BIGNUM *t;
186 int BN_gcd(BIGNUM *r, const BIGNUM *in_a, const BIGNUM *in_b, BN_CTX *ctx) {
187 BIGNUM *a, *b, *t;
228 static int bn_mod_inverse_general(BIGNUM *out, int *out_no_inverse,
229 const BIGNUM *a, const BIGNUM *n,
232 int BN_mod_inverse_odd(BIGNUM *out, int *out_no_inverse, const BIGNUM *a,
233 const BIGNUM *n, BN_CTX *ctx) {
246 BIGNUM *A, *B, *X, *Y;
259 BIGNUM *R = out;
400 BIGNUM *BN_mod_inverse(BIGNUM *out, const BIGNUM *a, const BIGNUM *n,
402 BIGNUM *new_out = NULL;
413 BIGNUM *a_reduced = NULL;
445 int BN_mod_inverse_blinded(BIGNUM *out, int *out_no_inverse, const BIGNUM *a,
455 BIGNUM blinding_factor;
478 static int bn_mod_inverse_general(BIGNUM *out, int *out_no_inverse,
479 const BIGNUM *a, const BIGNUM *n,
481 BIGNUM *A, *B, *X, *Y, *M, *D, *T;
499 BIGNUM *R = out;
516 BIGNUM *tmp;
535 tmp = A; /* keep the BIGNUM object, the value does not matter */
568 M = Y; /* keep the BIGNUM object, the value does not matter */
613 int bn_mod_inverse_prime(BIGNUM *out, const BIGNUM *a, const BIGNUM *p,
616 BIGNUM *p_minus_2 = BN_CTX_get(ctx);
625 int bn_mod_inverse_secret_prime(BIGNUM *out, const BIGNUM *a, const BIGNUM *p,
628 BIGNUM *p_minus_2 = BN_CTX_get(ctx);
