Linear algorithm for Imbricate Cryptography using Pseudo Random Number Generator

Abstract

In this paper we are going to establish the relationship between Randomness and Cryptography. We are going to generate an algorithm by combining the result of the Linear Congruential Pseudo Random Number Generator with Imbricate Cryptography. The following algorithm is Symmetric type Cryptography. It uses a layered approach. The first layer involves implanting a randomly generated number in the text and then transforming the text to form the cipher text at the very first layer. Second layer involves implanting the key to the cipher text obtained in the first layer thus making the security a two way approach. Therefore, the message can only be recovered by using the correct key and the correct Random number generated. The Random number generated is transmitted to the user with the key. Here the message and the key are inwardly plaited. It is not possible to find the key by permutation and combination since the user can choose key of variable length. Multiple Layers of encryption and decryption provide security. The advantage of the process is that it prevents cipher text only attack and known plain text attack. It is also easily computable and efficient. [6]