论文标题
拓扑不对称密码系统中的拓扑认证技术
Topological Authentication Technique In Topologically Asymmetric Cryptosystem
论文作者
论文摘要
从理论到实际应用的拓扑身份验证是一项重要且具有挑战性的任务。越来越多的研究人员关注即将到来的量子计算，隐私数据保护，晶格和密码学。 Research show the advantages of topological authentications through graph operations, various matrices, graph colorings and graph labelings are: related with two or more different mathematical areas, be not pictures, there are huge number of colorings and labelings, rooted on modern mathematics, diversity of asymmetric ciphers, simplicity and convenience, easily created, irreversibility, computational security, provable security, and so on.基于各种图同态，程度序列同态，图形同态的拓扑身份验证。随机拓扑编码和拓扑认证基于hanzi身份验证，随机添加边缘运算，随机的叶片添加算法，绘制随机增加技术，操作图形晶格和动态网络模型及其跨度模型及其跨度树木和最大的叶子覆盖树。拓扑身份验证的实现是一个重要的主题，我们研究：基于彩色图，特定图（完整的图，树，平面图）产生的基于数字的字符串，一些生成公共键的方法。拓扑不对称的密码系统的某些技术是：W型匹配标签，双型标签，相互式标签，拓扑标签，拓扑同源性，索引颜色，图形晶格，图形晶格，程度 - 序列效率，每个零零CDS-MATSERODERTERS，每一个典型的构图组，具有绘画的颜色，这些典型绘制了颜色，并具有图形图形，并具有绘画的颜色，并具有图形图形。自相似的网络晶格。
Making topological authentication from theory to practical application is an important and challenging task. More and more researchers pay attention on coming quantum computation, privacy data protection, lattices and cryptography. Research show the advantages of topological authentications through graph operations, various matrices, graph colorings and graph labelings are: related with two or more different mathematical areas, be not pictures, there are huge number of colorings and labelings, rooted on modern mathematics, diversity of asymmetric ciphers, simplicity and convenience, easily created, irreversibility, computational security, provable security, and so on. Topological authentications based on various graph homomorphisms, degree-sequence homomorphisms, graph-set homomorphisms. Randomly topological coding and topological authentications are based on Hanzi authentication, randomly adding-edge-removing operation, randomly leaf-adding algorithms, graph random increasing techniques, operation graphic lattice and dynamic networked models and their spanning trees and maximum leaf spanning trees. Realization of topological authentication is an important topic, we study: number-based strings generated from colored graphs, particular graphs (complete graphs, trees, planar graphs), some methods of generating public-keys. some techniques of topologically asymmetric cryptosystem are: W-type matching labelings, dual-type labelings, reciprocal-type labelings, topological homomorphisms, indexed colorings, graphic lattices, degree-sequence lattices, every-zero Cds-matrix groups of degree-sequences, every-zero graphic groups, graphic lattices having coloring closure property, self-similar networked lattices.
