Abstract Random numbers have significant applications in fundamental science, high-level scientific research, cryptography and several other areas where there is a pressing need for high-quality random numbers. We present an experimental demonstration of a non-deterministic random bit generator from a quantum entropy source and a deterministic random bit generator mechanism to provide high quality random numbers of 1 GB data size. Quantum entropy is realized by a series of quantum chips based on radioactive isotope Americium-241. The extracted raw random numbers are further post-processed to generate a high-entropy seed for the hash based deterministic random bit generator. We discuss the implementation of randomness extraction algorithm and Hash-DRBG algorithm in detail. The random numbers pass all the randomness measures provided in standard statistical test suites.
Abstract Random numbers have significant applications in fundamental science, high-level scientific research, cryptography and several other areas where there is a pressing need for high-quality random numbers. We present an experimental demonstration of a non-deterministic random bit generator from a quantum entropy source and a deterministic random bit generator mechanism to provide high quality random numbers of 1 GB data size. Quantum entropy is realized by a series of quantum chips based on radioactive isotope Americium-241. The extracted raw random numbers are further post-processed to generate a high-entropy seed for the hash based deterministic random bit generator. We discuss the implementation of randomness extraction algorithm and Hash-DRBG algorithm in detail. The random numbers pass all the randomness measures provided in standard statistical test suites.
Random numbers are one of the key foundations of cryptography. This work implements a discrete quantum random number generator (QRNG) based on the tunneling effect of electrons in an avalanche photo diode. Without any post-processing and conditioning, this QRNG can output raw sequences at a rate of 100 Mbps. Remarkably, the statistical min-entropy of the 8,000,000 bits sequence reaches 0.9944 bits/bit, and the min-entropy validated by NIST SP 800-90B reaches 0.9872 bits/bit. This metric is currently the highest value we have investigated for QRNG raw sequences. Moreover, this QRNG can continuously and stably output raw sequences with high randomness over extended periods. The system produced a continuous output of 1,174 Gbits raw sequence for a duration of 11,744 s, with every 8 Mbits forming a unit to obtain a statistical min-entropy distribution with an average value of 0.9892 bits/bit. The statistical min-entropy of all data (1,174 Gbits) achieves the value of 0.9951 bits/bit. This QRNG can produce high-quality raw sequences with good randomness and stability. It has the potential to meet the high demand in cryptography for random numbers with high quality.
Generation of random numbers is a central problem for many applications in the field of information processing, including, e.g., cryptography, in classical and quantum regime, but also mathematical modeling, Monte Carlo methods, gambling and many others. Both, the quality of the randomness and efficiency of the random numbers generation process are crucial for the most of these applications. Software produced pseudorandom bit sequences, though sufficiently quick, do not fulfill required randomness quality demands. Hence, the physical hardware methods are intensively developed to generate truly random number sequences for information processing and electronic security application. In the present paper we discuss the idea of the quantum random number generators. We also present a variety of tests utilized to assess the quality of randomness of generated bit sequences. In the experimental part we apply such tests to assess and compare two quantum random number generators, PQ4000KSI (of company ComScire US) and JUR01 (constructed in Wroclaw University of Science and Technology upon the project of The National Center for Research and Development) as well as a pseudorandom generator from the Mathematica Wolfram package. Finally, we present our new prototype of fully operative miniaturized quantum random generator JUR02 producing a random bit sequence with velocity of 1 Mb/s, which successfully passed standard tests of randomness quality (like NIST and Dieharder tests). We also shortly discuss our former concept of an entanglement-based quantum random number generator protocol with unconditionally secure public randomness verification.
Randomness is widely used in various fields, including encryption, statistical analysis, and numerical simulations. Randomness is also a fundamental resource in science and engineering. For such applications, we usually need to provide unbiased and independent random bits. This raises the issue of where to get these supposed random bits. Quantum random number generators (QRNGs) generate real random numbers based on the inherent randomness of quantum measurements. In practice, unfortunately, quantum randomness is inevitably mixed with classical randomness due to classical noise. Also, randomness is often correlated and biased. It is necessary to process the resulting raw bits sequence and convert them to good-quality output values that are as close to uniform distribution as possible. Random extractors are required for this. We analyze the randomness obtained by quantum random number generators as well as various examples of post-processing. We discuss the types of randomness extractors. Also, we use information-theoretically secure extractors and present improved novel randomness extraction.
Generating random bits is a difficult task, which is important for physical systems simulation, cryptography, and many applications that rely on high-quality random bits. Our contribution is to show how to generate provably random bits from uncertain events whose outcomes are routinely recorded in the form of massive data sets. These include scientific data sets, such as in astronomics, genomics, as well as data produced by individuals, such as internet search logs, sensor networks, and social network feeds. We view the generation of such data as the sampling process from a big source, which is a random variable of size at least a few gigabytes. Our view initiates the study of big sources in the randomness extraction literature. Previous approaches for big sources rely on statistical assumptions about the samples. We introduce a general method that provably extracts almost-uniform random bits from big sources and extensively validate it empirically on real data sets. The experimental findings indicate that our method is efficient enough to handle large enough sources, while previous extractor constructions are not efficient enough to be practical. Quality-wise, our method at least matches quantum randomness expanders and classical world empirical extractors as measured by standardized tests.
Random numbers (RNs) have applications in many areas: lottery games, gambling, computer simulation, and, most importantly, cryptography [N. Gisin et al., Rev. Mod. Phys. 74 (2002) 145]. In cryptography theory, the theoretical security of the system calls for high quality RNs. Therefore, developing methods for producing unpredictable RNs with adequate speed is an attractive topic. Early on, despite the lack of theoretical support, pseudo RNs generated by algorithmic methods performed well and satisfied reasonable statistical requirements. However, as implemented, those pseudorandom sequences were completely determined by mathematical formulas and initial seeds, which cannot introduce extra entropy or information. In these cases, “random” bits are generated that are not at all random. Physical random number generators (RNGs), which, in contrast to algorithmic methods, are based on unpredictable physical random phenomena, have attracted considerable research interest. However, the way that we extract random bits from those physical entropy sources has a large influence on the efficiency and performance of the system. In this manuscript, we will review and discuss several randomness extraction schemes that are based on radiation or photon arrival times. We analyze the robustness, post-processing requirements and, in particular, the extraction efficiency of those methods to aid in the construction of efficient, compact and robust physical RNG systems.
Quantum random number generation (QRNG) relies on the inherent unpredictability of quantum mechanical phenomena to efficiently generate high-quality random numbers that can be used in a wide range of cryptography and simulation applications. Here we report the experimental demonstration of QRNG from the arrival times of photons emitted by nitrogen vacancy (NV) centres in fluorescent nanodiamonds. The generation rates achieved range from 0.173 Mbits/s for a region with a single NV centre to 4.77 Mbits/s for a region with just under 50 NV centres, where the latter demonstrates an order of magnitude improvement compared to the highest generation rate previously achieved with NV centres. For all the regions investigated, the generated bits passed the ENT and NIST Statistical Test Suites without post-processing. The results are consistent with our theoretical analysis, where we show that the min-entropy is very close to the ideal value of one per bit for all the regions investigated. This work opens up new possibilities for robust QRNG in highly compact on-chip settings.