Home
last modified time | relevance | path

Searched refs:ex_primes (Results 1 – 10 of 10) sorted by relevance

/netbsd-src/crypto/external/bsd/openssl.old/dist/crypto/rsa/
H A Drsa_chk.c23 int ret = 1, ex_primes = 0, idx; in RSA_check_key_ex() local
34 ex_primes = sk_RSA_PRIME_INFO_num(key->prime_infos); in RSA_check_key_ex()
35 if (ex_primes <= 0 in RSA_check_key_ex()
36 || (ex_primes + 2) > rsa_multip_cap(BN_num_bits(key->n))) { in RSA_check_key_ex()
77 for (idx = 0; idx < ex_primes; idx++) { in RSA_check_key_ex()
90 for (idx = 0; idx < ex_primes; idx++) { in RSA_check_key_ex()
99 if (ex_primes) in RSA_check_key_ex()
125 for (idx = 0; idx < ex_primes; idx++) { in RSA_check_key_ex()
194 for (idx = 0; idx < ex_primes; idx++) { in RSA_check_key_ex()
H A Drsa_mp.c66 int i, rv = 0, ex_primes; in rsa_multip_calc_product() local
68 if ((ex_primes = sk_RSA_PRIME_INFO_num(rsa->prime_infos)) <= 0) { in rsa_multip_calc_product()
80 for (i = 0; i < ex_primes; i++) { in rsa_multip_calc_product()
H A Drsa_ossl.c609 int ret = 0, i, ex_primes = 0, smooth = 0; in rsa_ossl_mod_exp() local
622 && ((ex_primes = sk_RSA_PRIME_INFO_num(rsa->prime_infos)) <= 0 in rsa_ossl_mod_exp()
623 || ex_primes > RSA_MAX_PRIME_NUM - 2)) in rsa_ossl_mod_exp()
645 for (i = 0; i < ex_primes; i++) { in rsa_ossl_mod_exp()
658 smooth = (ex_primes == 0) in rsa_ossl_mod_exp()
775 if (ex_primes > 0) { in rsa_ossl_mod_exp()
784 for (i = 0; i < ex_primes; i++) { in rsa_ossl_mod_exp()
858 if (ex_primes > 0) { in rsa_ossl_mod_exp()
864 for (i = 0; i < ex_primes; i++) { in rsa_ossl_mod_exp()
H A Drsa_lib.c172 int ex_primes = sk_RSA_PRIME_INFO_num(rsa->prime_infos); in RSA_security_bits() local
174 if (ex_primes <= 0 || (ex_primes + 2) > rsa_multip_cap(bits)) in RSA_security_bits()
H A Drsa_ameth.c332 int ret = 0, mod_len = 0, ex_primes; in pkey_rsa_print() local
336 ex_primes = sk_RSA_PRIME_INFO_num(x->prime_infos); in pkey_rsa_print()
346 mod_len, ex_primes <= 0 ? 2 : ex_primes + 2) <= 0) in pkey_rsa_print()
/netbsd-src/crypto/external/bsd/openssl/dist/crypto/rsa/
H A Drsa_chk.c26 int ret = 1, ex_primes = 0, idx; in rsa_validate_keypair_multiprime() local
37 ex_primes = sk_RSA_PRIME_INFO_num(key->prime_infos); in rsa_validate_keypair_multiprime()
38 if (ex_primes <= 0 in rsa_validate_keypair_multiprime()
39 || (ex_primes + 2) > ossl_rsa_multip_cap(BN_num_bits(key->n))) { in rsa_validate_keypair_multiprime()
80 for (idx = 0; idx < ex_primes; idx++) { in rsa_validate_keypair_multiprime()
93 for (idx = 0; idx < ex_primes; idx++) { in rsa_validate_keypair_multiprime()
102 if (ex_primes) in rsa_validate_keypair_multiprime()
131 for (idx = 0; idx < ex_primes; idx++) { in rsa_validate_keypair_multiprime()
200 for (idx = 0; idx < ex_primes; idx++) { in rsa_validate_keypair_multiprime()
H A Drsa_mp.c66 int i, rv = 0, ex_primes; in ossl_rsa_multip_calc_product() local
68 if ((ex_primes = sk_RSA_PRIME_INFO_num(rsa->prime_infos)) <= 0) { in ossl_rsa_multip_calc_product()
80 for (i = 0; i < ex_primes; i++) { in ossl_rsa_multip_calc_product()
H A Drsa_ossl.c613 int i, ex_primes = 0; in rsa_ossl_mod_exp() local
630 && ((ex_primes = sk_RSA_PRIME_INFO_num(rsa->prime_infos)) <= 0 in rsa_ossl_mod_exp()
631 || ex_primes > RSA_MAX_PRIME_NUM - 2)) in rsa_ossl_mod_exp()
655 for (i = 0; i < ex_primes; i++) { in rsa_ossl_mod_exp()
671 && (ex_primes == 0) in rsa_ossl_mod_exp()
784 if (ex_primes > 0) { in rsa_ossl_mod_exp()
793 for (i = 0; i < ex_primes; i++) { in rsa_ossl_mod_exp()
869 if (ex_primes > 0) { in rsa_ossl_mod_exp()
875 for (i = 0; i < ex_primes; i++) { in rsa_ossl_mod_exp()
H A Drsa_ameth.c305 int ret = 0, mod_len = 0, ex_primes; in pkey_rsa_print() local
309 ex_primes = sk_RSA_PRIME_INFO_num(x->prime_infos); in pkey_rsa_print()
319 mod_len, ex_primes <= 0 ? 2 : ex_primes + 2) <= 0) in pkey_rsa_print()
H A Drsa_lib.c383 int ex_primes = sk_RSA_PRIME_INFO_num(rsa->prime_infos); in RSA_security_bits() local
385 if (ex_primes <= 0 || (ex_primes + 2) > ossl_rsa_multip_cap(bits)) in RSA_security_bits()