mirror of
https://github.com/openssl/openssl.git
synced 2024-12-09 05:51:54 +08:00
0122add654
Multi-prime RSA security is not determined by modulus length alone, but
depends even on number of primes. Too many primes render security
inadequate, but there is no common amount of primes or common factors'
length that provide equivalent secuity promise as two-prime for given
modulus length. Maximum amount of permitted primes is determined
according to following table.
<1024 | >=1024 | >=4096 | >=8192
------+--------+--------+-------
2 | 3 | 4 | 5
Reviewed-by: Rich Salz <rsalz@openssl.org>
(Merged from https://github.com/openssl/openssl/pull/4791)
|
||
|---|---|---|
| .. | ||
| build.info | ||
| rsa_ameth.c | ||
| rsa_asn1.c | ||
| rsa_chk.c | ||
| rsa_crpt.c | ||
| rsa_depr.c | ||
| rsa_err.c | ||
| rsa_gen.c | ||
| rsa_lib.c | ||
| rsa_locl.h | ||
| rsa_meth.c | ||
| rsa_mp.c | ||
| rsa_none.c | ||
| rsa_oaep.c | ||
| rsa_ossl.c | ||
| rsa_pk1.c | ||
| rsa_pmeth.c | ||
| rsa_prn.c | ||
| rsa_pss.c | ||
| rsa_saos.c | ||
| rsa_sign.c | ||
| rsa_ssl.c | ||
| rsa_x931.c | ||
| rsa_x931g.c | ||