Cryptanalysis of Multi Prime RSA with Secret Key Greater than Public Key

Navaneet Ojha ； Sahadeo Padhye

《International Journal of Network Security》 16卷1期 (2014/01) Pp. 53-57

https://doi.org/10.6633/IJNS.201401.16(1).07

並列摘要

The efficiency of decryption process of Multi prime RSA, in which the modulus contains more than two primes, can be speeded up using Chinese remainder theorem (CRT). On the other hand, to achieve the same level of security in terms integer factorization problem the length of RSA modulus must be larger than the traditional RSA case. In [9], authors studied the RSA public key cryptosystem in a special case with the secret exponent d larger than the public exponent e. In this paper, we show that how such attack is performed in the multi-prime RSA case.

並列關鍵字

Coppersmith technique ； cryptanalysis ； lattice basis reduction ； RSA