bin_ui.c bin_uiui.c cdiv_q.c cdiv_q_ui.c cdiv_qr.c cdiv_qr_ui.c cdiv_r.c cdiv_r_ui.c cdiv_ui.c cfdiv_q_2exp.c cfdiv_r_2exp.c clear.c clears.c clrbit.c cmp.c cmp_d.c cmp_si.c cmp_ui.c cmpabs.c cmpabs_d.c cmpabs_ui.c com.c combit.c cong.c cong_2exp...
add_ui.c and.c aors.h aors_ui.h aorsmul.c aorsmul_i.c array_init.c bin_ui.c bin_uiui.c cdiv_q.c cdiv_q_ui.c cdiv_qr.c cdiv_qr_ui.c cdiv_r.c cdiv_r_ui.c cdiv_ui.c cfdiv_q_2exp.c cfdiv_r_2exp.c clear.c clears.c clrbit.c cmp.c cmp_d.c cmp_si.c cmp...
cmplog_intelligence taint text_inputs master qemu_variable_map not_colliding_qemu sanitize_coverage fast_path_integration networking maphash frida 2.68c 2.67c 2.66c 2.65c 2.64c 2.63c 2.62c 2.61c 2.60c 2.59c 2.58c 2.57c 2.54c 2.53c
mpz_mmod_ui(rem , n ,2);if(mpz_cmp_ui(rem ,0) ==0) { gmp_printf("\n%Zd is not a prime number\n", n);exit(2); }mpz_tn_minus_1; mpz_init(n_minus_1); mpz_sub_ui(n_minus_1 , n ,1);mpz_tr , s ; mpz_inits(r , s ,NULL); mpz_set(s , n_minus_1); mpz...
}if(!mpz_cmp_ui(num,1))// If num==1 we're donereturn;if(mpz_probab_prime_p(num,10) >0) { mpz_set(factors[num_factors++], num);return; } sieve_factor(num); } 开发者ID:pbos,项目名称:optimus,代码行数:29,代码来源:prime.c ...
mpz_sub_ui(mpzE, n.get_mpz_t(),1); mpz_powm(mpzR, mpzTwo.get_mpz_t(), mpzE, n.get_mpz_t());if(mpz_cmp_ui(mpzR,1) ==0)returntrue;if(fFastFail)returnfalse;// Fermat test failed, calculate chain length (integer and fractional part)mpz_sub(mpzE, n.get_mpz_t(), mpzR...
mpz_set_ui(r,0); mpz_clear(A); mpz_clear(t); } 开发者ID:neilb,项目名称:Math-Prime-Util-GMP,代码行数:58,代码来源:ecpp.c 示例3: fp_invert ▲点赞 3▼ // Inversion is slower than in a naive Fp implementation because of an extra// multiplication.// Requires nonzero a.staticvoid...
mpz_init(P2.x); mpz_init(P2.y);mpz_tdiv_q(t, m, q);if(!ec_affine_multiply(a, t, N, P, &P2, t2)) {mpz_tdiv_q(t, m, q);/* P2 should not be (0,1) */if(!(mpz_cmp_ui(P2.x,0) ==0&& mpz_cmp_ui(P2.y,1) ==0)) { ...
mpz_mod(exp,exp,prime);mpz_pow_ui(eq_result,y,2); mpz_mod(eq_result,eq_result,prime);if(mpz_cmp(eq_result,exp)==0)return1;elsereturn0; } 开发者ID:rfsbarreto,项目名称:ECC,代码行数:16,代码来源:ecc_curve.c 示例5: sum ▲点赞 1▼ ...
intmpz_probab_prime_p(mpz_srcptr n,intreps){mp_limb_tr;/* Handle small and negative n. */if(mpz_cmp_ui (n,1000000L) <=0) {intis_prime;if(mpz_sgn (n) <0) {/* Negative number. Negate and call ourselves. */mpz_tn2;