Encryption and Decryption using Hill Cipher and Integral Transforms

Abstract

We know that Hill Cipher is one of the regular methods that is used in cryptography for encryption and decryption of data using modular arithmetic under different modulus. Moreover, we have seen results using some integral transforms like Laplace transforms, Aboodh transforms and many more. This paper extracts the result of dual encryption and decryption with a combination of Hill Cipher and few integral transforms.

Introduction: In many circumstances, the sender wants to keep the message private from the public or from unauthorized users. Here, we combine Hill Cipher with Laplace and Kamal transforms to encrypt the message and apply their inverse transforms to decrypt it. In contrast to cipher text, which is a coded version of plaintext, the original message written by the user is referred to as plaintext.

Objectives: In this paper, we focus on two stages of encryption and two stages of decryption under modulo 255.

Methods: Using Hill Cipher with different transformation techniques, we have encrypted and decrypted the data. One is Hill Cipher with Laplace transform technique while the other is Hill Cipher with Kamal transform technique.

Results: In this paper, we see that the original text is transformed to cipher text which could be retrievable using some techniques.

Conclusions: This is a novel method that uses dual techniques to safeguard data: first, it encrypts the encrypted cipher text, and then it decrypts it again. The data is protected all along the way because the key that is transmitted to the recipient is very big and difficult to crack.