It was the problem of finding the minimum value of the sum of the distances of the path through all cities Overview TSP. We propose an authentication with the problem that the deformation sum of the distances of the path to be a constant value. In this document, it is intended to construct an authentication function robust implementation is easy and the Blog. After it was shown that the first, to determine the replacement group and path are the same, we propose the authentication method to consider the deformation of the traveling salesman problem in the directed graph, using a sequence of bytes. Instead of providing illumination mathematically rigorous, describes a verifiable algorithm.

翻译：摘要：旅行商问题（TSP）是一个寻找遍历所有城市路径距离之和最小值的经典问题。本文提出一种身份认证方法，该方法将路径距离的变形和作为常数约束。本研究旨在构建一种实现简便且鲁棒的认证函数（即博客）。首先证明置换群与路径的等价性后，我们提出一种身份认证方案，该方案利用字节序列在定向图中对旅行商问题的变形进行建模。本方法未提供严谨的数学证明，而是描述了一个可验证的算法实现。