论文标题
拓扑编码中图形的参数化着色和标记
Parameterized Colorings And Labellings Of Graphs In Topological Coding
论文作者
论文摘要
即将到来的量子计算迫使我们重新审查人们使用的密码系统。在不久的将来，我们将拓扑编码的图形应用于现代信息安全和未来的密码学和量子计算机攻击。这里介绍的许多技术都与许多数学猜想和NP问题有关。 We will introduce a group of W-constraint (k,d)-total colorings and algorithms for realizing these colorings in some kinds of graphs, which are used to make quickly public-keys and private-keys with anti-quantum computing, these (k,d)-total colorings are: graceful (k,d)-total colorings, harmonious (k,d)-total colorings, (k,d)-edge-magic总颜色，（k，d） - 差异差异总颜色和（k，d） - 差异差异总颜色。我们使用的有用工具之一称为带有元素的topscode-matrix，可以是各种各样的东西，例如集合，图形，基于数字的字符串。大多数参数化的图形色彩/标签由Topcode-Matrix代数在此处定义。从应用程序的角度来看，我们的许多着色技术都是由算法给出的，并且很容易转换为程序。
The coming quantum computation is forcing us to reexamine the cryptosystems people use. We are applying graph colorings of topological coding to modern information security and future cryptography against supercomputer and quantum computer attacks in the near future. Many of techniques introduced here are associated with many mathematical conjecture and NP-problems. We will introduce a group of W-constraint (k,d)-total colorings and algorithms for realizing these colorings in some kinds of graphs, which are used to make quickly public-keys and private-keys with anti-quantum computing, these (k,d)-total colorings are: graceful (k,d)-total colorings, harmonious (k,d)-total colorings, (k,d)-edge-magic total colorings, (k,d)-graceful-difference total colorings and (k,d)-felicitous-difference total colorings. One of useful tools we used is called Topcode-matrix with elements can be all sorts of things, for example, sets, graphs, number-based strings. Most of parameterized graphic colorings/labelings are defined by Topcode-matrix algebra here. From the application point of view, many of our coloring techniques are given by algorithms and easily converted into programs.
