| /external/dropbear/libtommath/logs/ |
| graphs.dem | 13 plot 'expt.log' smooth bezier title "Exptmod (Montgomery)", 'expt_dr.log' smooth bezier title "Exptmod (Dimminished Radix)", 'expt_2k.log' smooth bezier title "Exptmod (2k Reduction)"
|
| index.html | 15 <h1>Exptmod</h1>
|
| /external/dropbear/libtommath/ |
| bn_mp_exptmod.c | 20 * exptmod functions. Originally the call to the montgomery code was
100 /* no exptmod for evens */
|
| changes.txt | 235 -- Made the exptmod system be aware of the 2k reduction algorithms.
355 -- Fixed up exptmod to use fewer multiplications
|
| /external/dropbear/libtommath/tombc/ |
| grammar.txt | 13 function := abs | countbits | exptmod | jacobi | print | isprime | nextprime | issquare | readinteger | exit
|
| /external/dropbear/libtomcrypt/src/pk/katja/ |
| katja_exptmod.c | 15 Katja PKCS-style exptmod, Tom St Denis
79 /* exptmod it */
|
| katja_encrypt_key.c | 79 /* Katja exptmod the OAEP pad */
|
| /external/dropbear/libtomcrypt/src/pk/rsa/ |
| rsa_exptmod.c | 15 RSA PKCS exptmod, Tom St Denis
79 /* exptmod it */
|
| rsa_encrypt_key.c | 94 /* rsa exptmod the OAEP or PKCS #1 v1.5 pad */
|
| /external/dropbear/libtomcrypt/src/math/ |
| gmp_desc.c | 372 static int exptmod(void *a, void *b, void *c, void *d) function
439 &exptmod,
|
| ltm_desc.c | 376 static int exptmod(void *a, void *b, void *c, void *d) function
445 &exptmod,
|
| tfm_desc.c | 389 static int exptmod(void *a, void *b, void *c, void *d) function
733 &exptmod,
|
| /external/dropbear/libtommath/demo/ |
| timing.c | 107 goto exptmod;
203 exptmod:
|
| /external/dropbear/libtommath/mtest/ |
| mtest.c | 232 /* exptmod test */
|
| /external/dropbear/ |
| rsa.c | 253 TRACE(("failed exptmod rsa_s"))
|
| options.h | 43 /* Setting this disables the fast exptmod bignum code. It saves ~5kB, but is
|
| /external/wpa_supplicant_8/hostapd/ |
| defconfig | 259 # can be configured to include faster routines for exptmod, sqr, and div to
|
| /external/dropbear/libtomcrypt/src/headers/ |
| tomcrypt_math.h | 328 int (*exptmod)(void *a, void *b, void *c, void *d); member in struct:__anon17392
493 #define mp_exptmod(a,b,c,d) ltc_mp.exptmod(a,b,c,d)
|
| /external/wpa_supplicant_8/src/crypto/ |
| crypto_libtomcrypt.c | 21 #define mp_exptmod(a,b,c,d) ltc_mp.exptmod(a,b,c,d)
|
| /external/wpa_supplicant_8/src/tls/ |
| libtommath.c | 35 /* Include faster exptmod (Montgomery) at the cost of about 2.5 kB in code */
56 /* Current uses do not require support for negative exponent in exptmod, so we
587 * exptmod functions. Originally the call to the montgomery code was
673 /* no exptmod for evens */
[all...] |
| /external/wpa_supplicant_8/wpa_supplicant/ |
| android.config | 363 # can be configured to include faster routines for exptmod, sqr, and div to
|
| defconfig | 365 # can be configured to include faster routines for exptmod, sqr, and div to
|
| /external/dropbear/libtommath/pre_gen/ |
| mpi.c | [all...] |
| /external/dropbear/libtomcrypt/ |
| changes | [all...] |
| crypt.tex | [all...] |
