Searched refs:mp_mod_d (Results 1 – 12 of 12) sorted by relevance
| /external/dropbear/libtommath/ |
| D | bn_mp_mod_d.c | 19 mp_mod_d (mp_int * a, mp_digit b, mp_digit * c) in mp_mod_d() function
|
| D | bn_mp_prime_is_divisible.c | 33 if ((err = mp_mod_d (a, ltm_prime_tab[ix], &res)) != MP_OKAY) { in mp_prime_is_divisible()
|
| D | bn_mp_is_square.c | 66 if ((res = mp_mod_d(arg,105,&c)) != MP_OKAY) { in mp_is_square()
|
| D | bn_mp_prime_next_prime.c | 97 if ((err = mp_mod_d(a, ltm_prime_tab[x], res_tab + x)) != MP_OKAY) { in mp_prime_next_prime()
|
| D | tommath.h | 352 int mp_mod_d(mp_int *a, mp_digit b, mp_digit *c);
|
| D | changes.txt | 376 -- fixed a bug in mp_mod and mp_mod_d concerning negative inputs
|
| D | bn.tex | 1826 int mp_mod_d(mp_int *a, mp_digit b, mp_digit *c);
|
| /external/dropbear/libtomcrypt/src/headers/ |
| D | tomcrypt_math.h | 480 #define mp_mod_d(a, b, c) ltc_mp.modi(a, b, c) macro
|
| /external/dropbear/libtommath/mtest/ |
| D | mpi.h | 144 mp_err mp_mod_d(mp_int *a, mp_digit d, mp_digit *c);
|
| D | mpi.c | 1413 mp_err mp_mod_d(mp_int *a, mp_digit d, mp_digit *c) in mp_mod_d() function
|
| /external/dropbear/libtomcrypt/src/math/ |
| D | ltm_desc.c | 286 if ((err = mpi_to_ltc_error(mp_mod_d(a, b, &tmp))) != CRYPT_OK) { in modi()
|
| /external/dropbear/libtommath/pre_gen/ |
| D | mpi.c | 3938 if ((res = mp_mod_d(arg,105,&c)) != MP_OKAY) { in mp_is_square()
4655 mp_mod_d (mp_int * a, mp_digit b, mp_digit * c) in mp_mod_d() function
5620 if ((err = mp_mod_d (a, ltm_prime_tab[ix], &res)) != MP_OKAY) { in mp_prime_is_divisible()
5932 if ((err = mp_mod_d(a, ltm_prime_tab[x], res_tab + x)) != MP_OKAY) { in mp_prime_next_prime()
|