Searched refs:exptmod (Results 1 – 10 of 10) sorted by relevance
/external/dropbear/libtommath/demo/ |
D | timing.c | 107 goto exptmod; in main() 203 exptmod: in main()
|
/external/dropbear/libtommath/tombc/ |
D | grammar.txt | 13 function := abs | countbits | exptmod | jacobi | print | isprime | nextprime | issquare | read…
|
/external/dropbear/libtomcrypt/src/headers/ |
D | tomcrypt_math.h | 328 int (*exptmod)(void *a, void *b, void *c, void *d); member 493 #define mp_exptmod(a,b,c,d) ltc_mp.exptmod(a,b,c,d)
|
/external/dropbear/libtomcrypt/src/math/ |
D | gmp_desc.c | 372 static int exptmod(void *a, void *b, void *c, void *d) in exptmod() function 439 &exptmod,
|
D | ltm_desc.c | 376 static int exptmod(void *a, void *b, void *c, void *d) in exptmod() function 445 &exptmod,
|
D | tfm_desc.c | 389 static int exptmod(void *a, void *b, void *c, void *d) in exptmod() function 733 &exptmod,
|
/external/wpa_supplicant/ |
D | crypto_libtomcrypt.c | 28 #define mp_exptmod(a,b,c,d) ltc_mp.exptmod(a,b,c,d)
|
/external/dropbear/libtommath/ |
D | changes.txt | 235 -- Made the exptmod system be aware of the 2k reduction algorithms. 355 -- Fixed up exptmod to use fewer multiplications
|
/external/dropbear/libtomcrypt/ |
D | changes | 870 …-- Added new exptmod function that calculates a^b mod c with fewer multiplies then before [~20% fo…
|
D | crypt.tex | 6279 int (*exptmod)(void *a, void *b, void *c, void *d);
|