Analisis Rainbow Vertex Antimagic Coloring dan Aplikasinya pada Kriptografi Secret Sharing dengan Teknik Affine Cipher

Abstract

Rainbow vertex antimagic coloring is a combination of rainbow vertex connection with antimagic labeling. Rainbow Vertex Connection is a vertex coloring in a graph G, where each vertex in the graph is connected by a path that has interior vertices with different colors. Suppose a graph G = (V, E) is a simple connected graph. For a bijective function mapping f : E(G) → {1, 2, 3, ..., E(G)} and v ∈ V (G), the point weight function wf(v) = P e∈E(v) f(e), where E(v) is the set of edges adjacent to point v. Graph G is said to be Rainbow Vertex Antimagic Coloring if all its internal points have different colors. In this paper, we will study rainbow vertex antimagic coloring of Shadow D2(Sn) and Amal(Vn, v, m) graph. This research applies rainbow vertex antimagic coloring to cryptographic secret sharing with affine cipher technique. Rainbow vertex antimagic coloring is used in the secret sharing stage to back up the message by dividing the key into chunks and Rainbow vertex antimagic coloring is also used as the key in the encryption and decryption stages using affine cipher technique. This paper also analyzes the security level of encryption by analyzing the brute force test, encryption time, and encryption size. Rainbow vertex antimagic coloring on Shadow D2(Sn) and Amal(Vn, v, m) graph can be applied effectively during the encryption and decryption process using affine cipher technique.