Topological Coding of Set-labelings and Colorings

With the development of quantum computers, traditional encryption technologies face the risk of being cracked. We use intersected-graphs admitting set-labelings and colorings defined on hyperedge sets to explore topological coding. To enhance resistance against advanced attacks enabled by quantum computing and to offer robust security solutions for the quantum era, we propose employing graph-based techniques involving set-labelings and colorings. These methods, particularly when applied to hypergraphs, have demonstrated notable potential in cryptographic applications due to their structural complexity and encoding capabilities.