arXiv:2512.13199

Investigation of a Bit-Sequence Reconciliation Protocol Based on Neural TPM Networks in Secure Quantum Communications

Matvey Yorkhov, Vladimir Faerman, Anton Konev

quant-phcs.CRSubmitted Dec 15, 2025• Announced Dec 16, 2025• 0 citations

Abstract

The article discusses a key reconciliation protocol for quantum key distribution (QKD) systems based on Tree Parity Machines (TPM). The idea of transforming key material into neural network weights is presented. Two experiments were conducted to study how the number of synchronization iterations and the amount of leaked information depend on the quantum bit error rate (QBER) and the range of neural network weights. The results show a direct relationship between the average number of synchronization iterations and QBER, an increase in iterations when the weight range is expanded, and a reduction in leaked information as the weight range increases. Based on these results, conclusions are drawn regarding the applicability of the protocol and the prospects for further research on neural cryptographic methods in the context of key reconciliation.

Comments: 4 pages; 6 figures; reported on 21st International Scientific and Practical Conference 'Electronic Means and Control Systems', dedicated to the 80th anniversary of radio engineering education beyond the Urals, November 23, Tomsk

Related papers

A New Error Correction Technique in Quantum Cryptography using Artificial Neural Networks

Gobinda Chandra Das, Malay Kule

Information Security is of paramount importance in digital communication in today’s highly networked world. Conventional information security methods face many future threats, one being the likelihood of large scale Quantum Computation. Quantum Cryptography is coming to the fore in the field of information security. It is all about using quantum physics to perform the cryptographic tasks as well as to break cryptographic systems. There are recent many advancements in the quantum cryptography field like Quantum Coin Flipping, Quantum Bit Commitment, and Quantum Key Distribution (QKD) networks. In this paper, a new concept for error correction and key reconciliation method is presented that uses Artificial Neural Network (ANN) with the help of Tree Parity Machine (TPM). In our work, we have considered a few cases of TPMs synchronization process with specific values of Quantum Bit Error Rate(QBER) and have performed some comparison among those. The experimental results observed into this paper that prove the correctness of the proposed work.

IEEE India ConferenceNov 24, 20225 citations

Error correction in quantum cryptography based on artificial neural networks

Marcin Niemiec

Intensive work on quantum computing has increased interest in quantum cryptography in recent years. Although this technique is characterized by a very high level of security, there are still challenges that limit the widespread use of quantum key distribution. One of the most important problems remains secure and effective mechanisms for the key distillation process. This article presents a new idea for a key reconciliation method in quantum cryptography. This proposal assumes the use of mutual synchronization of artificial neural networks to correct errors occurring during transmission in the quantum channel. Users can build neural networks based on their own string of bits. The typical value of the quantum bit error rate does not exceed a few percent; therefore, the strings are similar and also users’ neural networks are very similar at the beginning of the learning process. It has been shown that the synchronization process in the new solution is much faster than in the analogous scenario used in neural cryptography. This feature significantly increases the level of security because a potential eavesdropper cannot effectively synchronize their own artificial neural networks in order to obtain information about the key. Therefore, the key reconciliation based on the new idea can be a secure and efficient solution.

arXiv:1810.00957Quantum Information ProcessingApr 25, 201964 citations

An Intelligent and Optimized Reconciliation Technique for Enhanced Secret Key Rates in Quantum Key Distribution

M. N. Upama Rajan, Reema Mathew A, Shamya A. +3 more

Quantum key distribution (QKD) is a secure communication technique that uses quantum mechanical principles. This method enables two trusted users to exchange a secret key or message securely by exploiting the fundamental properties of quantum mechanics. Strong long-distance secure communication is provided by QKD but its effectiveness is mainly limited by quantum bit error rate (QBER), finite-key effects, and the effectiveness of classical error-correction during information reconciliation. In this work, we proposes a neural-aided adaptive reconciliation (NAAR) framework based on artificial neural networks for QKD that integrates a lightweight neural belief propagation decoder with QBER-driven adaptive LDPC coderate selection. By lowering frame-error rate and information leakage, neural-assisted log-likelihood ratio calibration enhances belief-propagation convergence for binary symmetric channels. The result shows an improvement in secret key rates (SKR) and lower error rates over traditional LDPC-based reconciliation.

IEEE International Conference on Quantum Photonics, Artificial Intelligence & Networking (QPAIN)Apr 16, 20260 citations

Covert Communications-Based Information Reconciliation for Quantum Key Distribution Protocols

John Gariano, Ivan B. Djordjević

The rate at which a secure key can be generated in a quantum key distribution (QKD) protocol is limited by the channel loss and the quantum bit-error rate (QBER). Increases to the QBER can stem from detector noise, channel noise, or the presence of an eavesdropper, Eve. Eve is capable of obtaining information of the unsecure key by performing an attack on the quantum channel or by listening to all discussion performed via a noiseless public channel. Conventionally a QKD protocol will perform the information reconciliation over the authenticated public channel, revealing the parity bits used to correct for any quantum bit errors. In this invited paper, the possibility of limiting the information revealed to Eve during the information reconciliation is considered. Using a covert communication channel for the transmission of the parity bits, secure key rates are possible at much higher QBERs. This is demonstrated through the simulation of a polarization based QKD system implementing the BB84 protocol, showing significant improvement of the SKRs over the conventional QKD protocols.

International Conference on Transparent Optical NetworksJul 1, 20192 citations

A Modified Key Sifting Scheme With Artificial Neural Network Based Key Reconciliation Analysis in Quantum Cryptography

Chitra Biswas, Md. Mokammel Haque, Udayan Das Gupta

Quantum Cryptography emerged from the limitations of classical cryptography. It will play a vital role in information security after the availability of expected powerful quantum computers. Still many quantum primitives like quantum money, blind quantum computation, quantum copy protection, etc. are theoretical as they require a completely functional quantum computer for their implementation. But one prominent quantum cryptographic primitive, the Quantum Key Distribution (QKD) is possible with current technology. The QKD is a key establishment system having several stages namely raw key generation, key sifting, key reconciliation, and privacy amplification. In this paper, an efficient key sifting scheme has been developed. Successful simulation has shown that the proposed modified key sifting scheme requires less time to build the sifted key compared to the sifted key in conventional BB84 protocol in most cases. This paper also represents Tree Parity Machine (TPM) based key reconciliation analysis using different learning algorithms such as Hebbian, Anti-Hebbian, and Random-Walk. This reconciliation analysis helps to choose the optimum learning algorithm for Artificial Neural Network (ANN) based key reconciliation in future Quantum Key Distribution systems.

IEEE AccessJan 1, 202222 citations

Neural Key Agreement Protocol with Extended Security

Mihail-Iulian Pleṣa, Marian Gheorghe, Florentin Ipate

Key agreement protocols based on neural synchronization with Tree Parity Machines (TPMs) offer promising security advantages: they do not rely on trapdoor functions, making them resistant to quantum attacks, and they avoid the need for specialized hardware required by quantum-based schemes. Nevertheless, these protocols face a significant vulnerability: the large number of public message exchanges required for synchronization increases the risk that an attacker, acting as a Man-in-the-Middle, can successfully synchronize their own TPMs with those of the legitimate parties and ultimately recover the shared key. Motivated by the need to reduce this risk, we propose a novel probabilistic protocol that enables two parties to securely estimate the size of the shared key during intermediate steps, without revealing any key material. This estimation allows the protocol to terminate as soon as sufficient key material has been established, thereby reducing the number of synchronization rounds and limiting the opportunity for an attacker to synchronize. We integrate our estimation mechanism into a neural key agreement protocol and evaluate its performance and security, demonstrating improved efficiency and enhanced resistance to attacks compared to existing approaches.

Applied SciencesDec 2, 20251 citation