Abstract
In this paper, we have developed a block cipher involving a key and a key bunch matrix. In this cipher, we have made use of key-based permutation and key-based substitution. The cryptanalysis carried out in this investigation, shows very clearly, that this cipher is a very strong one. This is all on account of the confusion and the diffusion created by the permutation, the substitution, in each round of the iteration process.
Highlights
The study of the block ciphers [1] is an interesting area of research in cryptography
In the very recent past, we have developed a pair of block ciphers [2,3], which include a key matrix, as it is in the case of the Hill cipher, and a key bunch matrix
[3], we have introduced a function called Permute(), which carries out permutation of binary bits of the plaintext in each round of the iteration process
Summary
The study of the block ciphers [1] is an interesting area of research in cryptography. In the very recent past, we have developed a pair of block ciphers [2,3], which include a key matrix, as it is in the case of the Hill cipher, and a key bunch matrix In these investigations, we have made use of the concepts of the modular arithmetic inverse and the multiplicative inverse. In [2], we have made use of function Mix(), which mixes the binary bits in each round of the iteration process, and in [3], we have introduced a function called Permute(), which carries out permutation of binary bits of the plaintext in each round of the iteration process In these analyses, we have noticed that the key matrix and the key bunch matrix, and the additional function Mix()/ Permute() strengthen the cipher, in a conspicuous manner.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
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
