Searched refs:mp_cnt_lsb (Results 1 – 12 of 12) sorted by relevance
45 u_lsb = mp_cnt_lsb(&u); in mp_gcd()46 v_lsb = mp_cnt_lsb(&v); in mp_gcd()86 if ((res = mp_div_2d(&v, mp_cnt_lsb(&v), &v, NULL)) != MP_OKAY) { in mp_gcd()
23 int mp_cnt_lsb(mp_int *a) in mp_cnt_lsb() function
57 k = mp_cnt_lsb(&a1); in mp_jacobi()
54 s = mp_cnt_lsb(&r); in mp_prime_miller_rabin()
279 int mp_cnt_lsb(mp_int *a);
96 -- Sped up mp_cnt_lsb() by using a 4x4 table [e.g. 4x speedup]205 -- added mp_cnt_lsb() which counts how many of the lsbs are zero206 …-- optimized mp_gcd() to use the new mp_cnt_lsb() to replace multiple divisions by two by a single…
63 if (((mp_cnt_lsb(num)+1)==mp_count_bits(num)) && ((mp_count_bits(num)&7)==0)) --y; 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()
52 if (((mp_cnt_lsb(num)+1)==mp_count_bits(num)) && ((mp_count_bits(num)&7)==0)) --z; in der_length_integer()
245 if (mp_cnt_lsb(&a) != ix) { in main()246 printf("Failed at %d, %d\n", ix, mp_cnt_lsb(&a)); in main()
461 #define mp_cnt_lsb(a) ltc_mp.count_lsb_bits(a) macro
155 return mp_cnt_lsb(a); in count_lsb_bits()
1400 int mp_cnt_lsb(mp_int *a) in mp_cnt_lsb() function3200 u_lsb = mp_cnt_lsb(&u); in mp_gcd()3201 v_lsb = mp_cnt_lsb(&v); in mp_gcd()3241 if ((res = mp_div_2d(&v, mp_cnt_lsb(&v), &v, NULL)) != MP_OKAY) { in mp_gcd()4042 k = mp_cnt_lsb(&a1); in mp_jacobi()5782 s = mp_cnt_lsb(&r); in mp_prime_miller_rabin()