Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2108.04331 · Physica Scripta

Generation of 1 GB full entropy random numbers with the enhanced-NRBG method

Deepika Aggarwal, Karthick Balaji R, Rohit Ghatikar, Sruthi Chennuri, Anindita Banerjee

Published Oct 30, 2023• 6 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1088/1402-4896/ad0811

Related papers

A High-Randomness and High-Stability Electronic Quantum Random Number Generator without Post Processing

Yu-Xuan Liu, Ke-Xin Huang, Yuming Bai +2 more

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.

Chinese Physics Letters•Jun 1, 2023•8 citations

A Novel Hybrid Method for Randomness Extraction

Maksim Iavich, Роман Сергійович Одарченко

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.

CRC Press eBooks•May 30, 2025•0 citations

Quantum generators of random numbers

Marcin M. Jacak, Piotr Paweł Jóźwiak, Jakub Niemczuk +1 more

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.

Scientific Reports•Aug 9, 2021•93 citations

Analysis of entropy extraction efficiencies in random number generation systems

Chao Wang, Shuang Wang, Wei Chen +2 more

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.

International Journal of Quantum Information•Feb 1, 2016•0 citations

True Randomness from Big Data

Periklis A. Papakonstantinou, David Paul Woodruff, Guang Yang

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.

Scientific Reports•Sep 26, 2016•7 citations

Enhancing Extractable Quantum Entropy in Vacuum-Based Quantum Random Number Generator

Xiaomin Guo, Ripeng Liu, Pu Li +3 more

Information-theoretically provable unique true random numbers, which cannot be correlated or controlled by an attacker, can be generated based on quantum measurement of vacuum state and universal-hashing randomness extraction. Quantum entropy in the measurements decides the quality and security of the random number generator (RNG). At the same time, it directly determines the extraction ratio of true randomness from the raw data, in other words, it obviously affects quantum random bits generating rate. In this work, we commit to enhancing quantum entropy content in the vacuum noise based quantum RNG. We have taken into account main factors in this proposal to establish the theoretical model of quantum entropy content, including the effects of classical noise, the optimum dynamical analog-digital convertor (ADC) range, the local gain and the electronic gain of the homodyne system. We demonstrate that by amplifying the vacuum quantum noise, abundant quantum entropy is extractable in the step of post-processing even classical noise excursion, which may be deliberately induced by an eavesdropper, is large. Based on the discussion and the fact that the bandwidth of quantum vacuum noise is infinite, we propose large dynamical range and moderate TIA gain to pursue higher local oscillator (LO) amplification of vacuum quadrature and broader detection bandwidth in homodyne system. High true randomness extraction ratio together with high sampling rate is attainable. Experimentally, an extraction ratio of true randomness of 85.3% is achieved by finite enhancement of the laser power of the LO when classical noise excursions of the raw data is obvious.

arXiv:1805.10506•Entropy•Oct 24, 2018•30 citations
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.
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.
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.
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.
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.
Information-theoretically provable unique true random numbers, which cannot be correlated or controlled by an attacker, can be generated based on quantum measurement of vacuum state and universal-hashing randomness extraction. Quantum entropy in the measurements decides the quality and security of the random number generator (RNG). At the same time, it directly determines the extraction ratio of true randomness from the raw data, in other words, it obviously affects quantum random bits generating rate. In this work, we commit to enhancing quantum entropy content in the vacuum noise based quantum RNG. We have taken into account main factors in this proposal to establish the theoretical model of quantum entropy content, including the effects of classical noise, the optimum dynamical analog-digital convertor (ADC) range, the local gain and the electronic gain of the homodyne system. We demonstrate that by amplifying the vacuum quantum noise, abundant quantum entropy is extractable in the step of post-processing even classical noise excursion, which may be deliberately induced by an eavesdropper, is large. Based on the discussion and the fact that the bandwidth of quantum vacuum noise is infinite, we propose large dynamical range and moderate TIA gain to pursue higher local oscillator (LO) amplification of vacuum quadrature and broader detection bandwidth in homodyne system. High true randomness extraction ratio together with high sampling rate is attainable. Experimentally, an extraction ratio of true randomness of 85.3% is achieved by finite enhancement of the laser power of the LO when classical noise excursions of the raw data is obvious.