Quantum key distribution (QKD) is a network security technology that generates encryption keys in real time and randomly during information transmission. This research implements a QKD network based on a software-defined network (SDN) by taking advantage of its advantages, such as saving resources to search for alternative routes and monitoring links to determine whether the conditions in each router network meet the needs or not. Path selection is made using metrics, such as the hop count metric using the routing information protocol (RIP) and the cost using open shortest path first (OSPF). Based on the results of routing performance testing on the QKD network based on SDN, tested ten times to get an average value, OSPF routing is faster at finding alternative routes than RIP routing. The test results for RIP routing throughput of 9.22 ms, delay of 0.76 ms, packet loss of 0.0044%, and convergence time of 10.64 ms. The results for OSPF routing throughput of 9.32 ms, delay of 0.75 ms, packet loss of 0.0039%, and convergence time of 10.51 ms.
Quantum key distribution (QKD) is a network security technology that generates encryption keys in real time and randomly during information transmission. This research implements a QKD network based on a software-defined network (SDN) by taking advantage of its advantages, such as saving resources to search for alternative routes and monitoring links to determine whether the conditions in each router network meet the needs or not. Path selection is made using metrics, such as the hop count metric using the routing information protocol (RIP) and the cost using open shortest path first (OSPF). Based on the results of routing performance testing on the QKD network based on SDN, tested ten times to get an average value, OSPF routing is faster at finding alternative routes than RIP routing. The test results for RIP routing throughput of 9.22 ms, delay of 0.76 ms, packet loss of 0.0044%, and convergence time of 10.64 ms. The results for OSPF routing throughput of 9.32 ms, delay of 0.75 ms, packet loss of 0.0039%, and convergence time of 10.51 ms.
Quantum Key Distribution (QKD) takes a short time to process encryption and authentication messages as an advanced security key distribution. Open Shortest Path First (OSPF) routing used on existing QKD networks uses more security keys. Software-Defined Networking (SDN) exists to control the core network, make routes easier to find and reduce the use of security keys. One of the benefits of SDN is that the controller can customize the routing scheme and save the use of secure keys. Based on the topology and scenarios, the link state protocol test results show that using keys increased the number of hops traversed by five to fourteen keys. We can see the five keys constant when testing the distance vector protocol. The average test time difference between the two protocols is about 3.438 seconds for the link state protocol and 2.687 seconds for the distance vector algorithm.
With the development of the Internet, information security has attracted great attention in today’s society, and quantum cryptography communication network based on quantum key distribution (QKD) is a very important part of this field, since the quantum key distribution combined with one-time-pad encryption scheme can guarantee the unconditional security of the information. The secret key generated by quantum key distribution protocols is a very valuable resource, so making full use of key resources is particularly important. Software definition network (SDN) is a new type of network architecture, and it separates the control plane and the data plane of network devices through OpenFlow technology, thus it realizes the flexible control of the network resources. In this paper, a quantum cryptography communication network model based on SDN is proposed to realize the flexible control of quantum key resources in the whole cryptography communication network. Moreover, we propose a routing algorithm which takes into account both the hops and the end-to-end availible keys, so that the secret key generated by QKD can be used effectively. We also simulate this quantum cryptography communication network, and the result shows that based on SDN and the proposed routing algorithm the performance of this network is improved since the effective use of the quantum key resources.
With the advent of powerful quantum computers, an emerging quantum-resilient security mechanism within existing networks is crucial. Thus, Quantum Key Distribution (QKD), which generates symmetric secret keys with Information-Theoretical Security (ITS) for secure point-to-point communication, is present as a solution. Despite QKD’s potential, its deployment is challenging due to significant investment and infrastructure requirements. Using state-of-the-art technology, the maximum distance between nodes is limited to hundreds of kilometers, necessitating multiple nodes to relay keys. For now, QKD Network (QKDN) relies on software-defined networking (SDN) and a central orchestrator, but this centralized approach has limitations. Hence, the main challenge is to select an efficient path between key relays to avoid communication failure. To address these challenges, a more distributed approach could be envisioned. In this paper, we propose to leverage one of the distributed routing protocols, OSPF, to redefine and improve the current architecture. We propose a novel QKDN-based OSPF (Open Shortest Path First) architecture for efficient key relay routing, offering a completely different dimension to the overall network management: we modify QKDN architecture to exploit the OSPF networks and present a QKD-enabled OSPF version capable of computing the best path for key relay, offering a cost-effective and scalable solution for widespread QKD adoption.
The ability to protect information has always played an important role in the evolution of civilizations, and even in the history of mankind as a whole. Safe and reliable communications have become an essential component of people’s lives in the era of modern digital technologies, when all spheres and areas of activity, from defense and government to business and social communications, are unthinkable without real-time data exchange. Classical methods of cryptographic protection have long been used to ensure the security of data transmission, but with the explosive growth in computing power and the emerging development of quantum computers, many traditional solutions have become vulnerable. Quantum Key Distribution (QKD) is a popular research area at the moment, due to its use of the laws of quantum mechanics, and thus it is possible to provide a completely secure level of encryption. But traditional quantum communication protocols have their limitations, including low key generation rates, scalability problems in large networks, and vulnerabilities to various forms of cyberattacks in the network layer. Therefore, in this work we propose a new adaptive quantum key distribution algorithm using software-defined networking (SDN) technology. The main idea of the proposed approach is to introduce some level of redundancy in the key generation stage, which increases the throughput, robustness, and adaptability of multi-node quantum networks. In addition, the SDN control layer allows dynamic routing and resource management and quick response to changes in the network state, making the system more resistant to denial-of-service and eavesdropping attacks. Evaluating our solution in comparison with BB84, we show that the new algorithm provides better performance without losing its security level, making the work a step towards creating a working quantum-secure communication system.
Recent developments in quantum key distribution (QKD) demonstrate the maturity of securing sensitive data against the emerging quantum computing threat. For QKD-secured long-haul and meshed optical transport networks (OTNs), quantum key management systems (QKMSs) are essential to overcome current distance limitations of available QKD devices. In this work, we present and compare two implementations of QKMSs, analyzing their scalability with an emulated QKD network (QKDN) utilizing recorded performance metrics from deployed QKD devices. First, we use a state-of-the-art Internet routing scheme, i.e., open shortest path first (OSPF), demonstrating that key management entities (KMEs) can solve the key routing problem utilizing distributed routing. Second, we apply software-defined networking (SDN) to implement centralized routing with a SDN controller. This paper compares distributed with centralized key routing regarding scalability, throughput, and latency. Both schemes facilitate up to six key relays between any pair of nodes in parallel with average key relay durations per hop below 300 ms given the Nobel-Germany topology and any-to-any demand matrix. With a network-wide joint key routing optimization in the SDN controller, up to 16.7% higher demands can be served compared to distributed key routing. Within the inherent compatibility of our study to network-function virtualization (NFV), we guideline future integration of QKMSs into deployed OTNs.
Quantum Key Distribution (QKD) is a technique for sharing encryption keys between two adjacent nodes in an unconditionally secure manner based on quantum theory. From the viewpoint of network system research, QKD is considered to be a building block for providing secure link communication in network systems. Although the communication distance is subject to a limitation attributable to the QKD fundamentals, recent research and some QKD field trials of “key relaying” over a “QKD network” are overcoming this limitation. It also enables each node on the QKD network to exchange encryption keys with arbitrary nodes on the QKD network. However, the previous research didn't address a routing method on the QKD network in detail. This paper focuses on the routing issues on the QKD network, clarifies the requirements of the routing protocol, and proposes a routing solution designed for the key relaying on the QKD network. The proposed routing solution consists of 4 components: (1) a node interface architecture addressing both encrypted and unencrypted traffics, (2) a path selection algorithm based on the number of keys, (3) an IP address assignment scheme connecting unencrypted interfaces and encrypted interfaces, and (4) a routing protocol deployment method consuming no extra keys. The proposed routing solution allows the QKD network to select a suitable key relaying path according to the QKD system condition and to reduce the extra key consumption, which optimizes the key utilization on the QKD network. The proposed routing solution was implemented with a network emulating QKD technology and evaluated. The evaluation result shows that the proposed routing solution could select a path that stores enough keys, which is suitable for a QKD network. Additional impact analysis reveals that the proposed routing solution could save up to 52% of key consumption depending on the QKD key sharing speed and the routing protocol configuration.