World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Optimization-Based Strategies for the Error Removal Method in the Ideal, Symmetric KLJN Secure Key Exchanger

    https://doi.org/10.1142/S0219477519500044Cited by:1 (Source: Crossref)

    The Kirchhoff’s-Law-Johnson-Noise (KLJN) secure key exchanger is a simple, low-cost scheme that provides symmetric encryption with unconditional security in electronic communication. The key bits are generated based on measurements of the mean-square value of the noise voltage and/or current of the channel between the two communicating parties. In this work, a combined current–voltage measurement mode scenario and an error removal method for the ideal, symmetric KLJN secure key exchanger that uses an identical pair of resistors at both ends of the communication line were considered, which improves the fidelity and reduces the bit error probability compared to the schemes when either voltage or current measurement are being used. It has been shown in previous works that the error probability of the original, symmetric KLJN secure key exchanger decays exponentially with parameters such as the time window for performing the key exchange and other relevant criteria used in the interpretation of the key bits. The objective of this work is to develop optimization strategies for the ideal, symmetric KLJN secure key exchanger in order to obtain optimal values of these parameters while ensuring that errors are kept within acceptable values. For those strategies, closed-form solutions to the optimal values were derived by solving the Karush–Kuhn–Tucker (KKT) conditions. Numerical results show that the proposed optimization techniques not only ensure that the bit probability error remains within the desired limit, but also provide more flexibility to define the thresholds values, reduce the bit exchange period needed to guarantee an acceptable bit error probability, weaken Eve’s statistics, and improve the system resource managing.

    Communicated by Zoltan Gingl

    Remember to check out the Most Cited Articles!

    Be inspired by these NEW Mathematics books for inspirations & latest information in your research area!