| /external/dropbear/libtommath/ |
| bn_mp_mod_d.c | 19 mp_mod_d (mp_int * a, mp_digit b, mp_digit * c) function
|
| bn_mp_prime_is_divisible.c | 33 if ((err = mp_mod_d (a, ltm_prime_tab[ix], &res)) != MP_OKAY) {
|
| bn_mp_is_square.c | 66 if ((res = mp_mod_d(arg,105,&c)) != MP_OKAY) {
|
| bn_mp_prime_next_prime.c | 97 if ((err = mp_mod_d(a, ltm_prime_tab[x], res_tab + x)) != MP_OKAY) {
|
| tommath.h | 352 int mp_mod_d(mp_int *a, mp_digit b, mp_digit *c);
|
| bn.tex | [all...] |
| /external/dropbear/libtomcrypt/src/headers/ |
| tomcrypt_math.h | 480 #define mp_mod_d(a, b, c) ltc_mp.modi(a, b, c) macro
|
| /external/dropbear/libtommath/mtest/ |
| mpi.h | 144 mp_err mp_mod_d(mp_int *a, mp_digit d, mp_digit *c);
|
| mpi.c | 1406 /* {{{ mp_mod_d(a, d, c) */
1409 mp_mod_d(a, d, c)
1413 mp_err mp_mod_d(mp_int *a, mp_digit d, mp_digit *c) function
1436 } /* end mp_mod_d() */
[all...] |
| /external/dropbear/libtomcrypt/src/math/ |
| ltm_desc.c | 286 if ((err = mpi_to_ltc_error(mp_mod_d(a, b, &tmp))) != CRYPT_OK) {
|
| /external/dropbear/libtommath/pre_gen/ |
| mpi.c | 4655 mp_mod_d (mp_int * a, mp_digit b, mp_digit * c) function
[all...] |
