International Journal of Soft Computing and Engineering (IJSCE)
Multiprime RSA is a version of original RSA. In Multiprime RSA, the modulus is a product of three or more primes. The encryption process is similar to the original RSA. The decryption and signature schemes can be done by Chinese Remainder Theorem. Lattice reduction is a powerful algorithm for cryptanalyzing public key cryptosystems, especially RSA. There exist several attacks on RSA by using the lattice reduction techniques. In this paper, the authors attack on the version of RSA, called Multiprime RSA, by using the lattice reduction techniques.