Research Article Open Access

Modified Hill Cipher with Interlacing and Iteration

V. U.K.. Sastry1 and N. Ravi Shankar2
  • 1 ,
  • 2 , Afganistan
Journal of Computer Science
Volume 3 No. 11, 2007, 854-859


Submitted On: 2 August 2007 Published On: 30 November 2007

How to Cite: Sastry, V. U. & Shankar, N. R. (2007). Modified Hill Cipher with Interlacing and Iteration . Journal of Computer Science, 3(11), 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.

  • 6 Citations



  • Modular arithmetic inverse
  • interlacing
  • decomposition