| /external/dropbear/ |
| rsa.c | 43 mp_int * rsa_em);
54 key->e = m_malloc(sizeof(mp_int));
55 key->n = m_malloc(sizeof(mp_int));
102 key->d = m_malloc(sizeof(mp_int));
112 key->p = m_malloc(sizeof(mp_int));
113 key->q = m_malloc(sizeof(mp_int));
175 * mp_int e
176 * mp_int n
377 * rsa_em must be a pointer to an initialised mp_int.
381 mp_int * rsa_em)
[all...] |
| random.c | 208 /* Generates a random mp_int.
209 * max is a *mp_int specifying an upper bound.
210 * rand must be an initialised *mp_int for the result.
213 void gen_random_mpint(mp_int *max, mp_int *rand) {
|
| buffer.h | 62 void buf_putmpint(buffer* buf, mp_int * mp);
63 int buf_getmpint(buffer* buf, mp_int* mp);
|
| /external/dropbear/libtommath/ |
| bn_mp_div_2.c | 19 int mp_div_2(mp_int * a, mp_int * b)
|
| bn_mp_mod_2d.c | 20 mp_mod_2d (mp_int * a, int b, mp_int * c)
|
| bn_mp_montgomery_calc_normalization.c | 24 int mp_montgomery_calc_normalization (mp_int * a, mp_int * b)
|
| bn_mp_mul_d.c | 20 mp_mul_d (mp_int * a, mp_digit b, mp_int * c)
|
| bn_mp_prime_is_prime.c | 25 int mp_prime_is_prime (mp_int * a, int t, int *result)
27 mp_int b;
|
| bn_mp_radix_size.c | 19 int mp_radix_size (mp_int * a, int radix, int *size)
22 mp_int t;
|
| bn_mp_toradix.c | 19 int mp_toradix (mp_int * a, char *str, int radix)
22 mp_int t;
|
| bn_s_mp_exptmod.c | 23 int s_mp_exptmod (mp_int * G, mp_int * X, mp_int * P, mp_int * Y, int redmode)
25 mp_int M[TAB_SIZE], res, mu;
28 int (*redux)(mp_int*,mp_int*,mp_int*);
|
| bn_mp_div.c | 21 int mp_div(mp_int * a, mp_int * b, mp_int * c, mp_int * d)
23 mp_int ta, tb, tq, q;
103 int mp_div (mp_int * a, mp_int * b, mp_int * c, mp_int * d)
105 mp_int q, x, y, t1, t2
[all...] |
| bn_mp_exptmod_fast.c | 32 int mp_exptmod_fast (mp_int * G, mp_int * X, mp_int * P, mp_int * Y, int redmode)
34 mp_int M[TAB_SIZE], res;
42 int (*redux)(mp_int*,mp_int*,mp_digit);
|
| bn_fast_s_mp_mul_digs.c | 34 int fast_s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs)
|
| bn_mp_jacobi.c | 21 int mp_jacobi (mp_int * a, mp_int * p, int *c)
23 mp_int a1, p1;
|
| bn_mp_karatsuba_sqr.c | 25 int mp_karatsuba_sqr (mp_int * a, mp_int * b)
27 mp_int x0, x1, t1, t2, x0x0, x1x1;
|
| bn_mp_n_root.c | 28 int mp_n_root (mp_int * a, mp_digit b, mp_int * c)
30 mp_int t1, t2, t3;
|
| bn_mp_add_d.c | 20 mp_add_d (mp_int * a, mp_digit b, mp_int * c)
|
| bn_mp_dr_reduce.c | 33 mp_dr_reduce (mp_int * x, mp_int * n, mp_digit k)
|
| bn_mp_mul_2.c | 19 int mp_mul_2(mp_int * a, mp_int * b)
|
| bn_mp_mul_2d.c | 19 int mp_mul_2d (mp_int * a, int b, mp_int * c)
|
| bn_mp_sub_d.c | 20 mp_sub_d (mp_int * a, mp_digit b, mp_int * c)
|
| bn_mp_toradix_n.c | 22 int mp_toradix_n(mp_int * a, char *str, int radix, int maxlen)
25 mp_int t;
|
| bn_fast_mp_invmod.c | 24 int fast_mp_invmod (mp_int * a, mp_int * b, mp_int * c)
26 mp_int x, y, u, v, B, D;
|
| /external/dropbear/libtomcrypt/src/pk/asn1/der/integer/ |
| der_decode_integer.c | 22 Read a mp_int integer
25 @param num The first mp_int to decode
|
