论文标题

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

Strings And Colorings Of Topological Coding Towards Asymmetric Topology Cryptography

论文作者

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

论文摘要

对于反量词计算,我们将讨论基于数字的各种字符串,例如基于数字的超级弦,参数化字符串,基于集合的字符串,基于图的字符串,基于整数的细分,整数分区和整数构造的字符串,基于Hanzi的字符串,以及基于数字字符串的代数操作。此外,我们介绍了基于数字的字符串色,魔术构成色素以及矢量色和与字符串相关的固定色。对于立即加密整个网络的技术,我们提出了与基于数字的字符串,hanzi graphic lattices,String ofters,All-Tree-Graphic Lattices相关的图形晶格。我们研究了一些不对称拓扑密码学的主题,例如拓扑特征,钥匙对图,密钥对字符串,一次性接收算法和自我认证算法。此处介绍的拓扑技术和算法的一部分与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.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源