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

Procedia Technology

Real Time Random Number GeneratorTesting

João Dionísio, Tiago Mota, Iola Pinto, M. Niehus

Published Jan 1, 2014• 3 citations
Publisher

Abstract

We present a random number generator (RNG) testing application in LabVIEW®, based on six of the statistical tests from the ubiquitous NIST test suite that is widely used in the field of cryptography. The implementation is described, and tests measuring performance, both regarding precision and speed, are demonstrated. The application can be interfaced to real time true RNGs based on quantum optics experiments.

DOI
10.1016/j.protcy.2014.10.207

Related papers

A Photonic-based Random Number Generator for Cryptographic Application

Norashikin Mohd Thamrin, Gunawan Witjaksono, A. Nuruddin +1 more

In this paper, we design a photonic-based true random number generator (True RNG) which is targeted for cryptographic application .Since all security protocols rely on unpredictability, RNGs for crypto applications must meet stringent requirements. The design employs a single-photon detection to generate a random signal which is useful in producing random output. In contrast with traditionally used of frequency sampler circuitry during bit extraction method, it uses a novel method of randomness extraction based on time interval between two successive random signals. The design comprises an optical setup and extremely compact and digitally random bit extraction circuitry which can be implemented on any advance crypto hardware devices. A NIST statistical test is used to test the randomness of the RNG output and has produced a good result. With the help of this True RNG, the cryptographic implementations can be secure enough from being abused of malicious act.

ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)•Jan 1, 2008•11 citations

Statistical Testing of Random Number Generators and Their Improvement Using Randomness Extraction

Cameron Foreman, Richie Wai Kit Yeung, Florian J. Curchod

Random number generators (RNGs) are notoriously challenging to build and test, especially for cryptographic applications. While statistical tests cannot definitively guarantee an RNG's output quality, they are a powerful verification tool and the only universally applicable testing method. In this work, we design, implement, and present various post-processing methods, using randomness extractors, to improve the RNG output quality and compare them through statistical testing. We begin by performing intensive tests on three RNGs-the 32-bit linear feedback shift register (LFSR), Intel's 'RDSEED,' and IDQuantique's 'Quantis'-and compare their performance. Next, we apply the different post-processing methods to each RNG and conduct further intensive testing on the processed output. To facilitate this, we introduce a comprehensive statistical testing environment, based on existing test suites, that can be parametrised for lightweight (fast) to intensive testing.

arXiv:2403.18716•Entropy•Dec 4, 2024•22 citations

Long-Term Test of a Fast and Compact Quantum Random Number Generator

Davide Giacomo Marangon, Alan Plews, Marco Lucamarini +4 more

Random numbers are an essential resource to many applications, including cryptography and Monte Carlo simulations. Quantum random number generators (QRNGs) represent the ultimate source of randomness, as the numbers are obtained by sampling a physical quantum process that is intrinsically probabilistic. However, they are yet to be widely employed to replace deterministic pseudo random number generators (PRNG) for practical applications. QRNGs are regarded as interesting devices. However, they are slower than PRNGs for simulations and are typically seen as clumsy laboratory prototypes, prone to failures, and unreliable for cryptographic applications. Here, we overcome these limitations and demonstrate a compact and self-contained QRNG capable of generating random numbers at a pace of 8 Gbit/s uninterruptedly for 71 days. During this period, the physical parameters of the quantum process were monitored in real time by self-checking functions implemented in the generator itself. At the same time, the output random numbers were analyzed with the most stringent suites of statistical tests. The analysis shows that the QRNG under test sustained the continuous operation without physical instabilities or hardware failures. At the same time, the output random numbers were analyzed with the most stringent suites of statistical tests, which were passed during the whole operation time. This extensive trial demonstrates the reliability of a robustly designed QRNG and paves the way to its use in practical applications based on randomness.

arXiv:1807.03989•Journal of Lightwave Technology•May 30, 2018•42 citations

True randomness from realistic quantum devices

Daniela Frauchiger, Renato Renner, Matthias Troyer

Even if the output of a Random Number Generator (RNG) is perfectly uniformly distributed, it may be correlated to pre-existing information and therefore be predictable. Statistical tests are thus not sufficient to guarantee that an RNG is usable for applications, e.g., in cryptography or gambling, where unpredictability is important. To enable such applications a stronger notion of randomness, termed "true randomness", is required, which includes independence from prior information. Quantum systems are particularly suitable for true randomness generation, as their unpredictability can be proved based on physical principles. Practical implementations of Quantum RNGs (QRNGs) are however always subject to noise, i.e., influences which are not fully controlled. This reduces the quality of the raw randomness generated by the device, making it necessary to post-process it. Here we provide a framework to analyse realistic QRNGs and to determine the post-processing that is necessary to turn their raw output into true randomness.

arXiv:1311.4547•Nov 18, 2013•46 citations

Cryptographic Standards for Random Number Generation

Leonardo Errati, Roberto La Scala, Mauro Patano

Random number generators (RNGs) are an often overlooked cornerstone for secure communications, cryptographic protocols, and scientific simulations. This workshop opens with an overview of the NIST framework for RNGs - from entropy sources to filters and test suites. An important conclusion is that the construction of secure, standardised Quantum RNGs is a multidisciplinary effort; this will be exemplified by an ongoing integration project for distributed IT infrastructures

•Jan 1, 2025•0 citations

Quantum random number generators and their use in cryptography

Mario Stipčević

Random number generators (RNG) are an important resource in many areas: cryptography (both quantum and classical), probabilistic computation (Monte Carlo methods), numerical simulations, industrial testing and labeling, hazard games, scientific research, etc. Because today's computers are deterministic, they can not create random numbers unless complemented with a RNG. Randomness of a RNG can be precisely, scientifically characterized and measured. Especially valuable is the information-theoretic provable RNG (True RNG - TRNG) which, at state of the art, seem to be possible only by use of physical randomness inherent to certain (simple) quantum systems. On the other hand, current industry standard dictates use of RNG's based on free running oscillators (FRO) whose randomness is derived from electronics noise present in logic circuits and which cannot be strictly proven. This approach is currently used in 3-rd and 4-th generation FPGA and ASIC hardware, unsuitable for realization of quantum TRNG. We compare weak and strong aspects of the two approaches and discuss possibility of building quantum TRNG in the recently appeared Mixed Signal FPGA technology. Finally, we discuss several examples where use of a TRNG is critical and show how it can significantly improve security of cryptographic systems.

arXiv:1103.4381•International Convention on Information and Communication Technology, Electronics and Microelectronics•Mar 22, 2011•18 citations
We present a random number generator (RNG) testing application in LabVIEW®, based on six of the statistical tests from the ubiquitous NIST test suite that is widely used in the field of cryptography. The implementation is described, and tests measuring performance, both regarding precision and speed, are demonstrated. The application can be interfaced to real time true RNGs based on quantum optics experiments.
In this paper, we design a photonic-based true random number generator (True RNG) which is targeted for cryptographic application .Since all security protocols rely on unpredictability, RNGs for crypto applications must meet stringent requirements. The design employs a single-photon detection to generate a random signal which is useful in producing random output. In contrast with traditionally used of frequency sampler circuitry during bit extraction method, it uses a novel method of randomness extraction based on time interval between two successive random signals. The design comprises an optical setup and extremely compact and digitally random bit extraction circuitry which can be implemented on any advance crypto hardware devices. A NIST statistical test is used to test the randomness of the RNG output and has produced a good result. With the help of this True RNG, the cryptographic implementations can be secure enough from being abused of malicious act.
Random number generators (RNGs) are notoriously challenging to build and test, especially for cryptographic applications. While statistical tests cannot definitively guarantee an RNG's output quality, they are a powerful verification tool and the only universally applicable testing method. In this work, we design, implement, and present various post-processing methods, using randomness extractors, to improve the RNG output quality and compare them through statistical testing. We begin by performing intensive tests on three RNGs-the 32-bit linear feedback shift register (LFSR), Intel's 'RDSEED,' and IDQuantique's 'Quantis'-and compare their performance. Next, we apply the different post-processing methods to each RNG and conduct further intensive testing on the processed output. To facilitate this, we introduce a comprehensive statistical testing environment, based on existing test suites, that can be parametrised for lightweight (fast) to intensive testing.
Random numbers are an essential resource to many applications, including cryptography and Monte Carlo simulations. Quantum random number generators (QRNGs) represent the ultimate source of randomness, as the numbers are obtained by sampling a physical quantum process that is intrinsically probabilistic. However, they are yet to be widely employed to replace deterministic pseudo random number generators (PRNG) for practical applications. QRNGs are regarded as interesting devices. However, they are slower than PRNGs for simulations and are typically seen as clumsy laboratory prototypes, prone to failures, and unreliable for cryptographic applications. Here, we overcome these limitations and demonstrate a compact and self-contained QRNG capable of generating random numbers at a pace of 8 Gbit/s uninterruptedly for 71 days. During this period, the physical parameters of the quantum process were monitored in real time by self-checking functions implemented in the generator itself. At the same time, the output random numbers were analyzed with the most stringent suites of statistical tests. The analysis shows that the QRNG under test sustained the continuous operation without physical instabilities or hardware failures. At the same time, the output random numbers were analyzed with the most stringent suites of statistical tests, which were passed during the whole operation time. This extensive trial demonstrates the reliability of a robustly designed QRNG and paves the way to its use in practical applications based on randomness.
Even if the output of a Random Number Generator (RNG) is perfectly uniformly distributed, it may be correlated to pre-existing information and therefore be predictable. Statistical tests are thus not sufficient to guarantee that an RNG is usable for applications, e.g., in cryptography or gambling, where unpredictability is important. To enable such applications a stronger notion of randomness, termed "true randomness", is required, which includes independence from prior information. Quantum systems are particularly suitable for true randomness generation, as their unpredictability can be proved based on physical principles. Practical implementations of Quantum RNGs (QRNGs) are however always subject to noise, i.e., influences which are not fully controlled. This reduces the quality of the raw randomness generated by the device, making it necessary to post-process it. Here we provide a framework to analyse realistic QRNGs and to determine the post-processing that is necessary to turn their raw output into true randomness.
Random number generators (RNG) are an important resource in many areas: cryptography (both quantum and classical), probabilistic computation (Monte Carlo methods), numerical simulations, industrial testing and labeling, hazard games, scientific research, etc. Because today's computers are deterministic, they can not create random numbers unless complemented with a RNG. Randomness of a RNG can be precisely, scientifically characterized and measured. Especially valuable is the information-theoretic provable RNG (True RNG - TRNG) which, at state of the art, seem to be possible only by use of physical randomness inherent to certain (simple) quantum systems. On the other hand, current industry standard dictates use of RNG's based on free running oscillators (FRO) whose randomness is derived from electronics noise present in logic circuits and which cannot be strictly proven. This approach is currently used in 3-rd and 4-th generation FPGA and ASIC hardware, unsuitable for realization of quantum TRNG. We compare weak and strong aspects of the two approaches and discuss possibility of building quantum TRNG in the recently appeared Mixed Signal FPGA technology. Finally, we discuss several examples where use of a TRNG is critical and show how it can significantly improve security of cryptographic systems.