Lines Matching refs:m
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);
44 const BIGNUM *m, BN_CTX *ctx);
73 BN_nnmod() reduces I<a> modulo I<m> and places the nonnegative
76 BN_mod_add() adds I<a> to I<b> modulo I<m> and places the nonnegative
79 BN_mod_sub() subtracts I<b> from I<a> modulo I<m> and places the
83 remainder respective to modulus I<m> (C<r=(a*b) mod m>). I<r> may be
89 BN_mod_sqr() takes the square of I<a> modulo B<m> and places the
102 BN_mod_exp() computes I<a> to the I<p>-th power modulo I<m> (C<r=a^p %
103 m>). This function uses less time and space than BN_exp(). Do not call this
104 function when B<m> is even and any of the parameters have the