Quantum random number generators (QRNGs) are an increasingly popular method to obtain information-theoretically provable random keys for cryptographic applications. Here, we experimentally demonstrate a probable prime generation protocol using a vacuum-based QRNG and compare its output with the one yielded by an electronic noise source. The quantum source significantly outperformed the classical scheme for lengths smaller than 128 bits, with increases of up to 837.1% in the number of unique primes being reported. By mapping the input noise to a uniform distribution, this figure was additionally increased by up to 844.3% and the output statistical distribution for small primes significantly improved.
Quantum random number generators (QRNGs) are an increasingly popular method to obtain information-theoretically provable random keys for cryptographic applications. Here, we experimentally demonstrate a probable prime generation protocol using a vacuum-based QRNG and compare its output with the one yielded by an electronic noise source. The quantum source significantly outperformed the classical scheme for lengths smaller than 128 bits, with increases of up to 837.1% in the number of unique primes being reported. By mapping the input noise to a uniform distribution, this figure was additionally increased by up to 844.3% and the output statistical distribution for small primes significantly improved.
Random prime numbers are an essential resource for many asymmetric cryptographic protocols. However, despite the emerging popularity of quantum random number generators (QRNGs) as sources of secure randomness, physical prime number generators have not yet been explored. In this work, we experimentally implement and characterize a vacuum-based probabilistic prime number generation scheme with an error probability of 3.5×10−15. By removing the quantum source (QS), an additional scheme based on electronic noise is derived, and a comparative analysis for increasing prime lengths is made. We observed that the QS significantly outperforms the classical scheme for small prime generation, where increases up to 585.0% in the diversity of unique primes obtained are seen. Moreover, we propose a length-agnostic statistical test for prime number sequences and apply it to the output of the uniformized randomness source, which was successful in revealing underlying biases in the output prime distributions. The resultant sequences were subsequently submitted to the NIST statistical test suite, where the quantum and classical sources passed, respectively, 86.96% and 45.34% of the total test set applied.
Random prime number generation is crucial for the implementation of several encryption and signature protocols in cryptographic applications. Recently, Quantum Random Number Generators (QRNGs) have emerged as a solution to obtain information-theoretically secure randomness, setting them apart from algorithmic generators. Nonetheless, their output is still prone to deterioration under a flawed implementation and thus requires continuous statistical validation. This process is uniquely challenging for prime number generators since they cannot be submitted to the traditional testing suites, which are primarily designed to test uniform pseudorandom sources. Here, we enable direct statistical testing of prime Random Number Generators (RNGs) by extending a validation framework based on an equiprobable binning of the prime distribution with a predictive machine learning model, which can independently learn correlations in the prime output. The validity of this framework is then verified through extensive cryptanalysis of a prime QRNG based on quadrature measurements of the vacuum state. The developed model successfully identifies flawed configurations of the prime QRNG for output lengths up to 128 bits. This assessment was additionally extended to a purely classical scheme derived from electronic noise measurements. Although no increase in the model’s predictive capacity is seen, our testing framework can nonetheless demonstrate that this classical source produces a conclusively biased prime distribution. In turn, the implemented QRNG remains resilient against this type of cryptanalysis.
Quantum random number generators represent one of the most promising techniques for producing truly and unique random numbers, essential in many applications such as quantum communication and cryptography protocols. In this work, we report an experimental implementation of vacuum-based quantum random number generator. By measuring the quantum fluctuations of the radiation ground state, a mixture of a perfectly Gaussian distributed random signal—originating from the intrinsic randomness in the quantum measurement— and an undesired classical electronic noise is obtained. Using an adequate post-processing, the undesired classical contribution of the electronic noise is removed to produce final, quasi-uniformly distributed random bit sequences. The high-quality character of the generated random bits is confirmed by applying the statistical tests of the NIST SP 800-22 test battery.
Quantum random number generators can provide genuine randomness by appealing to the fundamental principles of quantum mechanics.In general, a physical generator contains two parts-a randomness source and its readout.The source is essential to the quality of the resulting random numbers; hence, it needs to be carefully calibrated and modeled to achieve information-theoretical provable randomness.However, in practice, the source is a complicated physical system, such as a light source or an atomic ensemble, and any deviations in the real-life implementation from the theoretical model may affect the randomness of the output.To close this gap, we propose a source-independent scheme for quantum random number generation in which output randomness can be certified, even when the source is uncharacterized and untrusted.In our randomness analysis, we make no assumptions about the dimension of the source.For instance, multiphoton emissions are allowed in optical implementations.Our analysis takes into account the finite-key effect with the composable security definition.In the limit of large data size, the length of the input random seed is exponentially small compared to that of the output random bit.In addition, by modifying a quantum key distribution system, we experimentally demonstrate our scheme and achieve a randomness generation rate of over 5 × 10 3 bit=s.
Quantum random number generators (QRNGs) are currently in high demand across a large number of cryptographic applications as secure sources of true randomness. In this work, we characterize the conditions from which randomness can be extracted in a QRNG based on homodyne measurements of vacuum fluctuations by assessing the impact of experimental limitations, such as the digitizer resolution or the presence of excess local oscillator (LO) noise due to an unbalanced detection. Moreover, we propose an estimation method to quantify the excess entropy contribution introduced by an unbalanced detection and analyze the implementation of the post-processing algorithm. Finally, we submitted the generated numbers to a set of statistical tests to assess the quality of its output randomness and verified that it passes the standard libraries.
Quantum random number generators (QRNGs) utilize indeterministic quantum phenomena to produce true randomness, which is essential for cryptographic and scientific applications. Homodyne measurement of the vacuum state is a promising technique for generating quantum randomness. We present a QRNG based on this method and implement AIS 20/31-compliant health tests, applying them to the physical noise source during QRNG operation and to the post-processed random numbers offline. These tests provide stricter oversight compared to the noise source health tests specified in NIST SP 800-90B, which can only be applied to unbiased and statistically independent random numbers. Our implementation includes a conservative security analysis that considers quantum and classical side information, measurement correlations, and digitization imperfections, resulting in a reliable min-entropy of 9.5 bits. Following extensive evaluation, we demonstrate a real-time random number generation rate of 8,84 Gbit/s after algorithmic postprocessing and 4.14 Gbit/s after cryptographic postprocessing , confirming the practical viability of this high-speed quantum randomness generation approach.