An Improved RSA Algorithm for Enhanced Security
Kannan Balasubramanian1, M. Arun2, K. R. Sekar3
1Dr. Kannan Balasubramanian, School of Computing, SASTRA Universiry, Thanjavur, India.
2M. Arun, Associate Professor, Department of Computer Science and Engineering, Veltech Rangarajan Dr. Sagunthala R& D Institute of Science and Technology (Deemed to be University), Chennai. (Tamil Nadu), India.
3Dr. K. R. Sekar, School of Computing, SASTRA University, Thanjavur, India.
Manuscript received on 22 September 2022 | Revised Manuscript received on 01 October 2022 | Manuscript Accepted on 15 November 2022 | Manuscript published on 30 November 2022 | PP: 1-4 | Volume-2 Issue-2, November 2022 | Retrieval Number: 100.1/ijcns.B1421112222 | DOI: 10.54105/ijcns.B1421.112222
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Published by Lattice Science Publication (LSP). This is an open-access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: The security of the Rivest-Shamir-Adelman (RSA) public key algorithm depends on the difficulty of factoring the modulus calculated by multiplying two large prime numbers. The usefulness of the RSA public key algorithm lies in using one key for encryption and another key for decryption. However, a poor choice of the keys used in encryption and decryption can affect the security of the RSA cryptosystem. Many proposals have been made to modify the RSA cryptosystem in such a way that the attacks on the RSA cryptosystem can be overcome. In this article, we propose concealing the publicly disclosed parameters, the encryption key and the common modulus of the RSA cryptosystem by altering the values sent publicly. The values sent publicly are different from the one used in the algorithm which conceals the actual parameters to others. The implementation of this idea uses two different algorithms and randomly choosing between the algorithms. The choice of the algorithm is done using a random number generator and this choice of the algorithm has to be communicated so the decrypt or uses the correct algorithm to decrypt the encrypted data. Finally we explore a faster way to implement the modular exponentiation algorithm used in the RSA encryption and decryption.
Keywords: Public Key Cryptosystem, Encryption and Decryption Keys, Common Modulus, RSA cryptosystem, Factoring attack, PRNG, TRNG.
Scope of the Article: Cryptographic Protocols