| /external/dropbear/libtomcrypt/src/pk/asn1/der/integer/ |
| D | der_encode_integer.c | 50 if ((mp_count_bits(num) & 7) == 0 || mp_iszero(num) == LTC_MP_YES) { in der_encode_integer()
60 y = mp_count_bits(num); in der_encode_integer()
63 if (((mp_cnt_lsb(num)+1)==mp_count_bits(num)) && ((mp_count_bits(num)&7)==0)) --y; in der_encode_integer()
107 y = mp_count_bits(num); in der_encode_integer()
109 if (((mp_cnt_lsb(num)+1)==mp_count_bits(num)) && ((mp_count_bits(num)&7)==0)) y -= 8; in der_encode_integer()
|
| D | der_length_integer.c | 38 if ((mp_count_bits(num) & 7) == 0 || mp_iszero(num) == LTC_MP_YES) { in der_length_integer()
50 z = mp_count_bits(num); in der_length_integer()
52 if (((mp_cnt_lsb(num)+1)==mp_count_bits(num)) && ((mp_count_bits(num)&7)==0)) --z; in der_length_integer()
|
| D | der_decode_integer.c | 95 if (mp_2expt(tmp, mp_count_bits(num)) != CRYPT_OK || mp_sub(num, tmp, num) != CRYPT_OK) { in der_decode_integer()
|
| /external/dropbear/libtommath/demo/ |
| D | timing.c | 123 mp_count_bits(&a), CLK_PER_SEC / tt, tt); in main()
145 mp_count_bits(&a), CLK_PER_SEC / tt, tt); in main()
176 mp_count_bits(&a), CLK_PER_SEC / tt, tt); in main()
177 fprintf(log, "%d %9llu\n", mp_count_bits(&a), tt); in main()
196 mp_count_bits(&a), CLK_PER_SEC / tt, tt); in main()
197 fprintf(log, "%d %9llu\n", mp_count_bits(&a), tt); in main()
246 for (rr = 0; rr < (unsigned) mp_count_bits(&a); rr++) { in main()
268 printf("Different (%d)!!!\n", mp_count_bits(&a)); in main()
273 mp_count_bits(&a), CLK_PER_SEC / tt, tt); in main()
275 "%d %9llu\n", mp_count_bits(&a), tt); in main()
[all …]
|
| D | demo.c | 188 if (mp_count_bits(&a) != ix) { in main()
189 printf("Prime is %d not %d bits!!!\n", mp_count_bits(&a), ix); in main()
206 if (mp_count_bits(&a) != ix) { in main()
207 printf("Prime is %d not %d bits!!!\n", mp_count_bits(&a), ix); in main()
|
| /external/dropbear/libtommath/ |
| D | bn_mp_div.c | 51 n = mp_count_bits(a) - mp_count_bits(b); in mp_div()
152 norm = mp_count_bits(&y) % DIGIT_BIT; in mp_div()
|
| D | bn_mp_unsigned_bin_size.c | 21 int size = mp_count_bits (a); in mp_unsigned_bin_size()
|
| D | bn_mp_count_bits.c | 20 mp_count_bits (mp_int * a) in mp_count_bits() function
|
| D | bn_mp_reduce_2k_setup_l.c | 28 if ((res = mp_2expt(&tmp, mp_count_bits(a))) != MP_OKAY) { in mp_reduce_2k_setup_l()
|
| D | bn_mp_reduce_is_2k.c | 29 iy = mp_count_bits(a); in mp_reduce_is_2k()
|
| D | bn_mp_reduce_2k_setup.c | 28 p = mp_count_bits(a); in mp_reduce_2k_setup()
|
| D | bn_mp_montgomery_calc_normalization.c | 29 bits = mp_count_bits (b) % DIGIT_BIT; in mp_montgomery_calc_normalization()
|
| D | bn_mp_reduce_2k_l.c | 31 p = mp_count_bits(n); in mp_reduce_2k_l()
|
| D | bn_mp_reduce_2k.c | 28 p = mp_count_bits(n); in mp_reduce_2k()
|
| D | bn_mp_radix_size.c | 29 *size = mp_count_bits (a) + (a->sign == MP_NEG ? 1 : 0) + 1; in mp_radix_size()
|
| /external/dropbear/libtommath/etc/ |
| D | pprime.c | 231 while (mp_count_bits (&a) < k) { in pprime()
232 fprintf (stderr, "prime has %4d bits left\r", k - mp_count_bits (&a)); in pprime()
388 printf ("\n\nTook %ld ticks, %d bits\n", t1, mp_count_bits (&p)); in main()
|
| D | drprime.c | 50 fprintf(out, "%d-bit prime:\np == %s\n\n", mp_count_bits(&a), buf); fflush(out); in main()
|
| /external/dropbear/libtomcrypt/src/pk/katja/ |
| D | katja_encrypt_key.c | 56 modulus_bitlen = mp_count_bits((key->N)); in katja_encrypt_key()
|
| D | katja_decrypt_key.c | 57 modulus_bitlen = mp_count_bits( (key->N)); in katja_decrypt_key()
|
| /external/dropbear/libtomcrypt/testprof/ |
| D | katja_test.c | 25 if (mp_count_bits(key.N) < size - 7) { in katja_test()
26 fprintf(stderr, "katja_%d key modulus has %d bits\n", size, mp_count_bits(key.N)); in katja_test()
|
| /external/dropbear/libtomcrypt/src/pk/rsa/ |
| D | rsa_encrypt_key.c | 67 modulus_bitlen = mp_count_bits( (key->N)); in rsa_encrypt_key_ex()
|
| D | rsa_decrypt_key.c | 67 modulus_bitlen = mp_count_bits( (key->N)); in rsa_decrypt_key_ex()
|
| D | rsa_sign_hash.c | 65 modulus_bitlen = mp_count_bits((key->N)); in rsa_sign_hash_ex()
|
| /external/wpa_supplicant/ |
| D | libtommath.c | 127 static int mp_count_bits(mp_int * a);
702 int size = mp_count_bits (a); in mp_unsigned_bin_size()
1478 static int mp_count_bits (mp_int * a) in mp_count_bits() function
1566 n = mp_count_bits(a) - mp_count_bits(b); in mp_div()
1618 x = mp_count_bits (X); in s_mp_exptmod()
1888 p = mp_count_bits(n); in mp_reduce_2k_l()
1926 if ((res = mp_2expt(&tmp, mp_count_bits(a))) != MP_OKAY) { in mp_reduce_2k_setup_l()
|
| /external/dropbear/ |
| D | genrsa.c | 75 } while (mp_count_bits(key->n) % 8 != 0); in gen_rsa_priv_key()
|