Multi-prime RSA is an extended version of RSA in which the modulus is a product of three or more primes. In this paper, we cryptanalyze the Multi-prime RSA if user generates two instances with the same modulus. We use lattice basis reduction and our attack improves the bound of Howgrave-Graham.