Improving randomness characterization through Bayesian model selection

• Published in: Scientific reports 2017-06, Vol.7 (1), p.3096-6, Article 3096
• Main Authors: Díaz Hernández Rojas, Rafael, Solís, Aldo, Angulo Martínez, Alí M., U’Ren, Alfred B., Hirsch, Jorge G., Marsili, Matteo, Pérez Castillo, Isaac
• Format: Article
• Language: English
• Subjects: 639/624/1111; 639/705/531; Bayesian analysis; Computer programs; Cryptography; Humanities and Social Sciences; Methods; Monte Carlo simulation; multidisciplinary; Science; Science (multidisciplinary)
• ISSN: 2045-2322; 2045-2322
• DOI: 10.1038/s41598-017-03185-y

Random number generation plays an essential role in technology with important applications in areas ranging from cryptography to Monte Carlo methods, and other probabilistic algorithms. All such applications require high-quality sources of random numbers, yet effective methods for assessing whether a source produce truly random sequences are still missing. Current methods either do not rely on a formal description of randomness (NIST test suite) on the one hand, or are inapplicable in principle (the characterization derived from the Algorithmic Theory of Information), on the other, for they require testing all the possible computer programs that could produce the sequence to be analysed. Here we present a rigorous method that overcomes these problems based on Bayesian model selection. We derive analytic expressions for a model’s likelihood which is then used to compute its posterior distribution. Our method proves to be more rigorous than NIST’s suite and Borel-Normality criterion and its implementation is straightforward. We applied our method to an experimental device based on the process of spontaneous parametric downconversion to confirm it behaves as a genuine quantum random number generator. As our approach relies on Bayesian inference our scheme transcends individual sequence analysis, leading to a characterization of the source itself.