Resource requirements and speed versus geometry of unconditionally secure physical key exchanges
This addresses cost and scalability issues for unconditionally secure key exchanges in networked systems, though it appears incremental as it builds on existing concepts like QKD and KLJN.
The paper tackles the impracticality and high cost of dedicated connections for unconditionally secure key exchanges like QKD and KLJN in peer-to-peer networks by analyzing a star network where hosts share cables, reducing the need for additional infrastructure. It provides a protocol and equation for secure bit exchange periods, comparing costs and reliability across network geometries.
The imperative need for unconditional secure key exchange is expounded by the increasing connectivity of networks and by the increasing number and level of sophistication of cyberattacks. Two concepts that are information theoretically secure are quantum key distribution (QKD) and Kirchoff-law-Johnson-noise (KLJN). However, these concepts require a dedicated connection between hosts in peer-to-peer (P2P) networks which can be impractical and or cost prohibitive. A practical and cost effective method is to have each host share their respective cable(s) with other hosts such that two remote hosts can realize a secure key exchange without the need of an additional cable or key exchanger. In this article we analyze the cost complexities of cable, key exchangers, and time required in the star network. We mentioned the reliability of the star network and compare it with other network geometries. We also conceived a protocol and equation for the number of secure bit exchange periods needed in a star network. We then outline other network geometries and trade-off possibilities that seem interesting to explore.