On local super antimagic total face coloring and the application in developing a cipher block chaining key

Abstract

There is a specific complexity in the use of IOT, especially in maintaining a secure data transaction. We need a good cryptosystem, since the best encryption key relays on the management cryptosystem. The biggest problem, then, is how to encrypt the plaintext into a ciphertext as hard as possible. We attempt to use the local super antimagic total face coloring of graph in developing a cipher block chaining key. By a local super antimagic total face coloring, we mean a bijection from the set of vertices, edges, and faces to {1, 2, 3, … |V(G)|+|E(G)|+|F(G)|} such that any adjacent two faces f 1 and f 2 will receive a different weights w(f 1) ≠ w(f 2) for f 1, f 2 ∈ F(G). If we use the weights as the color of all faces, the local super antimagic total face labeling is said to be a local super antimagic total face coloring. The minimum number possible to color all faces is called the local antimagic total face chromatic number, denoted by γlatf (G). Once, this resulting coloring in hand, we can develop a cipher block chaining key. We describe the results in the following two algorithms.