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

Genetic and Evolutionary Computation Conference (GECCO)

Automatic generation of optimal quantum key distribution protocols

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

Published Jun 30, 2017• 10 citations
Publisher

Abstract

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.

DOI
10.1145/3071178.3071182

Related papers

A genetic algorithm to analyze the security of quantum cryptographic protocols

Walter O. Krawec

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.

IEEE Congress on Evolutionary Computation (CEC)•Jul 1, 2016•12 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

Discovery of robust protocols for secure quantum cryptography

Walter O. Krawec, Sam A. Markelon

Quantum Key Distribution (QKD) allows for two parties to establish a shared secret key which is secure against an all-powerful adversary (a task impossible to achieve using only classical communication). Furthermore, any attack against these systems creates an observable "noise signature." This work develops a new solution representation for QKD protocols allowing a GA to evolve optimal protocols to counter observed attacks against the communication.

Genetic and Evolutionary Computation Conference Companion (GECCO Companion)•Jul 10, 2019•1 citation

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

Distributed Quantum Key Distribution Protocols: Resilience Optimization

Jincheng Zhang

This paper investigates the optimization of distributed quantum key distribution (QKD) protocols with a focus on resilience enhancement. The core claim centers around improving both the security and efficiency of key distribution by strategically incorporating redundancy and error correction mechanisms. The proposed approach leverages the unique characteristics of quantum communication protocols, specifically utilizing redundant quantum channels and advanced error-correcting codes to achieve robust key exchange. The method addresses the limitations of existing QKD protocols in the face of channel noise and potential eavesdropping attacks. Mathematical models are presented to illustrate the key concepts and design choices. The optimization strategy is designed to maximize key rates while simultaneously mitigating the impact of channel imperfections, ultimately leading to more secure and reliable quantum key distribution systems. This work provides a theoretical framework for resilient QKD, offering a foundation for future implementations and further research in this critical field.

•Sep 6, 2026•0 citations

An Efficient Algorithm on Quantum Computing With Quantum Key Distribution for Secure Communication

Ganapathy Senthil Murugan

Currently many symmetric key cryptographic tools which are known to be quantum-safe. They all share Secret symmetric keys through an untrusted medium which is usually done with public key methods which are prone to quantum attacks. One among the recommended solutions to the key distribution problem is Quantum Key Distribution (QKD). QKD utilizes an authenticated Communication channel along with a quantum communication channel so that a secret key is generated. Whatever may be the protocol to implement proposed QKD, they all need both a quantum channel, and an authenticated classical. OTP (One Time Pad) is used when two parties wish to communications have to share a key called pad. This pad is a randomly generated key and the length of the key should be equal to the message so it can be sent. The proposed QKD parameters that result in almost 35.67% smaller keys for quantum security and an implementation of QKD in network which is publicly available and usable in practice.

International journal of communication•May 14, 2020•2 citations
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 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 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.
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.
This paper investigates the optimization of distributed quantum key distribution (QKD) protocols with a focus on resilience enhancement. The core claim centers around improving both the security and efficiency of key distribution by strategically incorporating redundancy and error correction mechanisms. The proposed approach leverages the unique characteristics of quantum communication protocols, specifically utilizing redundant quantum channels and advanced error-correcting codes to achieve robust key exchange. The method addresses the limitations of existing QKD protocols in the face of channel noise and potential eavesdropping attacks. Mathematical models are presented to illustrate the key concepts and design choices. The optimization strategy is designed to maximize key rates while simultaneously mitigating the impact of channel imperfections, ultimately leading to more secure and reliable quantum key distribution systems. This work provides a theoretical framework for resilient QKD, offering a foundation for future implementations and further research in this critical field.
Currently many symmetric key cryptographic tools which are known to be quantum-safe. They all share Secret symmetric keys through an untrusted medium which is usually done with public key methods which are prone to quantum attacks. One among the recommended solutions to the key distribution problem is Quantum Key Distribution (QKD). QKD utilizes an authenticated Communication channel along with a quantum communication channel so that a secret key is generated. Whatever may be the protocol to implement proposed QKD, they all need both a quantum channel, and an authenticated classical. OTP (One Time Pad) is used when two parties wish to communications have to share a key called pad. This pad is a randomly generated key and the length of the key should be equal to the message so it can be sent. The proposed QKD parameters that result in almost 35.67% smaller keys for quantum security and an implementation of QKD in network which is publicly available and usable in practice.