Research Article Open Access

A Block Cipher using Feistal's Approach Involving Permutation and Mixing of the Plaintext and the Additive Inverse of Key Matrix

Aruna Varanasi and S. U. Kumar

Abstract

In this research, we have developed a block cipher for a block of size 112 bits by using an iterative method involving a permutation of the plaintext and the subkeys generated in each iteration. Here we have represented the plaintext as a matrix of f size 14×8, comprising binary bits. In the process of encryption, we have used a key matrix (K), which also consists of binary bits and generated subkeys from K for each iteration. For decryption, we have used the Additive inverse (K'i)−1 of the subkeys. In this, we have discussed the cryptanalysis and have shown that the cipher cannot be broken by any cryptanalytic attack.

Journal of Computer Science
Volume 4 No. 2, 2008, 117-124

DOI: https://doi.org/10.3844/jcssp.2008.117.124

Submitted On: 11 December 2007 Published On: 28 February 2008

How to Cite: Varanasi, A. & Kumar, S. U. (2008). A Block Cipher using Feistal's Approach Involving Permutation and Mixing of the Plaintext and the Additive Inverse of Key Matrix. Journal of Computer Science, 4(2), 117-124. https://doi.org/10.3844/jcssp.2008.117.124

  • 3,447 Views
  • 2,267 Downloads
  • 0 Citations

Download

Keywords

  • Block cipher
  • subkeys
  • key matrix
  • additive inverse