Searched refs:mp_count_bits (Results 1 - 25 of 40) sorted by relevance
12
| /external/dropbear/libtomcrypt/src/pk/asn1/der/integer/ |
| H A D | der_length_integer.c | 38 if ((mp_count_bits(num) & 7) == 0 || mp_iszero(num) == LTC_MP_YES) {
50 z = mp_count_bits(num);
52 if (((mp_cnt_lsb(num)+1)==mp_count_bits(num)) && ((mp_count_bits(num)&7)==0)) --z;
|
| H A D | der_encode_integer.c | 50 if ((mp_count_bits(num) & 7) == 0 || mp_iszero(num) == LTC_MP_YES) {
60 y = mp_count_bits(num);
63 if (((mp_cnt_lsb(num)+1)==mp_count_bits(num)) && ((mp_count_bits(num)&7)==0)) --y;
107 y = mp_count_bits(num);
109 if (((mp_cnt_lsb(num)+1)==mp_count_bits(num)) && ((mp_count_bits(num)&7)==0)) y -= 8;
|
| H A D | der_decode_integer.c | 95 if (mp_2expt(tmp, mp_count_bits(num)) != CRYPT_OK || mp_sub(num, tmp, num) != CRYPT_OK) {
|
| /external/dropbear/libtommath/ |
| H A D | bn_mp_unsigned_bin_size.c | 21 int size = mp_count_bits (a);
|
| H A D | bn_mp_count_bits.c | 20 mp_count_bits (mp_int * a) function
|
| H A D | bn_mp_reduce_2k_setup_l.c | 28 if ((res = mp_2expt(&tmp, mp_count_bits(a))) != MP_OKAY) {
|
| H A D | bn_mp_reduce_is_2k.c | 29 iy = mp_count_bits(a);
|
| H A D | bn_mp_montgomery_calc_normalization.c | 29 bits = mp_count_bits (b) % DIGIT_BIT;
|
| H A D | bn_mp_reduce_2k_setup.c | 28 p = mp_count_bits(a);
|
| H A D | bn_mp_radix_size.c | 29 *size = mp_count_bits (a) + (a->sign == MP_NEG ? 1 : 0) + 1;
|
| H A D | bn_mp_reduce_2k.c | 28 p = mp_count_bits(n);
|
| H A D | bn_mp_reduce_2k_l.c | 31 p = mp_count_bits(n);
|
| H A D | bn_mp_div.c | 51 n = mp_count_bits(a) - mp_count_bits(b);
152 norm = mp_count_bits(&y) % DIGIT_BIT;
|
| H A D | bn_s_mp_exptmod.c | 31 x = mp_count_bits (X);
|
| /external/dropbear/libtommath/demo/ |
| H A D | timing.c | 123 mp_count_bits(&a), CLK_PER_SEC / tt, tt);
145 mp_count_bits(&a), CLK_PER_SEC / tt, tt);
176 mp_count_bits(&a), CLK_PER_SEC / tt, tt);
177 fprintf(log, "%d %9llu\n", mp_count_bits(&a), tt);
196 mp_count_bits(&a), CLK_PER_SEC / tt, tt);
197 fprintf(log, "%d %9llu\n", mp_count_bits(&a), tt);
246 for (rr = 0; rr < (unsigned) mp_count_bits(&a); rr++) {
268 printf("Different (%d)!!!\n", mp_count_bits(&a));
273 mp_count_bits(&a), CLK_PER_SEC / tt, tt);
275 "%d %9llu\n", mp_count_bits(
[all...] |
| /external/dropbear/libtomcrypt/src/pk/katja/ |
| H A D | katja_encrypt_key.c | 56 modulus_bitlen = mp_count_bits((key->N));
|
| H A D | katja_decrypt_key.c | 57 modulus_bitlen = mp_count_bits( (key->N));
|
| /external/dropbear/libtomcrypt/src/pk/rsa/ |
| H A D | rsa_decrypt_key.c | 67 modulus_bitlen = mp_count_bits( (key->N));
|
| H A D | rsa_encrypt_key.c | 67 modulus_bitlen = mp_count_bits( (key->N));
|
| H A D | rsa_sign_hash.c | 65 modulus_bitlen = mp_count_bits((key->N));
|
| H A D | rsa_verify_hash.c | 66 modulus_bitlen = mp_count_bits( (key->N));
|
| /external/dropbear/libtommath/etc/ |
| H A D | drprime.c | 50 fprintf(out, "%d-bit prime:\np == %s\n\n", mp_count_bits(&a), buf); fflush(out);
|
| H A D | pprime.c | 231 while (mp_count_bits (&a) < k) {
232 fprintf (stderr, "prime has %4d bits left\r", k - mp_count_bits (&a));
388 printf ("\n\nTook %ld ticks, %d bits\n", t1, mp_count_bits (&p));
|
| /external/dropbear/ |
| H A D | genrsa.c | 75 } while (mp_count_bits(key->n) % 8 != 0);
|
| /external/dropbear/libtomcrypt/testprof/ |
| H A D | katja_test.c | 25 if (mp_count_bits(key.N) < size - 7) {
26 fprintf(stderr, "katja_%d key modulus has %d bits\n", size, mp_count_bits(key.N));
|
Completed in 565 milliseconds
12