Data Structures and Algorithms

1305 Submissions

[2] viXra:1305.0126 [pdf] replaced on 2013-10-20 15:31:49

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

Authors: Yessica Saez, Laszlo B. Kish
Comments: 19 Pages. Accepted for publication at PLOS ONE

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.
Category: Data Structures and Algorithms

[1] viXra:1305.0068 [pdf] replaced on 2013-07-26 18:31:54

Physical Uncloneable Function Hardware Keys Utilizing Kirchhoff-Law-Johnson-Noise Secure Key Exchange and Noise-Based Logic

Authors: Laszlo B. Kish, Chiman Kwan
Comments: 9 Pages. clarifications/enhancements; in publication process

Weak uncloneable function (PUF) encryption key means that the manufacturer of the hardware can clone the key but anybody else is unable to so that. Strong uncloneable function (PUF) encryption key means that even the manufacturer of the hardware is unable to clone the key. In this paper, first we introduce an "ultra"-strong PUF with intrinsic dynamical randomness, which is not only not cloneable but it also gets renewed to an independent key (with fresh randomness) during each use via the unconditionally secure key exchange. The solution utilizes the Kirchhoff-law-Johnson-noise (KLJN) method for dynamical key renewal and a one-time-pad secure key for the challenge/response process. The secure key is stored in a flash memory on the chip to provide tamper-resistance and non-volatile storage with zero power requirements in standby mode. Simplified PUF keys are shown: a strong PUF utilizing KLJN protocol during the first run and noise-based logic (NBL) hyperspace vector string verification method for the challenge/response during the rest of its life or until it is re-initialized. Finally, the simplest PUF utilizes NBL without KLJN thus it can be cloned by the manufacturer but not by anybody else.
Category: Data Structures and Algorithms