A generalized scheme for data encryption technique using a randomized matrix key
Addepalli V. N. Krishna, Soumen Pandit, A. Vinaya Babu · Journal of Discrete Mathematical Sciences and Cryptography · 2007
In public key encryption there is always a possibility of some information being leaked out. Because a cryptoanalyst can always encrypt random messages with a public key, he can get some information. Not a whole of information is to be gained here, but there are potential problems with allowing a crypto analyst to encrypt random messages with public key. Some information is leaked out every time to the crypto analyst, he encrypts a message. With probabilistic encryption algorithms, a crypto analyst can no longer encrypt random plain texts looking for correct cipher text. Since multiple cipher texts will be developed for one plain text, even if he decrypts the message to plain text, he does not know how far he had guessed the message correctly. There are several algorithms for encryption. The algorithm that is going to be discussed in this work is going to generate a sequence. The algorithm considers a matrix key and executes a sequence of steps, which generates this sequence. Based on the similarity of values this sequence is being divided into basins. Each basin represents one character. Each character in the plain text is replaced by a corresponding basin value. Thus the cipher text obtained becomes impossible to be broken without knowing the key.