Lines Matching refs:r
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, BIGNUM *a, BIGNUM *b, BN_CTX *ctx);
19 int BN_sqr(BIGNUM *r, BIGNUM *a, 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, BIGNUM *a, BIGNUM *b, const BIGNUM *m,
31 int BN_mod_sub(BIGNUM *r, BIGNUM *a, BIGNUM *b, const BIGNUM *m,
34 int BN_mod_mul(BIGNUM *r, BIGNUM *a, BIGNUM *b, const BIGNUM *m,
37 int BN_mod_sqr(BIGNUM *r, BIGNUM *a, const BIGNUM *m, BN_CTX *ctx);
39 int BN_exp(BIGNUM *r, BIGNUM *a, BIGNUM *p, BN_CTX *ctx);
41 int BN_mod_exp(BIGNUM *r, BIGNUM *a, const BIGNUM *p,
44 int BN_gcd(BIGNUM *r, BIGNUM *a, BIGNUM *b, BN_CTX *ctx);
48 BN_add() adds I<a> and I<b> and places the result in I<r> (C<r=a+b>).
49 I<r> may be the same B<BIGNUM> as I<a> or I<b>.
51 BN_sub() subtracts I<b> from I<a> and places the result in I<r> (C<r=a-b>).
52 I<r> may be the same B<BIGNUM> as I<a> or I<b>.
54 BN_mul() multiplies I<a> and I<b> and places the result in I<r> (C<r=a*b>).
55 I<r> may be the same B<BIGNUM> as I<a> or I<b>.
58 BN_sqr() takes the square of I<a> and places the result in I<r>
59 (C<r=a^2>). I<r> and I<a> may be the same B<BIGNUM>.
60 This function is faster than BN_mul(r,a,a).
72 remainder in I<r>.
75 result in I<r>.
78 nonnegative result in I<r>.
81 remainder respective to modulus I<m> (C<r=(a*b) mod m>). I<r> may be
88 result in I<r>.
90 BN_exp() raises I<a> to the I<p>-th power and places the result in I<r>
91 (C<r=a^p>). This function is faster than repeated applications of
94 BN_mod_exp() computes I<a> to the I<p>-th power modulo I<m> (C<r=a^p %
100 places the result in I<r>. I<r> may be the same B<BIGNUM> as I<a> or
112 value should always be checked (e.g., C<if (!BN_add(r,a,b)) goto err;>).