Abstract

In this paper, we have developed a modification to the Feistel cipher by taking the plaintext in the form of a pair of matrices and introducing a set of functions namely, substitute, shifting of rows, mixing of columns and XOR operation with a key. Further we have supplemented this process by using another function called shuffling at the end of each round of the iteration process. In this analysis, the cryptanalysis clearly indicates that the strength of the cipher is quite significant and this is achieved by the introduction of the aforementioned functions.

Highlights

  • The study of the Feistel cipher has been a fascinating fundamental area in the development of block ciphers in cryptography

  • Our objective is to study a modification of the Feistel cipher, wherein we use the fundamental operations such as substitution, shifting of rows, mixing of columns, XOR operation and Shuffling

  • We have offered a through modification in the Feistel cipher by taking the plaintext in the form of a pair of matrices, and by applying several procedures, namely, substitution, shifting, mixing, XORing with the key and shuffle operation

Read more

Summary

INTRODUCTION

The study of the Feistel cipher has been a fascinating fundamental area in the development of block ciphers in cryptography. We have offered several modifications [1,2,3,4] to the classical Feistel cipher by taking the plaintext in the form of a pair of matrices In all these investigations, we have made use of the multiplication with a single key matrix or the multiplication with a pair of key matrices as a fundamental tool in the development of the cipher. We have made use of the multiplication with a single key matrix or the multiplication with a pair of key matrices as a fundamental tool in the development of the cipher This is associated with the mod operation. Our objective is to study a modification of the Feistel cipher, wherein we use the fundamental operations such as substitution, shifting of rows, mixing of columns, XOR operation and Shuffling.

DEVELOPMENT OF THE CIPHER
Algorithm for Encryption
22 E7 AD 35
ILLUSTRATION OF THE CIPHER
CRYPTANALYSIS
COMPUTATIONS AND CONCLUSIONS
Full Text
Paper version not known

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