Next Article in Journal
A Method to Derive the Definition of Generalized Entropy from Generalized Exergy for Any State in Many-Particle Systems
Next Article in Special Issue
Cryptographic Aspects of Quantum Reading
Previous Article in Journal
Translation of Ludwig Boltzmann’s Paper “On the Relationship between the Second Fundamental Theorem of the Mechanical Theory of Heat and Probability Calculations Regarding the Conditions for Thermal Equilibrium” Sitzungberichte der Kaiserlichen Akademie der Wissenschaften. Mathematisch-Naturwissen Classe. Abt. II, LXXVI 1877, pp 373-435 (Wien. Ber. 1877, 76:373-435). Reprinted in Wiss. Abhandlungen, Vol. II, reprint 42, p. 164-223, Barth, Leipzig, 1909
Article Menu

Export Article

Open AccessArticle
Entropy 2015, 17(4), 2010-2024; doi:10.3390/e17042010

Resource Requirements and Speed versus Geometry of Unconditionally Secure Physical Key Exchanges

Department of Electrical and Computer Engineering, Texas A&M University, 3128 TAMU College Station, TX 77843, USA
*
Author to whom correspondence should be addressed.
Received: 1 February 2015 / Revised: 24 March 2015 / Accepted: 31 March 2015 / Published: 3 April 2015
(This article belongs to the Special Issue Quantum Cryptography)
View Full-Text   |   Download PDF [626 KB, uploaded 3 April 2015]   |  

Abstract

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 theoretically information-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. View Full-Text
Keywords: KLJN; QKD; networks; star network; secure key exchange; information theoretically secure; unconditional security KLJN; QKD; networks; star network; secure key exchange; information theoretically secure; unconditional security
Figures

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Gonzalez, E.; Balog, R.S.; Kish, L.B. Resource Requirements and Speed versus Geometry of Unconditionally Secure Physical Key Exchanges. Entropy 2015, 17, 2010-2024.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top