Lines Matching refs:BIGNUM

13  int BN_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
15 int BN_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b);
17 int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);
19 int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx);
21 int BN_div(BIGNUM *dv, BIGNUM *rem, const BIGNUM *a, const BIGNUM *d,
24 int BN_mod(BIGNUM *rem, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
26 int BN_nnmod(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
28 int BN_mod_add(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
31 int BN_mod_sub(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
34 int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
37 int BN_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
39 BIGNUM *BN_mod_sqrt(BIGNUM *in, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
41 int BN_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx);
43 int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
44 const BIGNUM *m, BN_CTX *ctx);
46 int BN_gcd(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx);
51 I<r> may be the same B<BIGNUM> as I<a> or I<b>.
54 I<r> may be the same B<BIGNUM> as I<a> or I<b>.
57 I<r> may be the same B<BIGNUM> as I<a> or I<b>.
61 (C<r=a^2>). I<r> and I<a> may be the same B<BIGNUM>.
84 the same B<BIGNUM> as I<a> or I<b>. For more efficient algorithms for
108 places the result in I<r>. I<r> may be the same B<BIGNUM> as I<a> or
114 Unless noted otherwise, the result B<BIGNUM> must be different from
120 to use the same B<BIGNUM> object for the modulus as for the output.