Author:
Nisviasari R,Dafik ,Agustin I H,Kurniawati E Y,Maylisa I N,Septory B J
Abstract
Abstract
Nowadays, cryptosystems can be applied in several areas in life. One of them is in transaction data. In transaction data, a very strong cryptosystem is needed so that the transaction data is safe. Cryptosystems are better with a strong keystream. In this case, we use rainbow antimagic as a cryptosystem key to improve the robustness of the keystream by using affine cipher. The algorithm uses the edge weights of rainbow antimagic vertex labeling of graphs as a key for encryption and decryption. In this paper, we found the rainbow antimagic connection number of tadpole graphs and two algorithms to straighten affine ciphers.
Subject
General Physics and Astronomy
Reference8 articles.
1. Rainbow connection in graphs;Chartrand;Math. Bohem.,2008
2. On local super antimagic total face coloring and the application in developing a cipher block chaining key;Dafik;Journal of Discrete Mathematical Sciences Cryptography,2021
3. A Dynamic Survey of Graph Labeling;Gallian,2019
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Graph Key-Based Encryption Technique for IoT Networks: Graph-Affine Cipher;Proceedings of the 2nd International Conference on Cognitive and Intelligent Computing;2023
2. On Rainbow Antimagic Coloring of Some Classes of Graphs;Proceedings of the 6th International Conference on Combinatorics, Graph Theory, and Network Topology (ICCGANT 2022);2023
3. A Study of the Rainbow Antimagic Coloring of Double Wheel and Parachute Graphs;Proceedings of the 6th International Conference on Combinatorics, Graph Theory, and Network Topology (ICCGANT 2022);2023