Data Encryption Using Face Antimagic Labeling and Hill Cipher
B. Vasuki, L. Shobana, B. Roopa · Mathematics and Statistics · 2022
An approach to encrypt and decrypt messages is obtained by relating the concepts of graph labeling and cryptography. Among the various types of labelings given in [3], our interest is on face antimagic labeling introduced by Mirka Miller in 2003 [1]. Baca [2] defines a connected plane graph with edge set and face set as face antimagic if there exist positive integers and and a bijection such that the induced mapping , where for a face , is the sum of all for all edges surrounding is also a bijection. In cryptography there are many cryptosystems such as affine cipher, Hill cipher, RSA, knapsack and so on. Amongst these, Hill cipher is chosen for our encryption and decryption. In Hill cipher [8], plaintext letters are grouped into two-letter blocks, with a dummy letter X inserted at the end if needed to make all blocks of the same length, and then replace each letter with its respective ordinal number. Each plaintext block is then replaced by a numeric ciphertext block , where and are different linear combinations of and modulo 26: (mod 26) and (mod 26) with condition as is one. Each number is translated into a cipher text letter which results in cipher text. In this paper, face antimagic labeling on double duplication of graphs along with Hill cipher is used to encrypt and decrypt the message.