ON SUPER (3n + 5, 2) − EDGE ANTIMAGIC TOTAL LABELING AND IT’S APPLICATION TO CONSTRUCT HILL CIPHER ALGORITHM

Abstract

Graph labeling can be implemented in solving problems in various fields of life. One of the applications of graph labeling is in security systems. Information security is needed to reduce risk, data manipulation, and unauthorized destruction or destruction of information. Cryptographic algorithms can be used to build security systems. One of the cryptographic algorithms is Hill Cipher. Hill Cipher is a cryptographic algorithm that uses a matrix as a key to perform encryption, decryption, and modulo arithmetic. This study discusses the use of Super (3n+5,2)-edge antimagic total labeling to construct the Hill Cipher algorithm. The variation of the edge weight function and the corresponding edge label on the GSℎack(TB2, v, n) graph, will make the constructed lock more complicated to hack.