Logical loophole in random 3-bit sequence generator

Alexandre de Castro

Paper 2017/681

Logical loophole in random 3-bit sequence generator

Alexandre de Castro

Abstract

In this note, we will provide an information-theoretic framework for the random 3-bit sequence {111, 110, 101, 100, 011, 010, 001, 000} that demonstrates (by using Wigner’s inequality) a logical loophole in the Bell-CHSH inequality [1, 2, 3], as also has recently been found experimentally for triples measurements [4]. As a consequence of this, both classical and quantum regimes can share their bounds within the same environment, which shows that maximally entangled states used in cryptography secure systems can be critically subverted via EPR (Einstein-Podolsky-Rosen) paradox [5].

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Preprint.
Keywords: quantum cryptography
Contact author(s): alexandre castro @ embrapa br
History: 2017-12-12: last of 5 revisions; 2017-07-18: received; See all versions
Short URL: https://ia.cr/2017/681
License: CC BY

BibTeX

@misc{cryptoeprint:2017/681,
      author = {Alexandre de Castro},
      title = {Logical loophole in random 3-bit sequence generator},
      howpublished = {Cryptology {ePrint} Archive, Paper 2017/681},
      year = {2017},
      url = {https://eprint.iacr.org/2017/681}
}