Abstract
In this paper, we have developed a block cipher for a block of size 56 bits by using an iterative method involving a permutation. Here we have represented the plaintext as a matrix containing a pair of column vectors comprising binary bits. In the process of encryption, we have used a key matrix (K), which also consists of binary bits. For decryption, we have used the modular arithmetic inverse (K−1) of the key matrix K. In this, we have discussed the cryptanalysis, and have shown that the cipher cannot be broken by any cryptanalytic attack. Finally, the analysis of the cipher is extended to a block of size 112 bits.
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 callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: 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.
