An improved cryptanalysis of multi-prime RSA with specific forms of decryption exponent

Abstract

Multi-prime RSA (MPRSA) is an extended version of RSA in which the modulus is the product of three or more distinct prime numbers. As with the RSA, this variant is also scrutinized for vulnerabilities. The main goal of the attacks on MPRSA is to test the strength of MPRSA compared to that of RSA to determine whether MPRSA can be used in place of RSA. We apply two famous attacks on RSA to MPRSA by constructing lattices using the Jochemsz and May approach. In comparison to RSA, MPRSA is less vulnerable to both attacks.