Download PDFOpen PDF in browser

Using Boolean Rings to Reconstruct the Hill Cipher Algorithm

EasyChair Preprint no. 5138

11 pagesDate: March 12, 2021


In the age of ever-growing technology, information transfer is becoming more and more vulnerable. Cryptography the key which ensures secure communication. In this paper, an attempt to recreate the Hill Cipher encryp-tion scheme has been made where the key structure is based on a group al-gebra G over the boolean ring R. The key idea of the proposal is to overcome the currently existing vulnerabilities in the Hill Cipher. Developed by Lester S. Hill in 1929, the Hill Cipher encryption algorithm was a key invention in the field of Cryptography in the then era. However, changing worlds and de-veloping technologies have made it necessary to make some amendments in the currently existing algorithm. Here, we use Boolean Rings as the key ma-trices to make the encryption scheme stronger and more secure.

Keyphrases: Cryptography, Cyber Security, Encryption Decryption, Hill Cipher, substitution cipher

BibTeX entry
BibTeX does not have the right entry for preprints. This is a hack for producing the correct reference:
  author = {Rishabh Malhotra and Girish Paliwal and S. Srinivasan and Narayanaswamy Chandramowliswaran},
  title = {Using Boolean Rings to Reconstruct the  Hill Cipher Algorithm},
  howpublished = {EasyChair Preprint no. 5138},

  year = {EasyChair, 2021}}
Download PDFOpen PDF in browser