Variants of RSA and their cryptanalysis

Abstract

In this paper, I present some of the variants of RSA and analyse the cryptanalytic attacks against these variants. The first variant I present is called the Efficient RSA, where the number of key generation exponents is increased compared to the original RSA. Another variant of RSA I present is called the Dependent RSA which is aimed at providing Semantic Security to the original RSA. A third variant of RSA which I call Carmichael RSA uses the Carmichael function instead of the Euler Phi Function. The other variants that discussed are the Shared RSA, the Multiprime RSA, the Common Prime RSA the CRT-RSA and the Rebalanced CRT-RSA. I discuss the cryptanalysis of these RSA systems along with the implementation aspects of the variants of the RSA Cryptosystem.