TY - JOUR
T1 - The Throughput Bottleneck of Quantum-secure Communication Links
T2 - Analysis and Mitigation
AU - Guerra-Yánez, Carlos
AU - Mederos-Barrera, Antonio
AU - De Marco, Innocenzo
AU - Orsucci, Davide
AU - Moll, Florian
AU - Ghassemlooy, Zabih
AU - Zvánovec, Stanislav
PY - 2024/4/29
Y1 - 2024/4/29
N2 - The use of quantum key distribution (QKD) to improve security may impact the quality of service (Qos) of high rate classical data links. The key generation process with an empty buffer can be modeled as a queuing system, and data throughput limits can be determined using queueing theory to assess the impact on the QoS. The proposed key generation model is based on an on-demand paradigm. Based on the results of this study, a discrete variable (DV)-QKD-secured link could be designed using the data rate bounds to guarantee a given QoS. Furthermore, we validate the derived bounds by comparing the theoretical derivations with simulations. We show that in a one-time-pad system, the achievable throughput approaches 0.59 times the secret key rate as the key length increases. In the case of a key scheme with key reuse, the throughput is asymptotically linear with the number of key reuses, and the slope of the curve corresponds to the secret key rate multiplied by a function of the protocol and channel characteristics. The analysis is carried out on optical fiber and free-space links.
AB - The use of quantum key distribution (QKD) to improve security may impact the quality of service (Qos) of high rate classical data links. The key generation process with an empty buffer can be modeled as a queuing system, and data throughput limits can be determined using queueing theory to assess the impact on the QoS. The proposed key generation model is based on an on-demand paradigm. Based on the results of this study, a discrete variable (DV)-QKD-secured link could be designed using the data rate bounds to guarantee a given QoS. Furthermore, we validate the derived bounds by comparing the theoretical derivations with simulations. We show that in a one-time-pad system, the achievable throughput approaches 0.59 times the secret key rate as the key length increases. In the case of a key scheme with key reuse, the throughput is asymptotically linear with the number of key reuses, and the slope of the curve corresponds to the secret key rate multiplied by a function of the protocol and channel characteristics. The analysis is carried out on optical fiber and free-space links.
KW - Ciphers
KW - Encryption
KW - Modeling
KW - Optical communication
KW - Protocols
KW - Quality of service
KW - Quantum computing
KW - Quantum theory
KW - Queueing analysis
KW - Stochastic processes
KW - Throughput
UR - http://www.scopus.com/inward/record.url?scp=85192148892&partnerID=8YFLogxK
U2 - 10.1109/tcomm.2024.3394746
DO - 10.1109/tcomm.2024.3394746
M3 - Article
SN - 0090-6778
SP - 1
EP - 32
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
ER -