论文标题
基于图形和图形晶格的特定总颜色的图形同态
Graph Homomorphisms Based On Particular Total Colorings of Graphs and Graphic Lattices
论文作者
论文摘要
基于晶格的密码学不仅用于挫败未来的量子计算机，也是完全同构加密的基础。从图形同态的优势中，我们将图形同态与图形总颜色结合在一起，以设计新型的图形同态类型的同构：完全色彩的图形同态同态，从集合到集合到集合到集合的每个零图形组的图形同构同构。我们的图形同态晶格由图同构构成。这些新的同态引起了图理论的一些问题，例如，数字字符串分解和图形同态问题。
Lattice-based cryptography is not only for thwarting future quantum computers, and is also the basis of Fully Homomorphic Encryption. Motivated from the advantage of graph homomorphisms we combine graph homomorphisms with graph total colorings together for designing new types of graph homomorphisms: totally-colored graph homomorphisms, graphic-lattice homomorphisms from sets to sets, every-zero graphic group homomorphisms from sets to sets. Our graph-homomorphism lattices are made up by graph homomorphisms. These new homomorphisms induce some problems of graph theory, for example, Number String Decomposition and Graph Homomorphism Problem.
