Abstract:
In encryption, the data is hide, by which the actual data is recovered through the decryption method. A lot of traditional cryptographic techniques to get the cipher-text in Symmetric cipher technique; such a technique is Hill cipher, Blowfish, Serpent, Twofish, etc. The problem faces in the Hill cipher technique is based on the matrix. Which is not suitable for known plaintext attack because every key matrix is not invertible. In [16] the cipher scheme is based on the Lorenz equation and its parameters values which are publically known plus used for the encryption key. In this research, we proposed a matrix based symmetric cipher algorithm to encounter the issue. A key matrix of n*n size will be multiplied by data and take the mod of result. Applying the substitution Cipher technique and again mod of the result to have the final cipher-text. The key size is using in this cipher scheme make it more resistive beside a known plaintext attack. Computational plus experimental results have shown that this cipher scheme greater security plus meaningfully greater encryption value as related to classical methods.
