Routing algorithm within the multiple non-overlapping paths approach for quantum key distribution networks

TL;DR

This paper introduces a new routing algorithm for quantum key distribution networks that uses multiple non-overlapping paths to enhance security and workload balance, tested on networks with 6 and 10 nodes.

Contribution

A novel key routing algorithm for QKD networks that improves security and load balancing by utilizing multiple non-overlapping paths for remote node communication.

Findings

Successfully distributed secure keys in all-to-all network configurations.

Maintained information-theoretic security even if a trusted node is compromised.

Demonstrated improved network performance through testing on 6 and 10 node models.

Abstract

We develop a novel key routing algorithm for quantum key distribution (QKD) networks that utilizes a distribution of keys between remote, i.e., not directly connected by a QKD link, nodes through multiple non-overlapping paths. This approach enchases the security of QKD network by minimizing potential vulnerabilities associated with individual trusted nodes. The algorithm ensures a balanced allocation of the workload across the QKD network links, while aiming for the target key generation rate between directly connected and remote nodes. We present the results of testing the algorithm on two QKD network models consisting of 6 and 10 nodes. The testing demonstrates the ability of the algorithm to distribute secure keys among the nodes of the network in an all-to-all manner, ensuring that the information-theoretic security of the keys between remote nodes is maintained even when one of the trusted nodes is compromised. These results highlight the potential of the algorithm to improve the performance of QKD networks.