Abstract
In this investigation, we have modified the Feistel cipher by taking the plaintext in the form of a pair of square matrices. Here we have introduced the operation multiplication with the key matrices and the modular arithmetic addition in encryption. The modular arithmetic inverse of the key matrix is introduced in decryption. The cryptanalysis carried out in this paper clearly indicate that this cipher cannot be broken by the brute force attack and the known plaintext attack.
Highlights
In a recent investigation [1], we have developed a block cipher by modifying the Feistel cipher
Our objective is to develop a block cipher by replacing the XOR operation in the preceding analysis by modular arithmetic addition
Though we have as many relations as we want between the cipher text and the plain text, the key matrix K cannot be determined as the equations (4.2) are nonlinear and involving mod N
Summary
In a recent investigation [1], we have developed a block cipher by modifying the Feistel cipher. We have taken the plaintext (P) in the form of a pair of matrices P0 and Q0, and introduced a key matrix (K) as a multiplicant of Q0 on both its sides. In this analysis the relations governing the encryption and the decryption are given by. Our objective is to develop a block cipher by replacing the XOR operation in the preceding analysis by modular arithmetic addition.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
