Journal of Computer Science

Modified Hill Cipher with Interlacing and Iteration

V. U.K.. Sastry and N. Ravi Shankar

DOI : 10.3844/jcssp.2007.854.859

Journal of Computer Science

Volume 3, Issue 11

Pages 854-859


In this research, we have developed a block cipher by taking a large key matrix of size nxn and a plaintext matrix containing n rows and two columns. In this, the plaintext column vectors, perated by the key matrix are thoroughly interlaced at each stage of the iteration. As a typical example, we have taken the key in the form an 8×8 matrix and the plaintext in the form of an 8×2 matrix. Here the key is of the size 384 binary bits and the plaintext is of size 112 binary bits. The cryptanalysis carried out in this research clearly indicates that the cipher cannot be broken by any cryptanalytic attack.


© 2007 V. U.K.. Sastry and N. Ravi Shankar. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.