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

IEEE Congress on Evolutionary Computation (CEC)

A genetic algorithm to analyze the security of quantum cryptographic protocols

Walter O. Krawec

Published Jul 1, 2016• 12 citations
Publisher

Abstract

In this paper we show how a genetic algorithm may be used to analyze the security of quantum key distribution (QKD) protocols. In particular, we construct an algorithm to find the maximally tolerated noise level of a QKD protocol (the threshold after which users must abort). Extending on our previous work in this area, we describe in detail the algorithm and how it is constructed. We show how preprocessing may be considered by the algorithm to improve this tolerated bound. Finally, we evaluate it on multiple QKD protocols, comparing it to known bounds and also discovering new results. We also show how it can be used to analyze the security of complicated QKD protocols requiring the adversary to interact with the users. It may also be used to detect security flaws in protocols. Our algorithm can be a useful tool in QKD research and design.

DOI
10.1109/cec.2016.7744047

Related papers

Genetic algorithm to study practical quantum adversaries

Walter O. Krawec, Sam A. Markelon

In this paper we show how genetic algorithms can be effectively applied to study the security of arbitrary quantum key distribution (QKD) protocols when faced with adversaries limited to current-day technology. We compare two approaches, both of which take into account practical limitations on the quantum power of an adversary (which can be specified by the user). Our system can be used to determine upper-bounds on noise tolerances of novel QKD protocols in this scenario, thus making it a useful tool for researchers. We compare our algorithm's results with current known numerical results, and also evaluate it on newer, more complex, protocols where no results are currently known.

Genetic and Evolutionary Computation Conference (GECCO)•Jul 2, 2018•1 citation

A new framework tor analyzing surveillance of quantum cryptographic protocols using genetic algorithm

S. Yasmin, G. Murali

Genetic Algorithm (GA) may be used to analyses the security of Quantum Key Distribution (QKD) protocols. It evaluates on multiple QKD protocol such as, comparing it to known bounds and also discovering new results. It also shows how it can be used to analyze the security of complicated QKD protocols requiring the adversary to interact with the users. It may also be used to detect security flaws in protocols. This algorithm can be a useful tool in QKD research and design. The genetic algorithm can be used to analyses the security of the quantum cryptographic protocols. This paper handles the different types of attacks like photon loss and multi-photon attacks. Analysis can be done on these protocols namely BB84, B92, SARGO4, Semi-Quantum protocol, Mediated Semi-Quantum protocols. The attacks can be handled by using genetic algorithm is the main intention of this work.

International Conference on Energy, Communication, Data Analytics and Soft Computing (ICECDS)•Aug 1, 2017•0 citations

Optimizing Epsilon Security Parameters in QKD

Alexander G. Mountogiannakis, Stefano Pirandola

We investigate the optimization of epsilon-security parameters in quantum key distribution (QKD), aiming to improve the achievable secure key rate under a fixed overall composable security level. For this purpose, we employ a continuous genetic algorithm (CGA) to optimize the epsilon-security components of two representative protocols: the homodyne protocol from the continuous-variable (CV) family and the BB84 protocol from the discrete-variable (DV) family. We detail the CGA configuration, summarize the derivation of the composable key rate, and emphasize the role of the epsilon-parameters in both protocols. We then compare key rates obtained with optimized epsilon-values against those derived from standard and randomized choices. Our results demonstrate substantial key rate improvements at high security levels, where the key rate typically vanishes, and uncover positive-rate regimes that are inaccessible without optimization.

quant-pharXiv:2512.18130•Physica Scripta•Dec 23, 2025•0 citations

Automatic generation of optimal quantum key distribution protocols

Walter O. Krawec, Michael G. Nelson, Eric P. Geiss

Quantum Key Distribution (QKD) allows two parties to establish a shared secret key secure against an all-powerful adversary. Typically, one designs new QKD protocols and then analyzes their maximal tolerated noise mathematically. If the noise in the quantum channel connecting the two parties is higher than this threshold value, they must abort. In this paper we design and evaluate a new real-coded Genetic Algorithm which takes as input statistics on a particular quantum channel (found using standard channel estimation procedures) and outputs a QKD protocol optimized for the specific given channel. We show how this method can be used to find QKD protocols for channels where standard protocols would fail.

Genetic and Evolutionary Computation Conference (GECCO)•Jun 30, 2017•10 citations

Using evolutionary techniques to analyze the security of quantum key distribution protocols

Walter O. Krawec

In this paper, we describe a new real coded GA which may be used to analyze the security of quantum key distribution (QKD) protocols by estimating the maximally tolerated error rate - an important statistic and, for many newer more complicated protocols, still unknown. Our algorithm takes advantage of several nice features of QKD protocols to simplify the search process and was evaluated on several protocols and can even detect security flaws in a protocol thus showing our algorithm's usefulness in protocol design.

Genetic and Evolutionary Computation Conference Companion (GECCO Companion)•Jul 11, 2014•2 citations

Quantum Security Proof Based on Quantum Decoherence

Jincheng Zhang

This paper investigates the potential of utilizing quantum decoherence as a foundation for enhanced computational security. Traditional cryptographic algorithms are increasingly vulnerable to attacks leveraging quantum computing capabilities. This research proposes a novel approach to secure key distribution by exploiting the inherent properties of quantum decoherence. We design a quantum key distribution (QKD) protocol that incorporates controlled quantum noise and environmental interactions, specifically leveraging the rapid decoherence of quantum states. The protocol's core principle is that the unpredictable nature of decoherence – the loss of quantum information due to interaction with the environment – makes it extraordinarily difficult for an eavesdropper to predict and exploit the key distribution process. The resulting security stems not from the laws of physics themselves, but from the attacker's inability to reliably model and manipulate the quantum system's rapidly evolving state. We present a mathematical framework to analyze the security of this protocol, highlighting key parameters influencing its resilience. This work offers a fundamentally new security paradigm, shifting the focus from algorithm-based security to a system-level approach centered around harnessing the chaotic nature of quantum decoherence. The presented scheme demonstrates a promising path toward building robust, quantum-resistant cryptographic systems.

•Sep 2, 2026•0 citations
In this paper we show how a genetic algorithm may be used to analyze the security of quantum key distribution (QKD) protocols. In particular, we construct an algorithm to find the maximally tolerated noise level of a QKD protocol (the threshold after which users must abort). Extending on our previous work in this area, we describe in detail the algorithm and how it is constructed. We show how preprocessing may be considered by the algorithm to improve this tolerated bound. Finally, we evaluate it on multiple QKD protocols, comparing it to known bounds and also discovering new results. We also show how it can be used to analyze the security of complicated QKD protocols requiring the adversary to interact with the users. It may also be used to detect security flaws in protocols. Our algorithm can be a useful tool in QKD research and design.
In this paper we show how genetic algorithms can be effectively applied to study the security of arbitrary quantum key distribution (QKD) protocols when faced with adversaries limited to current-day technology. We compare two approaches, both of which take into account practical limitations on the quantum power of an adversary (which can be specified by the user). Our system can be used to determine upper-bounds on noise tolerances of novel QKD protocols in this scenario, thus making it a useful tool for researchers. We compare our algorithm's results with current known numerical results, and also evaluate it on newer, more complex, protocols where no results are currently known.
Genetic Algorithm (GA) may be used to analyses the security of Quantum Key Distribution (QKD) protocols. It evaluates on multiple QKD protocol such as, comparing it to known bounds and also discovering new results. It also shows how it can be used to analyze the security of complicated QKD protocols requiring the adversary to interact with the users. It may also be used to detect security flaws in protocols. This algorithm can be a useful tool in QKD research and design. The genetic algorithm can be used to analyses the security of the quantum cryptographic protocols. This paper handles the different types of attacks like photon loss and multi-photon attacks. Analysis can be done on these protocols namely BB84, B92, SARGO4, Semi-Quantum protocol, Mediated Semi-Quantum protocols. The attacks can be handled by using genetic algorithm is the main intention of this work.
We investigate the optimization of epsilon-security parameters in quantum key distribution (QKD), aiming to improve the achievable secure key rate under a fixed overall composable security level. For this purpose, we employ a continuous genetic algorithm (CGA) to optimize the epsilon-security components of two representative protocols: the homodyne protocol from the continuous-variable (CV) family and the BB84 protocol from the discrete-variable (DV) family. We detail the CGA configuration, summarize the derivation of the composable key rate, and emphasize the role of the epsilon-parameters in both protocols. We then compare key rates obtained with optimized epsilon-values against those derived from standard and randomized choices. Our results demonstrate substantial key rate improvements at high security levels, where the key rate typically vanishes, and uncover positive-rate regimes that are inaccessible without optimization.
Quantum Key Distribution (QKD) allows two parties to establish a shared secret key secure against an all-powerful adversary. Typically, one designs new QKD protocols and then analyzes their maximal tolerated noise mathematically. If the noise in the quantum channel connecting the two parties is higher than this threshold value, they must abort. In this paper we design and evaluate a new real-coded Genetic Algorithm which takes as input statistics on a particular quantum channel (found using standard channel estimation procedures) and outputs a QKD protocol optimized for the specific given channel. We show how this method can be used to find QKD protocols for channels where standard protocols would fail.
In this paper, we describe a new real coded GA which may be used to analyze the security of quantum key distribution (QKD) protocols by estimating the maximally tolerated error rate - an important statistic and, for many newer more complicated protocols, still unknown. Our algorithm takes advantage of several nice features of QKD protocols to simplify the search process and was evaluated on several protocols and can even detect security flaws in a protocol thus showing our algorithm's usefulness in protocol design.
This paper investigates the potential of utilizing quantum decoherence as a foundation for enhanced computational security. Traditional cryptographic algorithms are increasingly vulnerable to attacks leveraging quantum computing capabilities. This research proposes a novel approach to secure key distribution by exploiting the inherent properties of quantum decoherence. We design a quantum key distribution (QKD) protocol that incorporates controlled quantum noise and environmental interactions, specifically leveraging the rapid decoherence of quantum states. The protocol's core principle is that the unpredictable nature of decoherence – the loss of quantum information due to interaction with the environment – makes it extraordinarily difficult for an eavesdropper to predict and exploit the key distribution process. The resulting security stems not from the laws of physics themselves, but from the attacker's inability to reliably model and manipulate the quantum system's rapidly evolving state. We present a mathematical framework to analyze the security of this protocol, highlighting key parameters influencing its resilience. This work offers a fundamentally new security paradigm, shifting the focus from algorithm-based security to a system-level approach centered around harnessing the chaotic nature of quantum decoherence. The presented scheme demonstrates a promising path toward building robust, quantum-resistant cryptographic systems.