Searched refs:mp_sqrmod (Results 1 – 10 of 10) sorted by relevance
| /external/dropbear/libtommath/etc/ |
| D | pprime.c | 277 if ((res = mp_sqrmod (&y, &n, &y)) != MP_OKAY) { /* y = x^2a mod n */ in pprime()
294 if ((res = mp_sqrmod (&y, &n, &y)) != MP_OKAY) { /* y = x^2b mod n */ in pprime()
311 if ((res = mp_sqrmod (&y, &n, &y)) != MP_OKAY) { /* y = x^2ab mod n */ in pprime()
|
| /external/dropbear/libtommath/ |
| D | bn_mp_sqrmod.c | 20 mp_sqrmod (mp_int * a, mp_int * b, mp_int * c) in mp_sqrmod() function
|
| D | bn_mp_prime_miller_rabin.c | 74 if ((err = mp_sqrmod (&y, a, &y)) != MP_OKAY) { in mp_prime_miller_rabin()
|
| D | tommath.h | 366 int mp_sqrmod(mp_int *a, mp_int *b, mp_int *c);
|
| /external/dropbear/libtommath/mtest/ |
| D | mpi.h | 149 mp_err mp_sqrmod(mp_int *a, mp_int *m, mp_int *c);
151 #define mp_sqrmod(a, m, c) mp_mulmod(a, a, m, c) macro
|
| D | mpi.c | 1603 mp_err mp_sqrmod(mp_int *a, mp_int *m, mp_int *c) in mp_sqrmod() function
|
| /external/dropbear/libtomcrypt/src/headers/ |
| D | tomcrypt_math.h | 485 #define mp_sqrmod(a, b, c) ltc_mp.sqrmod(a, b, c) macro
|
| /external/dropbear/libtomcrypt/src/math/ |
| D | ltm_desc.c | 325 return mpi_to_ltc_error(mp_sqrmod(a,b,c)); in sqrmod()
|
| /external/dropbear/libtomcrypt/src/math/fp/ |
| D | ltc_ecc_fp_mulmod.c | 740 …if ((err = mp_sqrmod(fp_cache[idx].LUT[x]->z, modulus, tmp)) != CRYPT_OK) … in build_lut()
|
| /external/dropbear/libtommath/pre_gen/ |
| D | mpi.c | 5802 if ((err = mp_sqrmod (&y, a, &y)) != MP_OKAY) { in mp_prime_miller_rabin()
7345 mp_sqrmod (mp_int * a, mp_int * b, mp_int * c) in mp_sqrmod() function
|