Improving the RSA cryptographic algorithm using double encryption

Abstract

Cryptographic algorithms are essential parts in network security, and cryptography is one of the main tools for privacy, trust, access control, electronic payments, corporate security, and countless other fields. The RSA algorithm is one of the most widely used and strongest cryptographic algorithms for over 20 years. It has braved attacks of many sorts, and been updated with various modifications. It is however feared that this algorithm is vulnerable, and its life-span is indeed a matter of an un-predictable technological revolution. In this Research, the RSA algorithm and key variants have been reviewed, and trends in attacks against it analysed. In the suggested modification, we use a transaction integer i and the public and private keys of the receiving entity in a given communication, to generate transaction public and private sub-keys for the communication. To do a double encryption, the public sub-key is used, and then the public key applied to the pre-cipher. The decryption is the reverse; where the receiving entity applies his/her private key before the private sub-key. The impact of this modification on RSA security has been briefly analyzed. Recommendations on further research in this direction are given, and particularly a detailed one suggested in which the Diffie-Hellman algorithm could be used to generate the sub-keys. The research concludes that such modifications to the RSA algorithm if further reasonably proved can considerably improve it, extend its lifespan and provide greater confidence for all its users.