The platform will undergo maintenance on Sep 14 at about 7:45 AM EST and will be unavailable for approximately 2 hours.
2013
DOI: 10.1371/journal.pone.0081103
|View full text |Cite
|
Sign up to set email alerts
|

Errors and Their Mitigation at the Kirchhoff-Law-Johnson-Noise Secure Key Exchange

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 corre… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

2
54
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
8

Relationship

5
3

Authors

Journals

citations
Cited by 33 publications
(56 citation statements)
references
References 51 publications
2
54
0
Order By: Relevance
“…As already mentioned above, the known sets must be properly checked, because only choices with degenerated voltage/current/power values can be considered secure-not the singular values. Bit-error analysis [13,14] and error removal is still an open problem in the RRTT-KLJN scheme.…”
Section: Some Practical Considerationsmentioning
confidence: 99%
See 1 more Smart Citation
“…As already mentioned above, the known sets must be properly checked, because only choices with degenerated voltage/current/power values can be considered secure-not the singular values. Bit-error analysis [13,14] and error removal is still an open problem in the RRTT-KLJN scheme.…”
Section: Some Practical Considerationsmentioning
confidence: 99%
“…The Kirchhoff-law-Johnson-noise (KLJN) secure key distribution scheme [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20] is a classical-statistical physical alternative to the quantum key distribution. Figure 1 depicts a binary version of the KLJN scheme and shows that, during a single-bit exchange, the communicating parties (Alice and Bob) connect their randomly chosen resistor (including its Johnson noise generator) to a wire channel.…”
Section: Introductionmentioning
confidence: 99%
“…Also, the duration of the bit sharing period must be long enough compared to the correlation time of the noise , i.e., ≈ 1 , in order to correctly distinguish between the different resistors situations [31,32]. The frequency of secure bit exchange is:…”
Section: Upper Limit Of the Kljn Key Lifetimementioning
confidence: 99%
“…where ≫ 1, see [31,32] and the factor 1 2 is due to the fact that a secure bit exchange occurs (on average) 50% of the time.…”
Section: Upper Limit Of the Kljn Key Lifetimementioning
confidence: 99%
“…In the case of perfect secrecy (security), p remains at this value even when Eve is eavesdropping, and the bit-error probability of key exchange between Alice and Bob is irrelevant. We offer the following illustrative example to show the inadequacy in using secrecy rate to judge the security of the KLJN system [39,40]: By manipulating wire resistance, frequency bandwidth and bit-detection thresholds, it is possible to design two different KLJN systems with identical secrecy rate; one of the systems has very poor security (p ≈ 1) while the other has very strong security (p ≈ 0.5).…”
mentioning
confidence: 99%