Update to OpenSSL 1.0.2.o
This commit is contained in:
@@ -109,6 +109,17 @@ static int rsa_builtin_keygen(RSA *rsa, int bits, BIGNUM *e_value,
|
||||
BIGNUM *pr0, *d, *p;
|
||||
int bitsp, bitsq, ok = -1, n = 0;
|
||||
BN_CTX *ctx = NULL;
|
||||
unsigned long error = 0;
|
||||
|
||||
/*
|
||||
* When generating ridiculously small keys, we can get stuck
|
||||
* continually regenerating the same prime values.
|
||||
*/
|
||||
if (bits < 16) {
|
||||
ok = 0; /* we set our own err */
|
||||
RSAerr(RSA_F_RSA_BUILTIN_KEYGEN, RSA_R_KEY_SIZE_TOO_SMALL);
|
||||
goto err;
|
||||
}
|
||||
|
||||
ctx = BN_CTX_new();
|
||||
if (ctx == NULL)
|
||||
@@ -145,43 +156,51 @@ static int rsa_builtin_keygen(RSA *rsa, int bits, BIGNUM *e_value,
|
||||
if (BN_copy(rsa->e, e_value) == NULL)
|
||||
goto err;
|
||||
|
||||
BN_set_flags(r2, BN_FLG_CONSTTIME);
|
||||
/* generate p and q */
|
||||
for (;;) {
|
||||
if (!BN_generate_prime_ex(rsa->p, bitsp, 0, NULL, NULL, cb))
|
||||
goto err;
|
||||
if (!BN_sub(r2, rsa->p, BN_value_one()))
|
||||
goto err;
|
||||
if (!BN_gcd(r1, r2, rsa->e, ctx))
|
||||
goto err;
|
||||
if (BN_is_one(r1))
|
||||
ERR_set_mark();
|
||||
if (BN_mod_inverse(r1, r2, rsa->e, ctx) != NULL) {
|
||||
/* GCD == 1 since inverse exists */
|
||||
break;
|
||||
}
|
||||
error = ERR_peek_last_error();
|
||||
if (ERR_GET_LIB(error) == ERR_LIB_BN
|
||||
&& ERR_GET_REASON(error) == BN_R_NO_INVERSE) {
|
||||
/* GCD != 1 */
|
||||
ERR_pop_to_mark();
|
||||
} else {
|
||||
goto err;
|
||||
}
|
||||
if (!BN_GENCB_call(cb, 2, n++))
|
||||
goto err;
|
||||
}
|
||||
if (!BN_GENCB_call(cb, 3, 0))
|
||||
goto err;
|
||||
for (;;) {
|
||||
/*
|
||||
* When generating ridiculously small keys, we can get stuck
|
||||
* continually regenerating the same prime values. Check for this and
|
||||
* bail if it happens 3 times.
|
||||
*/
|
||||
unsigned int degenerate = 0;
|
||||
do {
|
||||
if (!BN_generate_prime_ex(rsa->q, bitsq, 0, NULL, NULL, cb))
|
||||
goto err;
|
||||
} while ((BN_cmp(rsa->p, rsa->q) == 0) && (++degenerate < 3));
|
||||
if (degenerate == 3) {
|
||||
ok = 0; /* we set our own err */
|
||||
RSAerr(RSA_F_RSA_BUILTIN_KEYGEN, RSA_R_KEY_SIZE_TOO_SMALL);
|
||||
goto err;
|
||||
}
|
||||
} while (BN_cmp(rsa->p, rsa->q) == 0);
|
||||
if (!BN_sub(r2, rsa->q, BN_value_one()))
|
||||
goto err;
|
||||
if (!BN_gcd(r1, r2, rsa->e, ctx))
|
||||
goto err;
|
||||
if (BN_is_one(r1))
|
||||
ERR_set_mark();
|
||||
if (BN_mod_inverse(r1, r2, rsa->e, ctx) != NULL) {
|
||||
/* GCD == 1 since inverse exists */
|
||||
break;
|
||||
}
|
||||
error = ERR_peek_last_error();
|
||||
if (ERR_GET_LIB(error) == ERR_LIB_BN
|
||||
&& ERR_GET_REASON(error) == BN_R_NO_INVERSE) {
|
||||
/* GCD != 1 */
|
||||
ERR_pop_to_mark();
|
||||
} else {
|
||||
goto err;
|
||||
}
|
||||
if (!BN_GENCB_call(cb, 2, n++))
|
||||
goto err;
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user