Abstract

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.

Highlights

  • 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

  • We have developed a set of block ciphers [7], [8], [9], “in press” [10], “unpublished” [11], [12], wherein, a secret key bunch matrix plays a prominent role

  • Our objective is to develop a novel block cipher, by using the encryption key bunch matrix, and applying a key-based permutation and substitution which strengthen the cipher in a significant manner

Read more

Summary

Algorithm for Decryption

To have a clear insight into the key dependent permutation process and key dependent substitution process, which we are adopting in this analysis, let us consider a typical example. We write the elements of this key in a tabular form as shown below. The first row shows the serial number and the second row is concerned to the elements in the key K. On considering the order of magnitude of the elements in the key, we can write the above table, by including one more row, in the following form

ASCENDING ORDER
ILLUSTRATION OF THE CIPHER AND THE AVALANCHE
If we assume that the time required for the computation of
COMPUTATIONS AND CONCLUSIONS
Matrix and Including another Key Matrix Supported With Modular
AUTHORS PROFILE
He received the Best Engineering College Faculty Award in Computer
Full Text
Published version (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