Random number generators are imperfect due to manufacturing bias and technological imperfections. These imperfections are removed using post-processing algorithms that in general compress the data and do not work in every scenario. In this work, we present a universal whitening algorithm using n-qubit permutation matrices to remove the imperfections in commercial random number generators without compression. Specifically, we demonstrate the efficacy of our algorithm in several categories of random number generators and its comparison with cryptographic hash functions and block ciphers. We have achieved improvement in almost every randomness parameter evaluated using ENT randomness test suite. The modified random number files obtained after the application of our algorithm in the raw random data file pass the NIST SP 800-22 tests in both the cases: 1. The raw file does not pass all the tests. 2. The raw file also passes all the tests.
Random number generators are imperfect due to manufacturing bias and technological imperfections. These imperfections are removed using post-processing algorithms that in general compress the data and do not work in every scenario. In this work, we present a universal whitening algorithm using n-qubit permutation matrices to remove the imperfections in commercial random number generators without compression. Specifically, we demonstrate the efficacy of our algorithm in several categories of random number generators and its comparison with cryptographic hash functions and block ciphers. We have achieved improvement in almost every randomness parameter evaluated using ENT randomness test suite. The modified random number files obtained after the application of our algorithm in the raw random data file pass the NIST SP 800-22 tests in both the cases: 1. The raw file does not pass all the tests. 2. The raw file also passes all the tests.
Quantum Random Number Generators (QRNGs) have been theoretically proven to be able to generate completely unpredictable random sequences, and have important applications in many fields. However, the practical implementation of QRNG is always susceptible to the unwanted classical noise or device imperfections, which inevitably diminishes the quality of the generated random bits. It is necessary to perform the post-processing to extract the true quantum randomness contained in raw data generated by the entropy source of QRNG. In this work, a novel post-processing method for QRNG based on Zero-phase Component Analysis (ZCA) whitening is proposed and experimentally verified through both time and spectral domain analysis, which can effectively reduce auto-correlations and flatten the spectrum of the raw data, and enhance the random number generation rate of QRNG. Furthermore, the randomness extraction is performed after ZCA whitening, after which the final random bits can pass the NIST test.
Random numbers play a vital role in scientific simulations and cryptography. Both randomness and security are critical requirements for random number generators (RNGs). However, classical RNGs often rely on mathematical assumptions that can compromise security, while quantum RNGs (QRNGs) face challenges, including non-uniform output due to the lack of specialized single-photon sources. In this work, we propose a QRNG model that generates uniformly distributed random numbers using a standard coherent photon source, without requiring heavy attenuation or post-processing. Although the raw data is theoretically free of bias, post-processing, if any, may be required to suppress any classical noise and device imperfections. The proposed method analytically equalizes the output probabilities under the assumed photon-arrival-time model, potentially reducing the need for heavy attenuation and post-processing to correct binning bias. We evaluate the method using real photon-detection timestamps and compare its statistical performance with conventional uniform time binning using the NIST, Dieharder, and ENT test suites. The results demonstrate improved statistical performance for the proposed binning scheme under the tested conditions.
Abstract Quantum random number generators give the opportunity to, in theory, obtain completely unpredictable numbers only perturbed by the noise in the measurement. The obtained data can be digitalized and processed so that it gives as a result a uniform sequence of binary random numbers without any relation with the classical noise in the system. In this work we analyze the performance of optical QRNGs with three different arrangements: a homodyne detector measuring vacuum fluctuations, a homodyne detector measuring amplified spontaneous emission from an EDFA and a spontaneous emission phase noise-based generator. The raw data from the experiments is processed using a Toeplitz extractor, giving as a result sequences of binary numbers capable of passing the NIST Statistical Test Suite.
The reliability and security of telecommunication systems depend on the quality of random number generators (RNGs). Quantum Random Number Generators (QRNGs) enhance randomness over classical methods, improving cryptographic strength. This paper evaluates three QRNG implementations using IBM quantum computers, analyzing their methodologies, performance, and limitations. We introduce a new QRNG algorithm on the IBM Quantum Experience (IBMQ) platform, using real quantum computers instead of simulators, and incorporating post-processing with XOR bit masking. Our algorithm achieves entropy 0.86458 and passes more NIST 800-90B and NIST 800–22 randomness tests, demonstrating its effectiveness and reliability. This research supports secure telecommunication technologies by providing a reliable source of true randomness.
Random numbers are essential for cryptography and scientific simulation. Generating truly random numbers for cryptography can be a slow and expensive process. Quantum physics offers a variety of promising solutions to this challenge, proposing sources of entropy that may be genuinely unpredictable, based on the inherent randomness of certain physical phenomena. These properties have been employed to design Quantum Random Number Generators (QRNGs), some of which are commercially available. In this work, we present the first published analysis of the Quantis family of QRNGs (excluding AIS-31 models), designed and manufactured by ID Quantique (IDQ). Our study also includes Comscire’s PQ32MU QRNG, and two online services: the Australian National University’s (ANU) QRNG, and the Humboldt Physik generator. Each QRNG is analysed using five batteries of statistical tests: Dieharder, National Institute of Standards and Technology (NIST) SP800-22, Ent, Tuftests and TestU01, as part of our thorough examination of their output. Our analysis highlights issues with current certification schemes, which largely rely on NIST SP800-22 and Diehard tests of randomness. We find that more recent tests of randomness identify issues in the output of QRNG, highlighting the need for mandatory post-processing even for low-security usage of random numbers sourced from QRNGs.
Cryptographic random number generation is critical for any quantum-safe encryption. Based on the natural uncertainty of some quantum processes, a variety of quantum random number generators, or QRNGs, have been created with physical quantum processes. These typically generate random numbers with good unpredictable randomness. Of course, physical QRNGs are costic and require physical integrations with computing systems. This paper proposes a pseudo quantum random number generator with a quantum algorithm called a quantum permutation pad, or QPP, leveraging the high entropy of quantum permutation space for its bijective transformation. Unlike Boolean algebra, where the size of information space is 2nfor an n-bit system, an n-bit quantum permutation space consists of 2n! quantum permutation matrices, representing all quantum permutation gates over an n-bit computational basis. This permutation space holds an equivalent Shannon information entropy of log2(2n!). A QPP can be used to create a pseudo-QRNG or pQRNG capable of integration with any classical computing system, or directly with any application, for good-quality deterministic random number generation. Using a QPP pad with 64 8-bit permuation matrices, a pQRNG holds 107,776 bits of entropy for pseudo-random number generation, compared with 4,096 bits of entropy in Linux /dev/random. It can be used as a deterministic PRNG or as an entropy booster for other PRNGs. It can also be used as a whitening algorithm for any hardware random number generator, including QRNGs, without discarding physical bias bits.