Enhancing Security in RSA Cryptosystem Using Burrows-Wheeler Transformation and Run Length Encoding

Abstract

While transmitting the plaintext, to speed up the transmission and eliminating redundancy, it is necessary to compress the text. As the original form of plaintext is altered when compression is used, the eavesdropper may not easily be cracked the correct plaintext which produces first level of security. Once the compression has been done, encoding is performed to form the different format so that fewer bits will be used to represent the original plaintext thereby size of the original text is reduced which produces the second level of security. For that the Burrows-Wheeler Transform lossless compression technique is used in this paper to transform the plaintext and the transformation permutes the order of characters. To reduce the redundancy and to increase the efficiency of algorithm, move-to-front transformation is performed in BWT. Further, the transformed code is again compressed using run length encoding and then it is encrypted using RSA public-key algorithm in which block size is determined dynamically in this paper. The experimental results clearly show that the increasing of encryption and decryption time and enhancing the security of RSA.