Quantum key distribution optimization: reducing communication overhead in post-processing steps

Abstract

Quantum Key Distribution (QKD) is a ground-breaking method in modern cryptography that uses quantum mechanics to establish secure communication channels. Unlike classical cryptographic techniques, QKD provides unconditional security based on quantum principles, such as the no-cloning theorem and the uncertainty principle. However, existing QKD systems often suffer from high overhead in key post-processing, affecting efficiency and scalability, especially in resource-constrained environments such as IoT. This paper addresses these challenges by introducing two key optimizations to enhance the efficiency and security of QKD systems. First, we propose a method using Pseudorandom Number Generators (PRNGs) to determine key bit positions for verification by Alice and Bob, significantly reducing communication over-head. Second, we employ hash-based subsequence comparison to minimize data exchange and leverage the cryptographic strength of hash functions. Results demonstrate that these strategies effectively reduce key post-processing overhead and improve the efficiency of QKD systems in real-world conditions making QKD more practical and scalable for diverse application contexts.