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

Russian Microelectronics

Investigation of the Effect of the Randomness Criterion on the Success of Passing NIST Tests by a Quantum Random Number Generator

D. A. Mavkov, Сибгатуллин Мансур Эмерович, L. R. Gilyazov, N. M. Arslanov

Published Dec 1, 2025• 0 citations
Publisher

Abstract

Abstract Random numbers generated on a quantum generator require postprocessing to eliminate hardware distortions. The quality of sequences is assessed by NIST tests, where the key parameter is the threshold value, exceeding which determines the randomness of the sequence. The paper examines the effect of the threshold value on the percentage of passing NIST statistical tests. Postprocessing is carried out by the method of lexicographic block numbering. It is found that increasing the threshold tightens the criterion for estimating the randomness of the sequence, shifting the optimal values of the size of the postprocessing block and the size of the evaluation window. It is shown that using a standard evaluation criterion may not be sufficient. By ensuring that tests pass for most sequences, a small evaluation criterion can mask weak correlations in quantum noise, leading to an overestimation of randomness and reducing reliability in cryptographic applications.

DOI
10.1134/s1063739725602012

Related papers

Optimization of optical random number generation and lexicographic postprocessing parameters based on the integral evaluation of NIST tests

Сибгатуллин Мансур Эмерович, L. R. Gilyazov, D. A. Mavkov +1 more

To determine the optimal parameters of generation and mathematical postprocessing based on the lexicographic numbering of the noise of an optical random number generator, an integral indicator is proposed that combines the normalized values of three metrics: the arithmetic mean and the median percentage of successful NIST tests, as well as the proportion of results exceeding a given threshold.

Известия Российской академии наук Серия физическая / Bulletin of the Russian Academy of Sciences Physics•Jan 1, 2025•0 citations

Optimization of the Parameters of Optical Random Number Generation and Lexicographic Postprocessing Based on the Integral Evaluation of NIST Tests

Сибгатуллин Мансур Эмерович, L. R. Gilyazov, D. A. Mavkov +1 more

Abstract To determine the optimal parameters of optical random number generation and mathematical postprocessing based on the lexicographic numbering of the noise of the optical random number generator, an integral indicator is proposed that combines the normalized values of three metrics: the arithmetic mean and the median percentage of successful NIST tests, as well as the proportion of results exceeding a given threshold.

Bulletin of the Russian Academy of Sciences Physics•Dec 1, 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

Empirical Validation of Quantum Randomness via NIST SP 800-22: A Scalable Experimental Framework

Seo Piljun

We present a scalable experimental framework for validating quantum-generated bitstreams using the NIST SP 800-22 statistical test suite. Quantum randomness was simulated using Qiskit’s aer_simulator, generating 10 independent sequences of 10,000,000 bits each. These bitstreams were evaluated across 15 statistical categories including Monobit, Block Frequency, FFT, Linear Complexity, and Excursion-based tests. All but one test passed the NIST-recommended thresholds for both pass rates and p-value distributions. Specifically, the Random Excursion (Standard) test narrowly missed the threshold with 52 out of 56 sequences passing. Despite this, the overall results confirm the high entropy and statistical randomness of the quantum-generated sequences. Our framework also incorporates a batch-based architecture that enforces streak continuity across sequence boundaries and uses SHA-256 hashing for integrity verification. This infrastructure supports reproducibility and lays the foundation for future exploration of probabilistic thresholds in ultra-large-scale quantum bitstreams. In particular, we plan to generate and analyze up to one trillion quantum bits to investigate whether there exists a natural limit to the length of repeated stochastic patterns (streaks) in true randomness.

•May 30, 2025•0 citations

IMPLEMENTATION AND EVALUATION OF A QUANTUM RANDOM NUMBER GENERATOR BASED ON ANU QRNG FOR CRYPTOGRAPHIC APPLICATION

Софія Парфило, Віталій Вікторович Коваль

Topicality. Reliable random number generation is one of the key requirements for modern cryptographic systems and cybersecurity applications. Traditional pseudo-random number generators are based on deterministic algorithms and may exhibit limited entropy and predictability, which can negatively affect information security. The subject of study in the article is methods of quantum random number generation and approaches to evaluating the quality of generated random sequences. The purpose of the article is to analyze modern methods of quantum random number generation, develop a software tool for obtaining quantum random numbers based on the ANU Quantum Random Number Generator service, perform statistical testing of the generated sequences, and analyze the obtained results. The following results were obtained. Modern quantum random number generation systems were analyzed and compared. A software tool was implemented in Python for automatic retrieval of quantum random numbers through the ANU QRNG API. The generated binary sequences were evaluated using Frequency Test and Block Frequency Test from the NIST SP 800-22 statistical test suite. The obtained p-values were 0.977181 and 0.200659 respectively, confirming successful completion of both tests. Additionally, visual analysis of the generated sequences revealed no noticeable patterns or repetitive structures. Conclusion. The obtained results confirm the high quality of quantum random sequences generated using ANU QRNG and demonstrate the applicability of the developed software tool for cryptographic and cybersecurity applications requiring high-quality randomness.

Terra security•Jul 4, 2026•0 citations

Studies on the Quality Assessment of PRNG for Q-Trits Quantum Cryptography Protocols

Sergiy O. Gnatyuk, Тетяна Охріменко, Andrii Fesenko +1 more

Cybersecurity contains three basic features such as confidentiality, integrity and availability. Data confidentiality ensuring by encryption has faced quantum computing threat, but this problem can be solved by using post-quantum cryptography and / or quantum cryptography (quantum key distribution). For cryptographic applications statistical properties of the generated pseudorandom sequences should not be differ from random sequences. To determine such properties a number of statistical testing methods are used, but they all are focused on the evaluation of binary sequences. In quantum cryptography there are some protocols with Q-trits (qutrits), but these sequences cannot be assessed effectively by binary statistic methods. From this position in the paper quality assessment approach for Q-trits pseudo random number generators and formed sequences was proposed. Also the experimental study of proposed approach (in comparison with NIST STS) was carried out. Given results show that NIST STS technique cannot be used to evaluate the quality of the Q-trit sequences and generators, but developed method is suitable to use in practice for evaluating Q-trit sequences (generators) quality.

International Scientific-Practical Conference Problems of Infocommunications Science and Technology•Oct 5, 2021•1 citation
Abstract Random numbers generated on a quantum generator require postprocessing to eliminate hardware distortions. The quality of sequences is assessed by NIST tests, where the key parameter is the threshold value, exceeding which determines the randomness of the sequence. The paper examines the effect of the threshold value on the percentage of passing NIST statistical tests. Postprocessing is carried out by the method of lexicographic block numbering. It is found that increasing the threshold tightens the criterion for estimating the randomness of the sequence, shifting the optimal values of the size of the postprocessing block and the size of the evaluation window. It is shown that using a standard evaluation criterion may not be sufficient. By ensuring that tests pass for most sequences, a small evaluation criterion can mask weak correlations in quantum noise, leading to an overestimation of randomness and reducing reliability in cryptographic applications.
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.
We present a scalable experimental framework for validating quantum-generated bitstreams using the NIST SP 800-22 statistical test suite. Quantum randomness was simulated using Qiskit’s aer_simulator, generating 10 independent sequences of 10,000,000 bits each. These bitstreams were evaluated across 15 statistical categories including Monobit, Block Frequency, FFT, Linear Complexity, and Excursion-based tests. All but one test passed the NIST-recommended thresholds for both pass rates and p-value distributions. Specifically, the Random Excursion (Standard) test narrowly missed the threshold with 52 out of 56 sequences passing. Despite this, the overall results confirm the high entropy and statistical randomness of the quantum-generated sequences. Our framework also incorporates a batch-based architecture that enforces streak continuity across sequence boundaries and uses SHA-256 hashing for integrity verification. This infrastructure supports reproducibility and lays the foundation for future exploration of probabilistic thresholds in ultra-large-scale quantum bitstreams. In particular, we plan to generate and analyze up to one trillion quantum bits to investigate whether there exists a natural limit to the length of repeated stochastic patterns (streaks) in true randomness.
Topicality. Reliable random number generation is one of the key requirements for modern cryptographic systems and cybersecurity applications. Traditional pseudo-random number generators are based on deterministic algorithms and may exhibit limited entropy and predictability, which can negatively affect information security. The subject of study in the article is methods of quantum random number generation and approaches to evaluating the quality of generated random sequences. The purpose of the article is to analyze modern methods of quantum random number generation, develop a software tool for obtaining quantum random numbers based on the ANU Quantum Random Number Generator service, perform statistical testing of the generated sequences, and analyze the obtained results. The following results were obtained. Modern quantum random number generation systems were analyzed and compared. A software tool was implemented in Python for automatic retrieval of quantum random numbers through the ANU QRNG API. The generated binary sequences were evaluated using Frequency Test and Block Frequency Test from the NIST SP 800-22 statistical test suite. The obtained p-values were 0.977181 and 0.200659 respectively, confirming successful completion of both tests. Additionally, visual analysis of the generated sequences revealed no noticeable patterns or repetitive structures. Conclusion. The obtained results confirm the high quality of quantum random sequences generated using ANU QRNG and demonstrate the applicability of the developed software tool for cryptographic and cybersecurity applications requiring high-quality randomness.
Cybersecurity contains three basic features such as confidentiality, integrity and availability. Data confidentiality ensuring by encryption has faced quantum computing threat, but this problem can be solved by using post-quantum cryptography and / or quantum cryptography (quantum key distribution). For cryptographic applications statistical properties of the generated pseudorandom sequences should not be differ from random sequences. To determine such properties a number of statistical testing methods are used, but they all are focused on the evaluation of binary sequences. In quantum cryptography there are some protocols with Q-trits (qutrits), but these sequences cannot be assessed effectively by binary statistic methods. From this position in the paper quality assessment approach for Q-trits pseudo random number generators and formed sequences was proposed. Also the experimental study of proposed approach (in comparison with NIST STS) was carried out. Given results show that NIST STS technique cannot be used to evaluate the quality of the Q-trit sequences and generators, but developed method is suitable to use in practice for evaluating Q-trit sequences (generators) quality.