A simple low-latency real-time certifiable quantum random number generator

Zhang, Yanbao; Lo, Hao‐Yung; Mink, Alan; Ikuta, Takuya; Honjo, Toshimori; Takesue, Hiroki; Munro, William J.

doi:10.1038/s41467-021-21069-8

Cited by 23 publications

(9 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A similar approach can be done for QPE, as, for example, in ref. 28 . The full inclusion of finite-size effects by the EAT is out of the scope of this work and will be investigated in our future research.…”

Section: Resultsmentioning

confidence: 99%

“…The Semi-DI protocols work in a similar "paranoid scenario" of DI, although with few assumptions on the devices' inner working. Assumptions can be related to the dimension of the exchanged system 12 , the device used for the measurement [13][14][15][16][17] , the device used for the source 18,19 , the overlap between the states 20 the energy [21][22][23][24][25][26][27] or general apparatus imperfections 28 . These protocols are promising, since they can provide a higher level of security with a generation rate compatible with practical needs.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Unbounded randomness from uncharacterized sources

et al. 2022

View full text Add to dashboard Cite

Randomness is a central feature of quantum mechanics and an invaluable resource for both classical and quantum technologies. Commonly, in Device-Independent and Semi-Device-Independent scenarios, randomness is certified using projective measurements, and its amount is bounded by the quantum system’s dimension. Here, we propose a Source-Device-Independent protocol, based on Positive Operator Valued Measurement (POVM), which can arbitrarily increase the number of certified bits for any fixed dimension. Additionally, the proposed protocol doesn’t require an initial seed and active basis switching, simplifying its experimental implementation and increasing the generation rates. A tight lower-bound on the quantum conditional min-entropy is derived using only the POVM structure and the experimental expectation values, taking into account the quantum side-information. For symmetric POVM on the Bloch sphere, we derive closed-form analytical bounds. Finally, we experimentally demonstrate our method with a compact and simple photonic setup that employs polarization-encoded qubits and POVM up to 6 outcomes.

show abstract

Section: Resultsmentioning

confidence: 99%

mentioning

confidence: 99%

Unbounded randomness from uncharacterized sources

et al. 2022

View full text Add to dashboard Cite

show abstract

“…Typically, measurement bases are chosen randomly from a complementing pair so that the presence of noise can be detected. An initial random seed is required to choose the different measurement settings [170]. The generator could be modeled on a fixed set of assumptions or be made flexible, trading security for data rates [188].…”

Section: Source Device Independent Qrngsmentioning

confidence: 99%

A Comprehensive Review of Quantum Random Number Generators: Concepts, Classification and the Origin of Randomness

Mannalath¹,

Mishra²,

Pathak³

2022

Preprint

View full text Add to dashboard Cite

Random numbers are central to cryptography and various other tasks. The intrinsic probabilistic nature of quantum mechanics has allowed us to construct a large number of quantum random number generators (QRNGs) that are distinct from the traditional true number generators. This article provides a review of the existing QRNGs with a focus on various possible features of QRNGs (e.g., self-testing, device independence, semi-device independence) that are not achievable on the classical world. It also discusses the origin, applicability, and other facets of randomness. Specifically, the origin of randomness is explored from the perspective of a set of hierarchical axioms for quantum mechanics, implying that succeeding axioms can be regarded as a superstructure constructed on top of a structure built by the preceding axioms. The axioms considered are: (Q1) incompatibility and uncertainty; (Q2) contextuality; (Q3) entanglement; (Q4) nonlocality and (Q5) indistinguishability of identical particles. Relevant toy generalized probability theories (GPTs) are introduced, and it is shown that the origin of random numbers in different types of QRNGs known today are associated with different layers of nonclassical theories and all of them do not require all the features of quantum mechanics. Further, classification of the available QRNGs has been done and the technological challenges associated with each class is critically analyzed. Commercially available QRNGs are also compared.

show abstract

“…Outcomes of such efforts have usually involved the use of one or more pseudo random number generators (PRNGs) as well as true RNGs. The literature includes examples pooling from chaos theory [14], cellular automata (CA) [15], electrical circuits [16] and electronics [17], quantum physics [18], as well as many others. The next few paragraphs emphasize the importance of CA and chaos theory in security applications, as well as their utilization in state-of-the-art image encryption schemes.…”

Section: Introductionmentioning

confidence: 99%

RGB Image Encryption through Cellular Automata, S-Box and the Lorenz System

2022

View full text Add to dashboard Cite

The exponential growth in transmission of multimedia over the Internet and unsecured channels of communications is putting pressure on scientists and engineers to develop effective and efficient security schemes. In this paper, an image encryption scheme is proposed to help solve such a problem. The proposed scheme is implemented over three stages. The first stage makes use of Rule 30 cellular automata to generate the first encryption key. The second stage utilizes a well-tested S-box, whose design involves a transformation, modular inverses, and permutation. Finally, the third stage employs a solution of the Lorenz system to generate the second encryption key. The aggregate effect of this 3-stage process insures the application of Shannon’s confusion and diffusion properties of a cryptographic system and enhances the security and robustness of the resulting encrypted images. Specifically, the use of the PRNG bitstreams from both of the cellular automata and the Lorenz system, as keys, combined with the S-box, results in the needed non-linearity and complexity inherent in well-encrypted images, which is sufficient to frustrate attackers. Performance evaluation is carried out with statistical and sensitivity analyses, to check for and demonstrate the security and robustness of the proposed scheme. On testing the resulting encrypted Lena image, the proposed scheme results in an MSE value of 8923.03, a PSNR value of 8.625 dB, an information entropy of 7.999, NPCR value of 99.627, and UACI value of 33.46. The proposed scheme is shown to encrypt images at an average rate of 0.61 Mbps. A comparative study with counterpart image encryption schemes from the literature is also presented to showcase the superior performance of the proposed scheme.

show abstract

A simple low-latency real-time certifiable quantum random number generator

Cited by 23 publications

References 36 publications

Unbounded randomness from uncharacterized sources

Unbounded randomness from uncharacterized sources

A Comprehensive Review of Quantum Random Number Generators: Concepts, Classification and the Origin of Randomness

RGB Image Encryption through Cellular Automata, S-Box and the Lorenz System

Contact Info

Product

Resources

About