Enhancing Public Key Cryptography using RSA, RSA-CRT and N-Prime RSA with Multiple Keys
K. Pavani, P. Sriramya
Abstract
Nowadays, the transmission of private statistics through the computer network needs protection. In a broad range of services, protection is equally troubling. In providing data protection against mischievous attacks, cryptographic algorithms play an important role. RS A has a set of rules widely used in renowned Public Key infrastructure implementations. An efficient RSA method with many public keys was implemented in this article. Two exceptional keys for cryptography, also referred to as Public Key cryptography, are used for asymmetrical key cryptography, also referred to as Public Key cryptography. One key is used to encrypt and another one is used to decrypt, where only the alternative equivalent key can be used. No other key, not even the initial key used for encryption, can decrypt the message now. Under this enhanced RSA Encryption Algorithm, several prosecutions have been carried out to make the use of four keys quicker and more efficient than the original encryption and decryption process. This article gives the implementation of the operation of continuous subtraction operation in the place of division operation. By applying this technique, a high computational speed can be achieved and decreased the complexities of mathematical steps.