F. Peper | Search arXiv

arXiv2012

Information theoretic security by the laws of classical physics

It has been shown recently that the use of two pairs of resistors with enhanced Johnson-noise and a Kirchhoff-loop-i.e., a Kirchhoff-Law-Johnson-Noise (KLJN) protocol-for secure key distribution leads to information theoretic security levels superior to those of a quantum key distribution, including a natural immunity against a man-in-the-middle attack. This issue is becoming particularly timely because of the recent full cracks of practical quantum communicators, as shown in numerous peer-reviewed publications. This presentation first briefly surveys the KLJN system and then discusses related, essential questions such as: what are perfect and imperfect security characteristics of key distribution, and how can these two types of securities be unconditional (or information theoretical)? Finally the presentation contains a live demonstration.

cs.ET↗

arXiv2011

New noise-based logic representations to avoid some problems with time complexity

Instantaneous noise-based logic can avoid time-averaging, which implies significant potential for low-power parallel operations in beyond-Moore-law-chips. However, the universe (uniform superposition) will be zero with high probability (non-zero with exponentially low probability) in the random-telegraph-wave representation thus the operations with the universe would require exponential time-complexity. To fix this deficiency, we modify the amplitudes of the signals of the L and H states and achieve an exponential speedup compared to the old situation. Another improvement concerns the identification of a single product (hyperspace) state. We introduce a time shifted noise-based logic, which is constructed by shifting each reference signal with a small time delay. This modification implies an exponential speedup of single hyperspace vector identification compared to the former case and it requires the same, O(N) complexity as in quantum computing.

cs.OH↗