Abstract
In this paper, we have developed a block cipher by applying an iterative method. In the process of encryption, we have used a key matrix (K) in which all the elements are binary bits. In the process of decryption, we have utilized the modular arithmetic inverse (K-1). In the process of encryption, the elements of the plaintext and the elements of the key are thoroughly mixed so that the strength of the algorithm increases remarkably. In this we have obtained the ciphertext for large blocks of plaintext.
Highlights
In this paper, we have developed a block cipher by applying an iterative method
We introduce an iterative scheme in order to achieve a thorough mixing of the plaintext and the key, so that it enhances the strength of the cipher
Following Feistel, we have developed a block cipher, wherein the key matrix and the plaintext vector are converted into binary bits and mod 2 operation is carried out to obtain the ciphertext
Summary
K (= YX-1 mod 26) could be obtained by determining X-1, where X-1 is the modular arithmetic inverse of X All this has happened as the plaintext matrix X is not thoroughly mixed with the key matrix K diffusion is present. Following Feistel, we have developed a block cipher, wherein the key matrix and the plaintext vector are converted into binary bits and mod 2 operation is carried out to obtain the ciphertext. In this we have shown that a thorough mixing of the elements of the key matrix and the plaintext matrix will lead to a cipher, which cannot be broken by any cryptanalytic attack.
Sign-in/Register to view highlights & summary 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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
