| dc.description.abstract |
Quantum Key Distribution (QKD) provides secure communication by leveraging quantum mechanics, with the BB84 protocol being one of its most widely adopted implementations. However, the classical post-processing steps in BB84, such as sifting, error correction, and key verification, often result in significant communication overhead, limiting its efficiency and scalability. In this work, we propose three key optimizations for BB84: (1) PRNG-based predetermined key bit positioning, which eliminates redundant bit exchanges during sifting, (2) hash-based subsequence comparison, enabling lightweight and efficient key verification, and (3) adaptive basis reconciliation, which minimizes the communication costs associated with basis matching. The proposed optimizations achieve a 50% reduction in communication overhead for large key sizes compared to traditional QKD protocols, as demonstrated through rigorous performance analysis. While the focus of this work is on the BB84 protocol, these optimizations are also directly applicable to a broader class of Discrete-Variable QKD (DV-QKD) protocols, such as six-state, B92, and E91, which share a fundamentally similar post-processing structure. This generality highlights the modularity and adaptability of the proposed methods across diverse QKD implementations. The proposed optimizations enhance post-processing efficiency and scalability, enabling practical deployment in bandwidth-limited environments like IoT networks, secure financial systems, and defense communications, thereby supporting broader adoption of quantum communication systems. |
en_US |