Weight Equalization Algorithm for Tree Parity Machines

TL;DR

This paper introduces a novel weight equalization algorithm for Tree Parity Machines to improve the uniformity of the secured key distribution in key agreement protocols, addressing inherent shortcomings.

Contribution

The paper presents a new algorithm that enhances key quality in Tree Parity Machines, addressing uneven value distribution issues during synchronization.

Findings

Significant improvement in key uniformity

Enhanced security of key agreement process

Potential resilience against quantum computing threats

Abstract

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.