2018
DOI: 10.3390/e20110886
|View full text |Cite
|
Sign up to set email alerts
|

Advanced Statistical Testing of Quantum Random Number Generators

Abstract: Pseudo-random number generators are widely used in many branches of science, mainly in applications related to Monte Carlo methods, although they are deterministic in design and, therefore, unsuitable for tackling fundamental problems in security and cryptography. The natural laws of the microscopic realm provide a fairly simple method to generate non-deterministic sequences of random numbers, based on measurements of quantum states. In practice, however, the experimental devices on which quantum random number… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
17
0

Year Published

2020
2020
2025
2025

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 16 publications
(17 citation statements)
references
References 17 publications
0
17
0
Order By: Relevance
“…Since statistical tests such as those of the NIST suite were originally developed to test PRNGs, they are not necessarily sensitive to the particular issues and properties that characterize QRNGs. QRNGs that pass the NIST tests may struggle with tests that probe aspects of incomputability and algorithmic randomness, or show at least no marked advantage over PRNGs in terms of their algorithmic properties [28][29][30]. Here one particularly relevant and commonly used test is the Borel normality [24,34], which is a necessary (but not sufficient, e.g., Champernowne's constant [50] is normal but computable) condition for algorithmic randomness and thus incomputability.…”
Section: Borel Normalitymentioning
confidence: 99%
See 4 more Smart Citations
“…Since statistical tests such as those of the NIST suite were originally developed to test PRNGs, they are not necessarily sensitive to the particular issues and properties that characterize QRNGs. QRNGs that pass the NIST tests may struggle with tests that probe aspects of incomputability and algorithmic randomness, or show at least no marked advantage over PRNGs in terms of their algorithmic properties [28][29][30]. Here one particularly relevant and commonly used test is the Borel normality [24,34], which is a necessary (but not sufficient, e.g., Champernowne's constant [50] is normal but computable) condition for algorithmic randomness and thus incomputability.…”
Section: Borel Normalitymentioning
confidence: 99%
“…While these are striking advantages over PRNGs, practical realizations of QRNGs exhibit problems of their own [6]. In particular, they tend to be susceptible to substantial bias and correlation effects that may detrimentally affect the quality of the output from the point of view of statistical and algorithmic randomness [28][29][30].…”
Section: Introductionmentioning
confidence: 99%
See 3 more Smart Citations