arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2209.15312cs.ITmath.IT
收藏

面向非对称拓扑密码的拓扑编码的字符串和着色

Strings And Colorings Of Topological Coding Towards Asymmetric Topology Cryptography

Bing Yao, Chao Yang, Xia Liu, Fei Ma, Jing Su, Hui Sun, Xiaohui Zhang, Yarong Mu

摘要:

在反量子计算中,我们将讨论各种基于数的字符串,如基于数的超字符串,参数化字符串,基于集合的字符串,基于图的字符串,整数分割和整数分解字符串,基于汉字的字符串,以及基于基于数的字符串的代数运算。此外,我们还介绍了基于数的字符串着色,魔术约束着色,以及与字符串相关的向量着色和集合着色。对于一次加密整个网络的技术,我们提出了与基于数字的字符串相关的图形网格、汉字图形网格、字符串组、全树图形网格。本文研究了非对称拓扑密码学中的拓扑签名、密钥对图、密钥对串、一次加密和自认证算法等问题。本文介绍的部分拓扑技术和算法与NP完全问题或NP难问题密切相关。

英文摘要:

We, for anti-quantum computing, will discuss various number-based strings, such as number-based super-strings, parameterized strings, set-based strings, graph-based strings, integer-partitioned and integer-decomposed strings, Hanzi-based strings, as well as algebraic operations based on number-based strings. Moreover, we introduce number-based string-colorings, magic-constraint colorings, and vector-colorings and set-colorings related with strings. For the technique of encrypting the entire network at once, we propose graphic lattices related with number-based strings, Hanzi-graphic lattices, string groups, all-tree-graphic lattices. We study some topics of asymmetric topology cryptography, such as topological signatures, Key-pair graphs, Key-pair strings, one-encryption one-time and self-certification algorithms. Part of topological techniques and algorithms introduced here are closely related with NP-complete problems or NP-hard problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑