Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2406.00802 · Computer Networks

Weight equalization algorithm for tree parity machines

Miłosz Stypiński, Marcin Niemiec

Published Dec 16, 2024• 5 citations
arXivHTMLPDF

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 non-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.

DOI
10.1016/j.comnet.2024.110988

Related papers

Enhancing Security of Error Correction in Quantum Key Distribution Using Tree Parity Machine Update Rule Randomization

Bartłomiej Gdowski, Miralem Mehić, Marcin Niemiec

This paper presents a novel approach to enhancing the security of error correction in quantum key distribution by introducing randomization into the update rule of Tree Parity Machines. Two dynamic update algorithms—dynamic_rows and dynamic_matrix—are proposed and tested. These algorithms select the update rule quasi-randomly based on the input vector, reducing the effectiveness of synchronization-based attacks. A series of simulations were conducted to evaluate the security implications under various configurations, including different values of K, N, and L parameters of neural networks. The results demonstrate that the proposed dynamic algorithms can significantly reduce the attacker’s synchronization success rate without requiring additional communication overhead. Both proposed solutions outperformed hebbian, an update rule-based synchronization method utilizing the percentage of attackers synchronization. It has also been shown that when the attacker chooses their update rule randomly, the dynamic approaches work better compared to random walk rule-based synchronization, and that in most cases it is more profitable to use dynamic update rules when an attacker is using random walk. This study contributes to improving QKD’s robustness by introducing adaptive neural-based error correction mechanisms.

Applied Sciences•Jul 17, 2025•4 citations

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 Conference•Nov 24, 2022•5 citations

Enhancing the Security of Public Key Cryptography in Addressing Quantum Computing Threats

Oluwole Oguntoyinbo, Abel Yeboah-Ofori, Chukwuebuka Francis Ikenga-Metuh +3 more

The potential of quantum computing to compromise traditional public-key cryptography (PKC) has led to a pressing need for more efficient and resilient cryptographic methods. Recent advancements, such as the 800x improvement in the logical error rate by Microsoft and QUANTINUUM, underscore the urgency of this issue. Post-quantum cryptography (PQC) offers a promising solution designed to withstand quantum attacks. This paper examines how PQC and other advanced cryptographic techniques can enhance the security and efficiency of PKC in the quantum era. Current PKC methods, despite revolutionizing secure online communication, are vulnerable to flaws in their underlying algorithms. The proposed hybrid model integrates PQC with traditional PKC, leveraging both technologies' strengths to mitigate quantum threats while preserving established security benefits. The investigation addresses critical research questions: how to enhance PKC key management for better efficiency and security, and which PQC techniques can protect PKC from quantum attacks. This paper's contribution includes identifying vulnerabilities in existing PKC, comparing RSA and post-quantum algorithms, and implementing a PQC algorithm between a client and server to analyze integration with existing protocols. Finally, the paper recommends security mechanisms to improve PQC protocols, ensuring robust protection against emerging quantum computing capabilities.

International Conference on Electrical and Computer Engineering Researches (ICECER)•Dec 4, 2024•0 citations

Joint Parameter Scaling for Enhanced Security in Tree Parity Machine–Based QKD Reconciliation

Saulė Janavičiūtė, Marcin Niemiec, Dominykas Razmadze +3 more

Mutual synchronization of tree parity machines has been proposed as an efficient alternative to key reconciliation in quantum key distribution. However, use of non-binary input vectors, while improving synchronization speed, introduces extrema-value effect, leading to weight clustering at boundary values and reduced key entropy. This paper evaluates joint scaling of synaptic depth L and input range M in tree parity machines with non-binary inputs using Monte Carlo simulations. Performance is assessed in terms of synchronization steps, attacker weight overlap, attacker success probability, boundary weight distribution. The results show that jointly increasing L and M can mitigate the extrema-value effect, reducing the boundary weight percentage by up to 39.3%, and attacker overlap by up to 75%, albeit at the cost of an increased number of synchronization steps. By selecting, for each M group, the L-M configuration with minimum attacker overlap, the study identifies parameter sets that achieve stronger security than the baseline, and example operating points that preserve near-baseline synchronization speed while reducing attacker overlap. These findings indicate that joint tuning of L and M parameters can decrease the extrema-value effect and enhance robustness of tree parity machine-based QKD reconciliation with non-binary inputs, while allowing fast synchronization for suitable parameter choices.

IEEE Symposium on Computers and Communications (ISCC)•Jun 1, 2026•0 citations

A novel secure quantum key distribution algorithm

Abdulrahman Aldhaheri, Khaled M. Elleithy, Majid Alshammari +1 more

Key distribution is the function that delivers a key to two parties who wish to communicate with each other in secure manner. Therefore, key distribution must be secure enough to thwart any attempts to compromise the system. In this paper we introduce a secure key distribution system based on quantum theory. The proposed algorithm provides a secure way to distribute, or exchange the key that recognizes any comprise of the quantum communication channel.

IEEE Long Island Systems, Applications and Technology Conference (LISAT)•May 1, 2014•3 citations

The Goals of Parity Bits in Quantum Key Distribution System

Omer Abd Alkareem Jasim, Anas Ayad Abdulrazzaq

The basic foundation behind cryptography as a discipline was to research how valuable data, information can be protected from unauthorized parties, such as adversaries. Quantum cryptography is one of the recent advancement occurred within that discipline. However, this cryptographic algorithm still at its early stages, where there is no wide implementation can be seen. Many research papers have been done to develop this algorithm, while others, to propose new implementations of this algorithm to tackle a specific problem. This research paper studies and examines the relationship between the QKDS (Quantum Key Distribution System) and the parity bits. Hence, explore how the use of parity bits can improve the final resolved key.

International Journal of Computer Applications•Oct 22, 2012•9 citations
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 non-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.
This paper presents a novel approach to enhancing the security of error correction in quantum key distribution by introducing randomization into the update rule of Tree Parity Machines. Two dynamic update algorithms—dynamic_rows and dynamic_matrix—are proposed and tested. These algorithms select the update rule quasi-randomly based on the input vector, reducing the effectiveness of synchronization-based attacks. A series of simulations were conducted to evaluate the security implications under various configurations, including different values of K, N, and L parameters of neural networks. The results demonstrate that the proposed dynamic algorithms can significantly reduce the attacker’s synchronization success rate without requiring additional communication overhead. Both proposed solutions outperformed hebbian, an update rule-based synchronization method utilizing the percentage of attackers synchronization. It has also been shown that when the attacker chooses their update rule randomly, the dynamic approaches work better compared to random walk rule-based synchronization, and that in most cases it is more profitable to use dynamic update rules when an attacker is using random walk. This study contributes to improving QKD’s robustness by introducing adaptive neural-based error correction mechanisms.
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.
The potential of quantum computing to compromise traditional public-key cryptography (PKC) has led to a pressing need for more efficient and resilient cryptographic methods. Recent advancements, such as the 800x improvement in the logical error rate by Microsoft and QUANTINUUM, underscore the urgency of this issue. Post-quantum cryptography (PQC) offers a promising solution designed to withstand quantum attacks. This paper examines how PQC and other advanced cryptographic techniques can enhance the security and efficiency of PKC in the quantum era. Current PKC methods, despite revolutionizing secure online communication, are vulnerable to flaws in their underlying algorithms. The proposed hybrid model integrates PQC with traditional PKC, leveraging both technologies' strengths to mitigate quantum threats while preserving established security benefits. The investigation addresses critical research questions: how to enhance PKC key management for better efficiency and security, and which PQC techniques can protect PKC from quantum attacks. This paper's contribution includes identifying vulnerabilities in existing PKC, comparing RSA and post-quantum algorithms, and implementing a PQC algorithm between a client and server to analyze integration with existing protocols. Finally, the paper recommends security mechanisms to improve PQC protocols, ensuring robust protection against emerging quantum computing capabilities.
Mutual synchronization of tree parity machines has been proposed as an efficient alternative to key reconciliation in quantum key distribution. However, use of non-binary input vectors, while improving synchronization speed, introduces extrema-value effect, leading to weight clustering at boundary values and reduced key entropy. This paper evaluates joint scaling of synaptic depth L and input range M in tree parity machines with non-binary inputs using Monte Carlo simulations. Performance is assessed in terms of synchronization steps, attacker weight overlap, attacker success probability, boundary weight distribution. The results show that jointly increasing L and M can mitigate the extrema-value effect, reducing the boundary weight percentage by up to 39.3%, and attacker overlap by up to 75%, albeit at the cost of an increased number of synchronization steps. By selecting, for each M group, the L-M configuration with minimum attacker overlap, the study identifies parameter sets that achieve stronger security than the baseline, and example operating points that preserve near-baseline synchronization speed while reducing attacker overlap. These findings indicate that joint tuning of L and M parameters can decrease the extrema-value effect and enhance robustness of tree parity machine-based QKD reconciliation with non-binary inputs, while allowing fast synchronization for suitable parameter choices.
The basic foundation behind cryptography as a discipline was to research how valuable data, information can be protected from unauthorized parties, such as adversaries. Quantum cryptography is one of the recent advancement occurred within that discipline. However, this cryptographic algorithm still at its early stages, where there is no wide implementation can be seen. Many research papers have been done to develop this algorithm, while others, to propose new implementations of this algorithm to tackle a specific problem. This research paper studies and examines the relationship between the QKDS (Quantum Key Distribution System) and the parity bits. Hence, explore how the use of parity bits can improve the final resolved key.