Searched refs:mp_exptmod_fast (Results 1 – 8 of 8) sorted by relevance
| /external/dropbear/libtommath/ |
| D | bn_mp_exptmod.c | 93 return mp_exptmod_fast (G, X, P, Y, dr); in mp_exptmod()
|
| D | bn_mp_exptmod_fast.c | 32 int mp_exptmod_fast (mp_int * G, mp_int * X, mp_int * P, mp_int * Y, int redmode) in mp_exptmod_fast() function
|
| D | tommath.h | 569 int mp_exptmod_fast(mp_int *G, mp_int *X, mp_int *P, mp_int *Y, int mode);
|
| D | changes.txt | 202 …-- Fixed up s_mp_exptmod and mp_exptmod_fast so the lower half of the pre-computed table isn't all…
255 …-- Fixed up mp_exptmod_fast so it would set "redux" to the comba Montgomery reduction if allowed. …
305 -- Sped up mp_exptmod_fast by using new code to find R mod m [e.g. B^n mod m]
|
| /external/wpa_supplicant_6/wpa_supplicant/src/tls/ |
| D | libtommath.c | 174 static int mp_exptmod_fast (mp_int * G, mp_int * X, mp_int * P, mp_int * Y, int redmode);
652 return mp_exptmod_fast (G, X, P, Y, dr); in mp_exptmod()
2940 static int mp_exptmod_fast (mp_int * G, mp_int * X, mp_int * P, mp_int * Y, int redmode) in mp_exptmod_fast() function
|
| /external/wpa_supplicant_8/src/tls/ |
| D | libtommath.c | 174 static int mp_exptmod_fast (mp_int * G, mp_int * X, mp_int * P, mp_int * Y, int redmode);
652 return mp_exptmod_fast (G, X, P, Y, dr); in mp_exptmod()
2940 static int mp_exptmod_fast (mp_int * G, mp_int * X, mp_int * P, mp_int * Y, int redmode) in mp_exptmod_fast() function
|
| /external/wpa_supplicant/ |
| D | libtommath.c | 608 return mp_exptmod_fast (G, X, P, Y, dr); in mp_exptmod()
|
| /external/dropbear/libtommath/pre_gen/ |
| D | mpi.c | 2594 return mp_exptmod_fast (G, X, P, Y, dr); in mp_exptmod()
2649 int mp_exptmod_fast (mp_int * G, mp_int * X, mp_int * P, mp_int * Y, int redmode) in mp_exptmod_fast() function
|