ETCRMay 21, 2013

Errors and their mitigation at the Kirchhoff-law-Johnson-noise secure key exchange

arXiv:1305.4787v250 citations
AI Analysis

This addresses the need for reliable secure key exchange in cryptography, though it appears incremental as it builds on existing KLJN methods.

The paper tackled the problem of error probability in the Kirchhoff-law-Johnson-noise (KLJN) secure key exchange by quantifying and classifying errors from noise voltage measurements, finding that error probability decays exponentially with the time window duration, enabling error probabilities small enough to avoid error correction algorithms.

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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes