RSA with safe-prime moduli ⇒ RSA
Statement
Hardness of RSA with safe-prime moduli and prime exponents greater than the number of parties is hardness of RSA for one generator, for any fixed polynomial , with the same advantage — folklore.
Hardness of RSA with safe-prime moduli and prime exponents greater than the number of parties is hardness of RSA for one generator, for any fixed polynomial , with the same advantage — folklore.