Searched refs:mp_prime_next_prime (Results 1 – 9 of 9) sorted by relevance
| /external/dropbear/libtommath/ |
| D | bn_mp_prime_next_prime.c | 23 int mp_prime_next_prime(mp_int *a, int t, int bbs_style) in mp_prime_next_prime() function
|
| D | tommath.h | 490 int mp_prime_next_prime(mp_int *a, int t, int bbs_style);
|
| D | changes.txt | 183 v0.23 -- Optimized mp_prime_next_prime() to not use mp_mod [via is_divisible()] in each
|
| D | bn.tex | 1647 int mp_prime_next_prime(mp_int *a, int t, int bbs_style)
|
| /external/dropbear/ |
| D | genrsa.c | 114 if (mp_prime_next_prime(prime, 8, 0) != MP_OKAY) { in getrsaprime()
|
| D | gendss.c | 83 if (mp_prime_next_prime(key->q, 18, 0) != MP_OKAY) { in getq()
|
| /external/dropbear/libtommath/demo/ |
| D | demo.c | 235 mp_prime_next_prime(&a, 5, 1); in main()
|
| /external/dropbear/libtommath/pre_gen/ |
| D | mpi.c | 5858 int mp_prime_next_prime(mp_int *a, int t, int bbs_style) in mp_prime_next_prime() function
|
| /external/dropbear/libtomcrypt/ |
| D | changes | 753 mp_prime_next_prime() from LibTomMath
|