The Kirchhoff-law–Johnson-noise (KLJN) secure key distribution system provides a way of exchanging theoretically secure keys by measuring random voltage and current through the wire connecting two different resistors at Alice's and Bob's ends. Recently new advanced protocols for the KLJN method have been proposed with enhanced performance. In this paper, we analyze the KLJN system and compare with the "intelligent" KLJN (iKLJN) scheme. That task requires determination of the applied resistors and identification of various superpositions of known and unknown noise components. Some statistical tools will be explored to determine how the duration of the bit exchange window (averaging time) influences the performance of the secure bit exchange.
The Kirchhoff-law–Johnson-noise (KLJN) secure key distribution system provides a way of exchanging theoretically secure keys by measuring random voltage and current through the wire connecting two different resistors at Alice's and Bob's ends. Recently new advanced protocols for the KLJN method have been proposed with enhanced performance. In this paper, we analyze the KLJN system and compare with the "intelligent" KLJN (iKLJN) scheme. That task requires determination of the applied resistors and identification of various superpositions of known and unknown noise components. Some statistical tools will be explored to determine how the duration of the bit exchange window (averaging time) influences the performance of the secure bit exchange.
The Kirchhoff-Law-Johnson-Noise (KLJN) secure key distribution system provides a way of exchanging theoretically secure keys by measuring random voltage and current through the wire connecting two different resistors at Alice's and Bob's ends. Recently new advanced protocols for the KLJN method have been proposed with enhanced performance. In this paper we analyze the KLJN system and compare with the intelligent KLJN (iKLJN) scheme. That task requires determination of the applied resistors and identification of various superpositions of known and unknown noise components. Some statistical tools will be explored to determine how the duration of the bit exchange window (averaging time) influences the performance of the secure bit exchange.
The Kirchhoff-Law-Johnson-Noise (KLJN) secure key distribution system provides a way of exchanging information theoretic secure keys by measuring the random voltage and current through the wire connecting two different resistors at Alice's and Bob's ends. Recently new advanced protocols for the KLJN method have been proposed with enhanced performance. In this paper we analyze the KLJN system and compare with “intelligent” KLJN (iKLJN) scheme. This task requires the determination of the applied resistors and the identification of the various superpositions of known and unknown noise components. Some statistical tools to determine how the duration of the bit exchange window (averaging time) influences the performance of secure bit exchange will be explored.
Abstract We introduce seven new versions of the Kirchhoff-Law-Johnson-(like)-Noise (KLJN) classical physical secure key exchange scheme and a new transient protocol for practically-perfect security. While these practical improvements offer progressively enhanced security and/or speed for non-ideal conditions, the fundamental physical laws providing the security remain the same. In the "intelligent" KLJN (iKLJN) scheme, Alice and Bob utilize the fact that they exactly know not only their own resistor value but also the stochastic time function of their own noise, which they generate before feeding it into the loop. By using this extra information, they can reduce the duration of exchanging a single bit and in this way they achieve not only higher speed but also an enhanced security because Eve’s information will significantly be reduced due to smaller statistics. In the "multiple" KLJN (MKLJN) system, Alice and Bob have publicly known identical sets of different resistors with a proper, publicly known truth table about the bit-interpretation of their combination. In this new situation, for Eve to succeed, it is not enough to find out which end has the higher resistor. Eve must exactly identify the actual resistor values at both sides. In the "keyed" KLJN (KKLJN) system, by using secure communication with a formerly shared key, Alice and Bob share a proper time-dependent truth table for the bit-interpretation of the resistor situation for each secure bit exchange step during generating the next key. In this new situation, for Eve to succeed, it is not enough to find out the resistor values at the two ends. Eve must also know the former key. The remaining four KLJN schemes are the combinations of the above protocols to synergically enhance the security properties. These are: the "intelligent-multiple" (iMKLJN), the "intelligent-keyed" (iKKLJN), the "keyed-multiple" (KMKLJN) and the "intelligent-keyed-multiple" (iKMKLJN) KLJN key exchange systems. Finally, we introduce a new transient-protocol offering practically-perfect security without privacy amplification, which is not needed in practical applications but it is shown for the sake of ongoing discussions.
The Kirchhoff-Law-Johnson-Noise (KLJN) key exchange protocol had been introduced as an ultra-low cost alternative of quantum cryptography. Two years ago we have developed a generalized version of the KLJN key exchanger (VGM-KLJN), and we have proved that the system works perfectly secure under much more general conditions that allows compensation of many kinds of imperfections. In this work we focus on the experimental analysis of our recently introduced VGM-KLJN system. We determine the time required to transfer a bit, the error rate of the information transfer and we also evaluate the probability of successful eavesdropping in the case of different imperfections of the components. We demonstrate a method of real-time identification and compensation of these imperfections. The results of our analysis can greatly aid practical applications and at the same time can serve as a guide to design a system with the required security level.
Abstract We introduce two new Kirchhoff-law-Johnson-noise (KLJN) secure key distribution schemes which are generalizations of the original KLJN scheme. The first of these, the Random-Resistor (RR-) KLJN scheme, uses random resistors with values chosen from a quasi-continuum set. It is well-known since the creation of the KLJN concept that such a system could work in cryptography, because Alice and Bob can calculate the unknown resistance value from measurements, but the RR-KLJN system has not been addressed in prior publications since it was considered impractical. The reason for discussing it now is the second scheme, the Random Resistor Random Temperature (RRRT-) KLJN key exchange, inspired by a recent paper of Vadai, Mingesz and Gingl, wherein security was shown to be maintained at non-zero power flow. In the RRRT-KLJN secure key exchange scheme, both the resistances and their temperatures are continuum random variables. We prove that the security of the RRRT-KLJN scheme can prevail at a non-zero power flow, and thus the physical law guaranteeing security is not the Second Law of Thermodynamics but the Fluctuation-Dissipation Theorem. Alice and Bob know their own resistances and temperatures and can calculate the resistance and temperature values at the other end of the communication channel from measured voltage, current and power-flow data in the wire. However, Eve cannot determine these values because, for her, there are four unknown quantities while she can set up only three equations. The RRRT-KLJN scheme has several advantages and makes all former attacks on the KLJN scheme invalid or incomplete.
This paper demonstrates the vulnerability of the Kirchhoff-Law-Johnson-Noise (KLJN) secure key exchanger to compromised random number generator(s) even if these random numbers are used solely to generate the noises emulating the Johnson noise of Alice’s and Bob’s resistors. The attacks shown are deterministic in the sense that Eve’s knowledge of Alice’s and/or Bob’s random numbers is basically deterministic. Moreover, no statistical evaluation is needed, except for rarely occurring events of negligible, random waiting time and verification time. We explore two situations. In the first case, Eve knows both Alice’s and Bob’s random noises. We show that, in this situation, Eve can quickly crack the secure key bit by using Ohm’s Law. In the other situation, Eve knows only Bob’s random noise. Then Eve first can learn Bob’s resistance value by using Ohm’s Law. Therefore, she will have the same knowledge as Bob, thus at the end of the bit exchange period, she will know Alice’s bit.