Routing Algorithm for Quantum Key Distribution Networks
Author Information
Author(s): Kiktenko Evgeniy O., Tayduganov Andrey, Fedorov Aleksey K.
Primary Institution: National University of Science and Technology “MISIS”, Moscow, Russia
Hypothesis
Can a novel key routing algorithm improve the security and efficiency of quantum key distribution networks?
Conclusion
The proposed algorithm effectively distributes secure keys among nodes in a quantum key distribution network while maintaining security even if some trusted nodes are compromised.
Supporting Evidence
- The algorithm ensures a balanced allocation of workload across QKD network links.
- It maintains the information-theoretic security of keys even when some trusted nodes are compromised.
- The testing demonstrated the algorithm's ability to distribute secure keys in an all-to-all manner.
Takeaway
This study created a new way to share secret keys between computers using special paths, making it safer even if some computers are not trustworthy.
Methodology
The study developed and tested a key routing algorithm on two quantum key distribution network models with 6 and 10 nodes.
Limitations
The algorithm's effectiveness depends on the network topology, which may not always allow for M non-overlapping paths between all node pairs.
Digital Object Identifier (DOI)
Want to read the original?
Access the complete publication on the publisher's website