Data Structures and Algorithms

1408 Submissions

[3] viXra:1408.0145 [pdf] submitted on 2014-08-21 18:55:42

Enhanced Usage of Keys Obtained by Physical, Unconditionally Secure Distributions

Authors: Laszlo B. Kish
Comments: 3 Pages. submitted for publication

Unconditionally secure physical key distribution is very slow whenever it is undoubtedly secure. Thus it is practically impossible to use a one-time-pad based cipher to guarantee perfect security be-cause using the key bits more than once gives out statistical information, such as via the known-plain-text-attack or by utilizing known components of the protocol and language statistics. Here we outline a protocol that seems to reduce this problem and allows a near-to-one-time-pad based communication with unconditionally secure physical key of finite length. The unconditionally secure physical key is not used for communication; it is use for a secure communication to generate and share a new software-based key without known-plain-text component, such as keys shared via the Diffie-Hellmann-Merkle protocol. This combined physical/software key distribution based communication looks favorable compared to the physical key based communication when the speed of the physical key distribution is much slower than that of the software-based key distribution. The security proof of this scheme is yet an open problem.
Category: Data Structures and Algorithms

[2] viXra:1408.0123 [pdf] submitted on 2014-08-18 13:06:44

Facts, Myths and Fights About the KLJN Classical Physical Key Exchanger

Authors: Laszlo B. Kish, Derek Abbott, Claes-Goran Granqvist, He Wen
Comments: 4 Pages. In: Proceedings of the first conference on Hot Topics in Physical Informatics (HoTPI, 2013 November). Paper is in press at International Journal of Modern Physics: Conference Series (2014).

This paper deals with the Kirchhoff-law-Johnson-noise (KLJN) classical statistical physical key exchange method and surveys criticism - often stemming from a lack of understanding of its underlying premises or from other errors - and our related responses against these, often unphysical, claims. Some of the attacks are valid, however, an extended KLJN system remains protected against all of them, implying that its unconditional security is not impacted.
Category: Data Structures and Algorithms

[1] viXra:1408.0048 [pdf] submitted on 2014-08-08 23:27:58

Trillion by Trillion Matrix Inverse: not Actually that Crazy

Authors: Alexander Fix, Misha Collins
Comments: 3 Pages.

A trillion by trillion matrix is almost unimaginably huge, and finding its inverse seems to be a truly im- possible task. However, given current trends in com- puting, it may actually be possible to achieve such a task around 2040 — if we were willing to devote the the entirety of human computing resources to a single computation. Why would we want to do this? Perhaps, as Mallory said of Everest: “Because it’s there”.
Category: Data Structures and Algorithms