Resource requirements and speed versus geometry of unconditionally secure physical key exchanges

Elias Gonzalez, Robert Balog, Laszlo B. Kish

Research output: Contribution to journalArticle

4 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)2010-2024
Number of pages15
JournalEntropy
Volume17
Issue number4
DOIs
Publication statusPublished - 2015
Externally publishedYes

Fingerprint

resources
requirements
geometry
cables
exchangers
costs
stars

Keywords

  • Information theoretically secure
  • KLJN
  • Networks
  • QKD
  • Secure key exchange
  • Star network
  • Unconditional security

ASJC Scopus subject areas

  • Physics and Astronomy(all)

Cite this

Resource requirements and speed versus geometry of unconditionally secure physical key exchanges. / Gonzalez, Elias; Balog, Robert; Kish, Laszlo B.

In: Entropy, Vol. 17, No. 4, 2015, p. 2010-2024.

Research output: Contribution to journalArticle

Gonzalez, Elias ; Balog, Robert ; Kish, Laszlo B. / Resource requirements and speed versus geometry of unconditionally secure physical key exchanges. In: Entropy. 2015 ; Vol. 17, No. 4. pp. 2010-2024.
@article{4ccd3e6d12374bcfa6284c85c9b0b4db,
title = "Resource requirements and speed versus geometry of unconditionally secure physical key exchanges",
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.",
keywords = "Information theoretically secure, KLJN, Networks, QKD, Secure key exchange, Star network, Unconditional security",
author = "Elias Gonzalez and Robert Balog and Kish, {Laszlo B.}",
year = "2015",
doi = "10.3390/e17042010",
language = "English",
volume = "17",
pages = "2010--2024",
journal = "Entropy",
issn = "1099-4300",
publisher = "Multidisciplinary Digital Publishing Institute (MDPI)",
number = "4",

}

TY - JOUR

T1 - Resource requirements and speed versus geometry of unconditionally secure physical key exchanges

AU - Gonzalez, Elias

AU - Balog, Robert

AU - Kish, Laszlo B.

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

KW - Information theoretically secure

KW - KLJN

KW - Networks

KW - QKD

KW - Secure key exchange

KW - Star network

KW - Unconditional security

UR - http://www.scopus.com/inward/record.url?scp=84930353703&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84930353703&partnerID=8YFLogxK

U2 - 10.3390/e17042010

DO - 10.3390/e17042010

M3 - Article

VL - 17

SP - 2010

EP - 2024

JO - Entropy

JF - Entropy

SN - 1099-4300

IS - 4

ER -