Back to Search
Start Over
Number-Based Strings/Passwords From Imaginary Graphs Of Topological Coding For Encryption
- Source :
- 2021 IEEE 4th Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC).
- Publication Year :
- 2021
- Publisher :
- IEEE, 2021.
-
Abstract
- For letting graphic lattices approaching lattices, we define imaginary graphs and the leaf-splitting operation and the leaf-coinciding operation, and show an equivalent property: The leaf-splitting connectivity of a connected im-graph is equivalent to its edge connectivity. Using im-graphs produce complex degree-sequence lattices, graphic lattices, im-graphs in the integer decomposition problem, topological IoT-networks and data-functional IoT-networks. Each integer m with |m| ≥ 2 corresponds at least a graph or an im-graph. We try to build some connections between popular lattices and our lattices, and moreover propose some problems on Hanzi-writings lattices constructed by Chinese character coding.
- Subjects :
- Property (philosophy)
business.industry
Computer science
High Energy Physics::Lattice
Encryption
Topology
Encoding (memory)
Enhanced Data Rates for GSM Evolution
Graphics
business
Integer factorization
MathematicsofComputing_DISCRETEMATHEMATICS
Integer (computer science)
Coding (social sciences)
Subjects
Details
- Database :
- OpenAIRE
- Journal :
- 2021 IEEE 4th Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC)
- Accession number :
- edsair.doi...........7657ce04b72d4c9392194d89ba6bbb60