Back to Search
Start Over
Various Matchings of Graphic Groups For Graphic Lattices In Topological Coding
- Source :
- 2020 IEEE International Conference on Information Technology,Big Data and Artificial Intelligence (ICIBA).
- Publication Year :
- 2020
- Publisher :
- IEEE, 2020.
-
Abstract
- New security methods based on lattice cryptography emerge today. It has been shown that topological coding made by topological structures and mathematical restrictions can be used to serve information security, since the Number String Decomposition Problem of topological coding is NP-hard. We aim to producing topological coding, encrypting networks wholly and finding matching of twin graphic groups, multiple-graphic groups for serving the construction of graphic lattices. New coloring/labellings, matching-type graphic groups and infinite graphic groups will be discussed, a new Wait-filling Topcode-matrices Problem will be proposed.
- Subjects :
- Matching (graph theory)
Computer science
business.industry
String (computer science)
020206 networking & telecommunications
Cryptography
02 engineering and technology
Topology
Encryption
Lattice (order)
0202 electrical engineering, electronic engineering, information engineering
020201 artificial intelligence & image processing
business
Coding (social sciences)
Subjects
Details
- Database :
- OpenAIRE
- Journal :
- 2020 IEEE International Conference on Information Technology,Big Data and Artificial Intelligence (ICIBA)
- Accession number :
- edsair.doi...........b5e594fd780de51f385e21fcb74bbb8c