RSA Asymmetric Cryptosystem beyond Homogeneous Transformation

Abstract

The Internet is an insecure open network and its use and connectivity have witnessed a significant growth, and this has made it vulnerable to all forms of attacks. A threat to a network can cause harm or interrupt the network. In this paper, we looked at the security of data and message, using  asymmetric cryptography, with regard to secret communication over an insecure network. Rivest, Shamir, and Adleman (RSA), is an asymmetric cryptosystem. Our work is an extension and modification of the RSA cryptosystem. What is actually being sent across the insecure network is the encrypted data. In carrying out this research, the methodology we have adopted is the Structured Systems Analysis Method (SSADM). RSA is based on homogeneous encryption, which means that the message to be  encrypted does not undergo any form of transformation or encoding prior to encryption and the level of encryption is one. In our work, we extended the level of encryption to two, which makes it heterogeneous. Prior to encryption, the message is subjected to an encoding mechanism using ‘Delta Encoding Technique’. We developed a number of programs for: prime number generation, pre-computation of public and private keys, and privacy, using Turbo C++ 4.5. Our work was able to address up to 32 bits. The objective of this paper is to develop an encryption scheme which is heterogeneous compared with the current RSA system that is  homogeneous, which brings us toward improved RSA cryptosystem for  privacy in terms of the level of transformation.

Keywords: Cryptosystem, Internet Security, Encryption, Decryption,  Homogeneous, Heterogeneous