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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.