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

On the security of the Kirchhoff-law–Johnson-noise (KLJN) communicator A simple and general proof is given for the information theoretic (unconditional) security of the Kirchhoff-law–Johnson-noise 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 toward 0.5—i.e., the perfect security level—when ideal conditions are approached. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

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

Loading next page...
 
/lp/springer_journal/on-the-security-of-the-kirchhoff-law-johnson-noise-kljn-communicator-Cu5R0PBHco
Publisher
Springer US
Copyright
Copyright © 2014 by Springer Science+Business Media New York
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
D.O.I.
10.1007/s11128-014-0729-7
Publisher site
See Article on Publisher Site

Abstract

A simple and general proof is given for the information theoretic (unconditional) security of the Kirchhoff-law–Johnson-noise 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 toward 0.5—i.e., the perfect security level—when ideal conditions are approached.

Journal

Quantum Information ProcessingSpringer Journals

Published: Jan 18, 2014

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off