A Block Cipher Involving a Key Bunch Matrix and Including another Key Matrix Supported With Modular Arithmetic Addition (original) (raw)
Related papers
International Journal of Advanced Computer Science and Applications, 2012
In this paper, we have devoted our attention to the development of a block cipher, which involves a key bunch matrix, an additional matrix, and a key matrix utilized in the development of a pair of functions called Permute() and Substitute(). These two functions are used for the creation of confusion and diffusion for each round of the iteration process of the encryption algorithm. The avalanche effect shows the strength of the cipher, and the cryptanalysis ensures that this cipher cannot be broken by any cryptanalytic attack generally available in the literature of cryptography.
A Novel Block Cipher Involving a Key bunch Matrix and a Key-based Permutation and Substitution
International Journal of Advanced Computer Science and Applications, 2012
In this paper, we have developed a novel block cipher involving a key bunch matrix supported by a key-based permutation and a key-based substitution. In this analysis, the decryption key bunch matrix is obtained by using the given encryption key bunch matrix and the concept of multiplicative inverse. From the cryptanalysis carried out in this investigation, we have seen that the strength of the cipher is remarkably good and it cannot be broken by any conventional attack.
A Novel Block Cipher Involving a Key Bunch Matrix
International Journal of Computer Applications, 2012
In this paper, we have developed a novel block cipher, which involves a key bunch matrix in the process of encryption. In order to carry out the decryption process, we have obtained the multiplicative inverse of each key in the encryption key bunch matrix by using the concept of multiplicative inverse, and constructed the decryption matrix. In this analysis, the cryptanalysis clearly shows that the strength of the cipher is remarkable, and this cipher can be used for the transmission of information, like any other well-known cipher, through internet.
International Journal of Advanced Computer Science and Applications, 2013
In this paper, we have developed a novel block cipher, which involves a key bunch matrix in the process of encryption. In order to carry out the decryption process, we have obtained the multiplicative inverse of each key in the encryption key bunch matrix by using the concept of multiplicative inverse, and constructed the decryption matrix. In this analysis, the cryptanalysis clearly shows that the strength of the cipher is remarkable, and this cipher can be used for the transmission of information, like any other well-known cipher, through internet.
International Journal of Advanced Computer Science and Applications, 2013
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.
A Block Cipher Involving A Key Matrix And A Key Bunch Matrix, Supplemented With Permutation
2012
In this paper, we have devoted our attention to the development of a block cipher, which involves a key matrix and a key bunch matrix. Here, we have used a function called Permute() for causing permutation of the binary bits of the plaintext, in each round of the iteration process. Here, the diffusion arising on account of the keys and the confusion caused by the permutation, both play a prominent role in strength ening the cipher. The cryptanalysis carried out in this investigation strongly indicates the strength of the cipher.
A NOVEL BLOCK CIPHER INVOLVING KEYS IN A KEY BUNCH MATRIX AS POWERS OF THE PLAINTEXT ELEMENTS
A ( = [a ij ]) in the process of encryption, and B ( = [b ij ]) in the process of decryption. The keys a ij are used as powers of the plaintext elements, and the keys b ij are used as the powers of the ciphertext elements. Here, we have made use of Euler's totient function and Euler's theorem in the development of the cipher. The cryptanalysis clearly shows that the strength of the cipher is quite significant.
Journal of Computer Science, 2008
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 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.
2012
In this investigation, we have developed a block cipher which includes the basic ideas of the modified Feistel cipher and the advanced Hill cipher. In the advanced Hill cipher, as the modular arithmetic inverse of a matrix is the same as the matrix itself, the computations involved in the development of the inverse of the matrix are reduced remarkably. The cryptanalysis carried out in this investigation clearly shows that the strength of the cipher is quite significant as the system of equations occurring in the encryption process are nonlinear, and the supporting functions such as Shift ( ) and Mix ( ) are causing confusion and diffusion in each round of the iteration process.
Proposal of a New Block Cipher reasonably Non-Vulnerable against Cryptanalytic Attacks
ArXiv, 2012
This paper proposes a new block cipher termed as “Modular Arithmetic based Block Cipher with Varying Key-Spaces (MABCVK)” that uses private key-spaces of varying lengths to encrypt data files. There is a simple but intelligent use of theory of modular arithmetic in the scheme of the cipher. Based on observed implementation of the proposed cipher on a set of real data files of several types, all results are tabulated and analyzed. The schematic strength of the cipher and the freedom of using a long key-space expectedly can make it reasonably nonvulnerable against possible cryptanalytic attacks. As a part of the future scope of the work, it is also intended to formulate and implement an enhanced scheme that will use a carrier image to have a secure transmission of the private key