Improvement Over Public Key Cryptosystem RSA by Implementing New Decryption Key Generation Algorithm

The RSA encryption is a very fast operation, as the encryption exponent (e) is often chosen to be a small prime. However, the decryption procedure is very slow; due to the fact the decryption exponent is generally a very large integer. This fact remains a problem in many applications of the RSA algorithm. There are many cases when there is a need to improve the decryption key generation time. In this paper, we have introduced RSA cryptosystem and improvements in its decryption procedure to find the value of decryption key. There are already various methods which have been developed to reduce the decryption time such as CRT-RSA, Batch RSA, Re-balanced RSA, Multi Prime RSA, R-Prime RSA, etc. Our proposed work has been implemented by using MATLAB as the programming environment. We have tried for the speed improvement in the decryption key generation time of the public key cryptosystem RSA. We have also shown the graphical comparison of our new approach with the algorithm used in standard RSA cryptosystem.