A Block Cipher using Feistal's Approach Involving Permutation and Mixing of the Plaintext and the Additive Inverse of Key Matrix
Aruna Varanasi & S. U. Kumar
Journal of Computer Science, Volume 4, Issue 2, pp. 117–124 · doi.org/10.3844/jcssp.2008.117.124
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.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2008 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
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
- Licence
- © Science Publications
- Issue
- Volume 4, Issue 2
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
