AI 中文总结
研究匹配密码系统稳定性，提出基于公钥图特定边集对应权重向量跨度维度的稳定性必要条件，还描述了对该密码系统的攻击及有限噪声防御。
AI 中文摘要
本文描述了对匹配密码系统的一种可能攻击以及有限噪声防御。匹配密码系统的公钥由一个图和图边的权重向量函数组成，私钥包含另一个权重函数，相应的交替加权路径问题可在多项式时间内求解。本文考虑了特定的秘密权重函数族，其向量值的一些坐标被描述为有限噪声。我们根据与公钥中图特定边集对应的权重向量跨度的维度，提出了匹配密码系统稳定性的必要条件。
英文摘要
The article contains a description of a possible attack on a matching cryptosystem and a defense with limited noise. A public key of a matching cryposystem consists of a graph and a weight vector-function on the edges of the graph with values from a finite field, where a private key contains another weight function, for which the corresponding alternating weighted path problem can be solved in polynomial time. There is a specific family of these secret weight functions that is considered in this article, for which some of the coordinates of its vector values are described as limited noise. We suggest a necessary condition for the matching cryptosystem stability in terms of dimensions of spans of weight vectors that correspond to specific sets of edges of the graph from the public key.
