树奇偶校验机的权重均衡算法
Weight Equalization Algorithm for Tree Parity Machines
AI总结：
针对树奇偶校验机在密钥协商后受保护密钥值分布不均的问题，提出一种新颖的权重均衡算法，显著提升了所获密钥的质量。
摘要：
密钥协商在确保公共网络安全通信中起着至关重要的作用。尽管多年前开发的算法仍在使用，但量子计算的出现促使人们寻找新的解决方案。树奇偶校验机被提出作为一种潜在的解决方案。然而，它们具有固有的缺点，其中之一是在密钥协商过程后获得的受保护密钥中的值分布不均，特别是在同步过程中使用非二进制向量时。本文引入了一种旨在解决此问题的新颖算法。结果表明，所获得的受保护密钥的质量得到了显著提升。
英文摘要：
Key agreement plays a crucial role in ensuring secure communication in public networks. Although algorithms developed many years ago are still being used, the emergence of quantum computing has prompted the search for new solutions. Tree parity machines have been put forward as a potential solution. However, they possess inherent shortcomings, one of which is the uneven distribution of values in the secured key obtained after the key agreement process, especially when on-binary vectors are used during the synchronization process. This paper introduces a novel algorithm designed to address this issue. The results demonstrate a substantial enhancement in the quality of the secured key obtained.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
