Neural Key Agreement Protocol with Extended Security

Key agreement protocols based on neural synchronization using Tree Parity Machines (TPMs) have two main advantages: their security does not involve trapdoor problems, which may be solved on a quantum computer, and, unlike their quantum counterparts, they do not require special hardware, which is expensive and difficult to manage. In this paper, we present a new protocol for synchronizing two TPMs. Our network construction uses non-binary inputs with positive bounded weights. We analyzed all major known attacks on TPMs and experimentally proved that the percentage of the key recovered by the attacker drops exponentially in the system's parameters. At the same time, the number of rounds of the protocol increases only polynomially.