Back to Search
Start Over
Coding Techniques From Distinguishing Colorings In Topological Coding
- Source :
- 2020 IEEE 9th Joint International Information Technology and Artificial Intelligence Conference (ITAIC).
- Publication Year :
- 2020
- Publisher :
- IEEE, 2020.
-
Abstract
- 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.
- Subjects :
- Theoretical computer science
Computer science
business.industry
Network security
String (computer science)
Graph theory
0102 computer and information sciences
Construct (python library)
Star (graph theory)
Encryption
01 natural sciences
010201 computation theory & mathematics
Graph (abstract data type)
business
Coding (social sciences)
Subjects
Details
- Database :
- OpenAIRE
- Journal :
- 2020 IEEE 9th Joint International Information Technology and Artificial Intelligence Conference (ITAIC)
- Accession number :
- edsair.doi...........e36eadb8d768c71fb49601bda73a2b01