| /external/dropbear/libtommath/ |
| bn_mp_reduce_2k.c | 19 int mp_reduce_2k(mp_int *a, mp_int *n, mp_digit d) function
|
| bn_mp_reduce_is_2k.c | 18 /* determines if mp_reduce_2k can be used */
|
| bn_mp_exptmod_fast.c | 128 redux = mp_reduce_2k;
|
| tommath.h | 425 /* returns true if a can be reduced with mp_reduce_2k */
432 int mp_reduce_2k(mp_int *a, mp_int *n, mp_digit d);
|
| changes.txt | 234 -- Added mp_reduce_2k which reduces an input modulo n = 2**p - k for any single digit k
|
| bn.tex | [all...] |
| /external/dropbear/libtommath/etc/ |
| mersenne.c | 53 if ((res = mp_reduce_2k (&u, &n, 1)) != MP_OKAY) {
|
| /external/dropbear/libtommath/demo/ |
| demo.c | 252 /* test mp_reduce_2k */
253 printf("Testing mp_reduce_2k...\n");
273 mp_reduce_2k(&b, &a, 2);
|
| /external/dropbear/libtommath/pre_gen/ |
| mpi.c | 6679 int mp_reduce_2k(mp_int *a, mp_int *n, mp_digit d) function
[all...] |
| /external/wpa_supplicant_6/wpa_supplicant/src/tls/ |
| libtommath.c | [all...] |
| /external/wpa_supplicant_8/src/tls/ |
| libtommath.c | [all...] |
