Searched refs:mp_prime_is_prime (Results 1 – 17 of 17) sorted by relevance
| /external/dropbear/libtommath/etc/ |
| D | 2kprime.c | 42 mp_prime_is_prime(&q, 1, &y); in main()
50 mp_prime_is_prime(&p, 3, &y); in main()
56 mp_prime_is_prime(&q, 3, &y); in main()
|
| D | drprime.c | 34 mp_prime_is_prime(&a, 1, &res); in main()
39 mp_prime_is_prime(&b, 3, &res); in main()
41 mp_prime_is_prime(&a, 3, &res); in main()
|
| D | mersenne.c | 60 mp_prime_is_prime(&n, 8, pp); in is_mersenne()
|
| /external/dropbear/libtommath/ |
| D | bn_mp_prime_random_ex.c | 93 if ((err = mp_prime_is_prime(a, t, &res)) != MP_OKAY) { goto error; } in mp_prime_random_ex()
104 if ((err = mp_prime_is_prime(a, t, &res)) != MP_OKAY) { goto error; } in mp_prime_random_ex()
|
| D | bn_mp_prime_is_prime.c | 25 int mp_prime_is_prime (mp_int * a, int t, int *result) in mp_prime_is_prime() function
|
| D | tommath.h | 483 int mp_prime_is_prime(mp_int *a, int t, int *result);
|
| D | changes.txt | 244 … -- mp_prime_is_prime will now return true if the input is one of the primes in the prime table
|
| D | bn.tex | 1638 int mp_prime_is_prime (mp_int * a, int t, int *result)
|
| /external/dropbear/libtomcrypt/src/pk/ecc/ |
| D | ecc_test.c | 57 …if ((err = mp_prime_is_prime(modulus, 8, &primality)) != CRYPT_OK) { goto done; } in ecc_test()
64 …if ((err = mp_prime_is_prime(order, 8, &primality)) != CRYPT_OK) { goto done; } in ecc_test()
|
| /external/dropbear/libtomcrypt/src/pk/dsa/ |
| D | dsa_verify_key.c | 38 if ((err = mp_prime_is_prime(key->q, 8, &res)) != CRYPT_OK) { in dsa_verify_key()
45 if ((err = mp_prime_is_prime(key->p, 8, &res)) != CRYPT_OK) { in dsa_verify_key()
|
| D | dsa_make_key.c | 85 … if ((err = mp_prime_is_prime(key->p, 8, &res)) != CRYPT_OK) { goto error; } in dsa_make_key()
|
| /external/dropbear/libtomcrypt/src/math/ |
| D | rand_prime.c | 69 if ((err = mp_prime_is_prime(N, 8, &res)) != CRYPT_OK) { in rand_prime()
|
| D | ltm_desc.c | 390 err = mpi_to_ltc_error(mp_prime_is_prime(a, 8, b)); in isprime()
|
| /external/dropbear/ |
| D | gendss.c | 137 if (mp_prime_is_prime(key->p, 5, &result) != MP_OKAY) { in getp()
|
| /external/dropbear/libtomcrypt/src/headers/ |
| D | tomcrypt_math.h | 494 #define mp_prime_is_prime(a, b, c) ltc_mp.isprime(a, c) macro
|
| /external/dropbear/libtommath/demo/ |
| D | demo.c | 213 mp_prime_is_prime(&a, 8, &cnt); in main()
|
| /external/dropbear/libtommath/pre_gen/ |
| D | mpi.c | 5666 int mp_prime_is_prime (mp_int * a, int t, int *result) in mp_prime_is_prime() function
6158 if ((err = mp_prime_is_prime(a, t, &res)) != MP_OKAY) { goto error; } in mp_prime_random_ex()
6169 if ((err = mp_prime_is_prime(a, t, &res)) != MP_OKAY) { goto error; } in mp_prime_random_ex()
|