Coding Techniques From Distinguishing Colorings In Topological Coding

Information security is a long-term and relative problem. Since dynamic networks change with time, the coding (coloring or labeling) of dynamic networks is far different from graph colorings/labelings of graph theory. Various distinguishing colorings of graph theory can help us to encrypt dynamic networks wholly, although it is a new topic of network security. We use ice-flower systems to construct lattices (colored star-graphic lattices, star Topcode-matrix lattices) containing networks encrypted wholly by the distinguishing colorings with many restrictions, and propose a difficult problem called Number String Decomposition.