| /external/dropbear/libtomcrypt/src/pk/rsa/ |
| D | rsa_make_key.c | 60 …if ((err = mp_gcd( tmp1, tmp3, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = gcd(p-1,… in rsa_make_key()
67 …if ((err = mp_gcd( tmp1, tmp3, tmp2)) != CRYPT_OK) { goto errkey; } /* tmp2 = gcd(q-1, … in rsa_make_key()
|
| /external/dropbear/libtommath/ |
| D | bn_mp_lcm.c | 30 if ((res = mp_gcd (a, b, &t1)) != MP_OKAY) { in mp_lcm()
|
| D | bn_mp_gcd.c | 19 int mp_gcd (mp_int * a, mp_int * b, mp_int * c) in mp_gcd() function
|
| D | changes.txt | 8 …-- "mm" from sci.crypt pointed out that my mp_gcd was sub-optimal (I also updated and corrected th…
153 Also, Martin is the fellow who noted the bugs in mp_gcd() of 0.24/0.25.
161 v0.25 -- Fix to mp_gcd again... oops (0,-a) == (-a, 0) == a
166 -- Optimized mp_gcd() by removing mp_div_2d calls for when one of the inputs
175 -- Fixed mp_gcd() so the gcd of 0,0 is 0. Allows the gcd operation to be chained
206 …-- optimized mp_gcd() to use the new mp_cnt_lsb() to replace multiple divisions by two by a single…
275 -- Cleaned up mp_gcd to use the macros for odd/even detection
|
| D | tommath.h | 372 int mp_gcd(mp_int *a, mp_int *b, mp_int *c);
|
| D | bn.tex | 1788 int mp_gcd (mp_int * a, mp_int * b, mp_int * c)
|
| /external/dropbear/libtommath/mtest/ |
| D | mtest.c | 209 mp_gcd(&a, &b, &c); in main()
254 mp_gcd(&a, &b, &c); in main()
|
| D | mpi.h | 172 mp_err mp_gcd(mp_int *a, mp_int *b, mp_int *c);
|
| D | mpi.c | 1919 mp_err mp_gcd(mp_int *a, mp_int *b, mp_int *c) in mp_gcd() function
2036 if((res = mp_gcd(a, b, &gcd)) != MP_OKAY) in mp_lcm()
|
| /external/dropbear/ |
| D | genrsa.c | 125 if (mp_gcd(primeminus, rsa_e, &temp_gcd) != MP_OKAY) { in getrsaprime()
|
| /external/dropbear/libtomcrypt/src/pk/dsa/ |
| D | dsa_sign_hash.c | 80 … if ((err = mp_gcd(k, key->q, tmp)) != CRYPT_OK) { goto error; } in dsa_sign_hash_raw()
|
| /external/dropbear/libtomcrypt/src/pk/katja/ |
| D | katja_make_key.c | 58 if ((err = mp_gcd(p, tmp1, tmp2)) != CRYPT_OK) { goto done; } in katja_make_key()
|
| /external/dropbear/libtommath/demo/ |
| D | timing.c | 291 mp_gcd(&a, &b, &c); in main()
|
| D | demo.c | 600 mp_gcd(&d, &b, &d); in main()
666 mp_gcd(&a, &b, &e); in main()
|
| /external/dropbear/libtommath/etc/ |
| D | pprime.c | 256 if ((res = mp_gcd (&n, &v, &y)) != MP_OKAY) { /* y = (n, v) */ in pprime()
|
| /external/dropbear/libtomcrypt/src/headers/ |
| D | tomcrypt_math.h | 481 #define mp_gcd(a, b, c) ltc_mp.gcd(a, b, c) macro
|
| /external/dropbear/libtomcrypt/src/math/ |
| D | ltm_desc.c | 299 return mpi_to_ltc_error(mp_gcd(a, b, c)); in gcd()
|
| /external/dropbear/libtommath/pre_gen/ |
| D | mpi.c | 3174 int mp_gcd (mp_int * a, mp_int * b, mp_int * c) in mp_gcd() function
4420 if ((res = mp_gcd (a, b, &t1)) != MP_OKAY) { in mp_lcm()
|