Searched refs:num_primes (Results 1 – 7 of 7) sorted by relevance
482 const size_t num_primes = num_trial_division_primes(bn); in bn_trial_division() local483 for (size_t i = 1; i < num_primes; i++) { in bn_trial_division()970 const size_t num_primes = num_trial_division_primes(rnd); in probable_prime_dh() local972 for (size_t i = 1; i < num_primes; i++) { in probable_prime_dh()1041 const size_t num_primes = num_trial_division_primes(p); in probable_prime_dh_safe() local1043 for (size_t i = 1; i < num_primes; i++) { in probable_prime_dh_safe()
1134 uint32_t* num_primes, in ParseRsaKeyParms() argument1141 *num_primes = ReadTpmUint32(&buffer); in ParseRsaKeyParms()1168 uint32_t* num_primes, in ParseTpmPubKey() argument1190 key_len, num_primes, exponent); in ParseTpmPubKey()1248 uint32_t num_primes; in TlclReadPubek() local1250 &sig_scheme, &key_len, &num_primes, in TlclReadPubek()1281 num_primes != 2) { in TlclReadPubek()
73 const size_t num_primes = sizeof(primes) / sizeof(*primes); in mbedtls_rsa_deduce_primes() local116 for (; attempt < num_primes; ++attempt) { in mbedtls_rsa_deduce_primes()
390 const size_t num_primes = num_trial_division_primes(bn);391 for (size_t i = 1; i < num_primes; i++) {852 size_t num_primes;880 num_primes = num_trial_division_primes(rnd);882 for (size_t i = 1; i < num_primes; i++) {909 size_t num_primes;952 num_primes = num_trial_division_primes(p);954 for (size_t i = 1; i < num_primes; i++) {
489 const size_t num_primes = num_trial_division_primes(bn);490 for (size_t i = 1; i < num_primes; i++) {951 size_t num_primes;979 num_primes = num_trial_division_primes(rnd);981 for (size_t i = 1; i < num_primes; i++) {1008 size_t num_primes;1051 num_primes = num_trial_division_primes(p);1053 for (size_t i = 1; i < num_primes; i++) {