CRETSep 16, 2013

On the security of the Kirchhoff-law-Johnson-noise (KLJN) communicator

arXiv:1309.4112v160 citations
Originality Highly original
AI Analysis

This addresses security concerns for quantum-resistant communication systems, offering a foundational advancement rather than an incremental improvement.

The paper tackles the security of the Kirchhoff-law-Johnson-noise (KLJN) key exchange system by providing a general proof of its information-theoretic security under practical conditions, showing that Eve's bit-guessing probability converges to 0.5, achieving perfect security.

A simple and general proof is given for the information theoretic (unconditional) security of the Kirchhoff-law-Johnson-noise (KLJN) key exchange system under practical conditions. The unconditional security for ideal circumstances, which is based on the Second Law of Thermodynamics, is found to prevail even under slightly non-ideal conditions. This security level is guaranteed by the continuity of functions describing classical physical linear, as well as stable non-linear, systems. Even without privacy amplification, Eve's probability for successful bit-guessing is found to converge towards 0.5 - i.e., the perfect security level - when ideal conditions are approached.

Foundations

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

Your Notes