Abstract
A method to quantify the error probability at the Kirchhoff-law-Johnson-noise (KLJN) secure key exchange is introduced. The types of errors due to statistical inaccuracies in noise voltage measurements are classified and the error probability is calculated. The most interesting finding is that the error probability decays exponentially with the duration of the time window of single bit exchange. The results indicate that it is feasible to have so small error probabilities of the exchanged bits that error correction algorithms are not required. The results are demonstrated with practical considerations.
Highlights
1.1 The KLJN secure key exchange In today’s era, network security has become one of the most important aspects in everyday life
In private-key based secure communication, the two communicating parties (Alice and Bob) generate and share a secure key, which is typically represented by a random bit sequence
Kish pointed out [37] in his response to [36] that at similar conditions Eve’s statistic was very poor and the extracted information was practically miniscule even without the defense of discarding the risky bits. This claim was experimentally verified by Mingesz et al [29], who showed that at clock period of 50 times of the noise correlation time, R0~2000V, R1~9000V, and wire resistance 200V, the information leak of exchanged raw bits to Eve was 0.19% while the fidelity between Alice and Bob was 99.98%. These results indicate that the key exchange has excellent fidelity even without error correction and that the security can be made reasonably good even without dropping the risky 01/10 bits and without privacy amplification [29]
Summary
1.1 The KLJN secure key exchange In today’s era, network security has become one of the most important aspects in everyday life. This claim was experimentally verified by Mingesz et al [29], who showed that at clock period of 50 times of the noise correlation time, R0~2000V, R1~9000V, and wire resistance 200V, the information leak of exchanged raw bits to Eve was 0.19% while the fidelity between Alice and Bob was 99.98% These results indicate that the key exchange has excellent fidelity even without error correction and that the security can be made reasonably good even without dropping the risky 01/10 bits (after current/voltage comparison at the two ends) and without privacy amplification [29]. Our goal in this paper is to classify the different types of bit errors in the ideal KLJN system and analyze their impact
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
