| /external/openssl/crypto/bn/ |
| bn_mod.c | 1 /* crypto/bn/bn_mod.c */
119 int BN_mod(BIGNUM *rem, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx)
129 /* like BN_mod, but returns non-negative remainder
132 if (!(BN_mod(r,m,d,ctx)))
207 return BN_mod(r, r, m, ctx);
|
| exp.c | 37 BN_mod(&a,&a,&c,&ctx);
|
| exptest.c | 157 BN_mod(a,a,m,ctx);
158 BN_mod(b,b,m,ctx);
|
| bn_exp2.c | 174 if (!BN_mod(val1[0],a1,m,ctx))
208 if (!BN_mod(val2[0],a2,m,ctx))
|
| bn_prime.c | 419 if (!BN_mod(t1,rnd,add,ctx)) goto err;
462 if (!BN_mod(t1,q,qadd,ctx)) goto err;
|
| bn_rand.c | 366 if (BN_mod(out, out, range, ctx) != 1)
|
| bn_mont.c | 457 if (!BN_mod(&(mont->RR),&(mont->RR),&(mont->N),ctx)) goto err;
|
| bn_exp.c | 671 if (!BN_mod(&am,a,m,ctx)) goto err;
844 (BN_mod(t, r, m, ctx) && (swap_tmp = r, r = t, t = swap_tmp, 1))))
847 * than always using BN_mod (which uses BN_copy if
849 /* We can use BN_mod and do not need BN_nnmod because our
850 * accumulator is never negative (the result of BN_mod does
|
| bn.h | 469 #define BN_mod(rem,m,d,ctx) BN_div(NULL,(rem),(m),(d),(ctx))
[all...] |
| /external/openssl/crypto/rsa/ |
| rsa_chk.c | 143 r = BN_mod(j, key->d, i, ctx);
157 r = BN_mod(j, key->d, i, ctx);
|
| rsa_gen.c | 204 if (!BN_mod(rsa->dmp1,d,r1,ctx)) goto err;
207 if (!BN_mod(rsa->dmq1,d,r2,ctx)) goto err;
|
| rsa_eay.c | 790 if (!BN_mod(r1,c,rsa->q,ctx)) goto err;
794 if (!BN_mod(r1,I,rsa->q,ctx)) goto err;
813 if (!BN_mod(r1,c,rsa->p,ctx)) goto err;
817 if (!BN_mod(r1,I,rsa->p,ctx)) goto err;
847 if (!BN_mod(r0,pr1,rsa->p,ctx)) goto err;
869 if (!BN_mod(vrfy, vrfy, rsa->n, ctx)) goto err;
|
| /external/openssl/crypto/dsa/ |
| dsa_ossl.c | 301 if (!BN_mod(r,r,dsa->q,ctx)) goto err;
401 if (!BN_mod(&u1,&t1,dsa->q,ctx)) goto err;
|
| dsa_gen.c | 295 if (!BN_mod(c,X,r0,ctx)) goto err;
|
| /external/chromium_org/third_party/boringssl/src/crypto/rsa/ |
| rsa_impl.c | 683 if (!BN_mod(r1, c, rsa->q, ctx)) {
697 if (!BN_mod(r1, c, rsa->p, ctx)) {
727 if (!BN_mod(r0, pr1, rsa->p, ctx)) {
761 if (!BN_mod(vrfy, vrfy, rsa->n, ctx)) {
901 if (!BN_mod(rsa->dmp1, d, r1, ctx))
905 if (!BN_mod(rsa->dmq1, d, r2, ctx))
|
| rsa.c | 582 !BN_mod(&dmp1, key->d, &pm1, ctx) ||
584 !BN_mod(&dmq1, key->d, &qm1, ctx) ||
722 !BN_mod(rsa->dmp1, rsa->d, rem, ctx) ||
724 !BN_mod(rsa->dmq1, rsa->d, rem, ctx) ||
|
| /external/chromium_org/third_party/boringssl/src/crypto/dsa/ |
| dsa_impl.c | 150 if (!BN_mod(r, r, dsa->q, ctx)) {
375 if (!BN_mod(&u1, &t1, dsa->q, ctx)) {
622 if (!BN_mod(c, X, r0, ctx))
|
| /external/chromium_org/third_party/boringssl/src/crypto/bn/ |
| div.c | 377 if (!(BN_mod(r, m, d, ctx))) {
466 return BN_mod(r, r, m, ctx);
|
| prime.c | 542 if (!BN_mod(t1, rnd, add, ctx)) {
600 if (!BN_mod(t1, q, qadd, ctx)) {
[all...] |
| exponentiation.c | 972 if (!BN_mod(&am, a, m, ctx))
[all...] |
| montgomery.c | 282 if (!BN_mod(&(mont->RR), &(mont->RR), &(mont->N), ctx)) {
|
| bn_test.c | 234 message(out, "BN_mod");
839 BN_mod(c, a, b, ctx); /**/
|
| /external/chromium_org/third_party/boringssl/src/include/openssl/ |
| bn.h | 471 /* BN_mod is a helper macro that calls |BN_div| and discards the quotient. */
472 #define BN_mod(rem, numerator, divisor, ctx) \
475 /* BN_nnmod is a non-negative modulo function. It acts like |BN_mod|, but 0 <=
[all...] |
| /external/openssl/include/openssl/ |
| bn.h | 469 #define BN_mod(rem,m,d,ctx) BN_div(NULL,(rem),(m),(d),(ctx))
[all...] |
| /external/wpa_supplicant_8/src/eap_peer/ |
| eap_pwd.c | 323 BN_mod(data->my_scalar, data->my_scalar, data->grp->order,
|
