Lines Matching defs:primes
31 static int rsa_keygen(OSSL_LIB_CTX *libctx, RSA *rsa, int bits, int primes,
50 int RSA_generate_multi_prime_key(RSA *rsa, int bits, int primes,
56 return rsa->meth->rsa_multi_prime_keygen(rsa, bits, primes,
65 if (primes == 2)
71 return rsa_keygen(rsa->libctx, rsa, bits, primes, e_value, cb, 0);
75 static int rsa_multiprime_keygen(RSA *rsa, int bits, int primes,
100 if (primes < RSA_DEFAULT_PRIME_NUM || primes > ossl_rsa_multip_cap(bits)) {
116 /* divide bits into 'primes' pieces evenly */
117 quo = bits / primes;
118 rmd = bits % primes;
120 for (i = 0; i < primes; i++)
150 if (primes > RSA_DEFAULT_PRIME_NUM) {
152 prime_infos = sk_RSA_PRIME_INFO_new_reserve(NULL, primes - 2);
162 /* prime_info from 2 to |primes| -1 */
163 for (i = 2; i < primes; i++) {
174 /* generate p, q and other primes (if any) */
175 for (i = 0; i < primes; i++) {
196 * (those primes prior to this one)
241 /* we get at least 2 primes */
274 * For keys with more than 4 primes, we attempt longer factor to
287 if (primes > 4) {
294 * re-generate all primes from scratch, mainly used
305 /* save product of primes for further use, for multi-prime only */
332 for (i = 2; i < primes; i++) {
372 for (i = 2; i < primes; i++) {
398 /* calculate CRT coefficient for other primes */
399 for (i = 2; i < primes; i++) {
424 static int rsa_keygen(OSSL_LIB_CTX *libctx, RSA *rsa, int bits, int primes,
437 if (primes == 2
442 ok = rsa_multiprime_keygen(rsa, bits, primes, e_value, cb);