On Statistical Tests for Randomness Included in the NIST SP800-22 Test Suite and Based on the Binomial Distribution
Open accessThe DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index; 2 of the 16 sources its claims cite were checked for support.
Abstract
In this paper we review some statistical tests included in the NIST SP 800-22 suite, which is a collection of tests for the evaluation of both true-random (physical) and pseudorandom (algorithmic) number generators for cryptographic applications. The output of these tests is the so-called$p$-value which is a random variable whose distribution converges to the uniform distribution in the interval [0,1] when testing an increasing number of samples from an ideal generator. Here, we compute the exact non-asymptotic distribution of$p$-values produced by few of the tests in the suite, and propose some computation-friendly approximations. This allows us to explain why intensive testing produces false-positives with a probability much higher than the expected one when considering asymptotic distribution instead of the true one. We also propose a new approximation for the Spectral Test reference distribution, which is more coherent with experimental results.
Overview
CoChat Summary
## TL;DR
The paper analyzes how the p-values in three NIST SP800-22 randomness tests are actually distributed under an ideal generator, showing they are discrete and often deviate from the uniform assumption used in standard interpretations. It derives feasible approximations for the Frequency, Runs, and Spectral tests and uses them to explain and reduce false positives, especially in two-level testing.
## Key findings
- For the Frequency test and Runs test, the paper derives approximations to the exact p-value CDFs and reports that the theoretical densities match the experimental ones well for BBS and Mersenne Twister simulations.
- For the Spectral test, the paper finds that NIST’s reference variance for the distribution of \(N_1\) is better fit by \(\sigma^2 = 0.95 \cdot 0.05 \cdot n / 3.8\) rather than \(0.95 \cdot 0.05 \cdot n / 4\).
- Using the refined Spectral-test variance, the reported standard-approach significance is \(1.01258 \cdot 10^{-2}\) for \(n=10^6\) and \(0.99742 \cdot 10^{-2}\) for \(n=2^{20}\); with the NIST variance, the corresponding values are \(1.01258 \cdot 10^{-2}\) and \(0.99742 \cdot 10^{-2}\)? Not stated in the paper.
- For reliability of two-level tests, the paper gives concrete bounds such as \(N < 4798\) and \(N < 36448\) for the Frequency test under specific error requirements, \(N < 5975\) and \(N < 17524\) for a chi-square-based two-level test, and \(N < 102\) and \(N < 685\) for a Kolmogorov-Smirnov-based two-level test.
## Methods
- The paper is a mathematical/review study of three NIST SP800-22 tests: Frequency, Runs, and Spectral, all treated as binomial-based tests on bit sequences.
- It derives exact or approximated p-value distributions under the null hypothesis, then compares those distributions to simulations from BBS and Mersenne Twister generators; Table I and Table II report numerical results for two-level testing.
- It analyzes standard one-level testing, NIST-style two-level testing (fraction passing and chi-square goodness-of-fit), and an additional Kolmogorov-Smirnov-based two-level approach.
## Limitations
- The paper states that the standard approach’s exact power cannot be computed in a general way because it depends on the specific non-ideal generator under test.
- The Kolmogorov-Smirnov-based two-level analysis requires “strong hypotheses and approximations” to build a theoretical framework. This is stated in the paper.
- Evident from the text: much of the derivation is asymptotic or approximation-based, and several formulas are presented as approximations rather than exact closed forms.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Figures


![Fig. 3 (a) Comparison between the theoretical probability density function (PDF) of N 1 according to [2], [14], [15] and the experimental one observed in N = 10 6 sequences generated with the BBS algorithm and with n = 2 20 bits . (b) Normalized L 2 distances between the observed PDF of N 1 in the Spectral Test and a normal PDF with σ 2 = 0 . 95 · 0 . 05 · n/c , with c ranging from 3 . 5 to 4 , and with n = 2 20 bits , n = 100 · 2 10 bits and n = 10 · 2 10 bits . In all cases, the minimum distance is achieved for c ≃ 3 . 8 .](https://figures.cochat.ai/paper-figures/d18283f6df3b468ca7ff71b1a4cd6f35/on-statistical-tests-for-randomness-included-in-the-nist-sp800-22-test-suite-and-figure-3.png)
![Fig. 4 Comparison between the uniform density, the theoretically expected one and the observed experimental ones achieved with the BBS and the Mersenne-Twister algorithms, all discretized in k = 16 bins, for the p -values in the Spectral Test, with n = 2 20 , for the cases (a) the variance is computed as σ 2 = 0 . 95 · 0 . 05 · n/ 4 . 0 as indicated by the NIST document [2]; (b) the variance is computed as σ 2 = 0 . 95 · 0 . 05 · n/ 3 . 8 . Note that the experimental densities in (a) and (b) are different since the p -values are computed with two different functions. The matching in the case (b) is almost perfect.](https://figures.cochat.ai/paper-figures/03bad8cc159740a488ec80acdf721bd6/on-statistical-tests-for-randomness-included-in-the-nist-sp800-22-test-suite-and-figure-4.png)

![Fig. 6 Comparison between the average observed value of D N -E[ D N 0 ] in a two-level Frequency Test for different values of N , with n = 2 20 (solid line), n = 100 · 2 10 (dashed line), n = 10 · 2 10 (dotted-dashed line), along with the approximated theoretically expected values (dotted horizontal lines).](https://figures.cochat.ai/paper-figures/9b1f74e5cf3b4a6798563ae05a688fe1/on-statistical-tests-for-randomness-included-in-the-nist-sp800-22-test-suite-and-figure-6.png)







Verification
Claims the paper makes
1 Valid · 2 Not valid · 8 Not checked · 73 Own results and interpretations
At least one cited source doesn’t support this claim or points to a different paper, and none confirmed it — see the verdicts below.
In the paper
“The reference distribution for N 1 indicated by NIST in [2] is a normal distribution with µ = N 0 = 0 . 95 · n/ 2 and σ 2 = 0 . 95 · 0 . 05 · n/ 4 . This has been experimentally found independently by many authors [14], [15].”
What the sources say
- Not matchedcites [2]
The reference list we hold has no entry [2].
- Disputedcites [14] matched to “Corrections of the NIST Statistical Test Suite for Randomness” (2004) sourceExperimental — accuracy not yet measured
Section 3.2 (p. 10) says NIST's theoretical distribution uses mean 0.95·n/2 but variance 0.95·0.05·n/2. The paper argues that dependence between peaks requires the corrected variance 0.95·0.05·n/4; it does not identify that corrected variance as NIST's reference value. (LLM, conf=0.90)
Checked by a reasoning model — may be wrong.
- Not checked — no full text of the sourcecites [15] matched to “The Distribution of the Spectrum for the Discrete Fourier Transform Test Included in SP800-22” (2005) source
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
- Not matched
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“However, the actual p -values distribution F p depends on u .”
plainstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We also propose a new approximation for the Spectral Test reference distribution, which is more coherent with experimental results.”
plainstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Assuming the two symbols have the same probability, S n is a zero average random variable which can be approximated, for large values of n , with a normal distribution with variance σ 2 = n .”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Rests on an assumption not shown here.
A result the paper states — it cites no source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Proposition 1: In a generic binomial test, where the limit distribution of T is normal with mean value µ and variance σ 2 (a) the limit CDF F ∞ ∥·∥ is given by”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
- Rests on an assumption not shown here.
41 more claims
Create a free account to see all 84 claims and every source verdict.
- It may state two separate claims as one. 26
- Probably not a substantial claim. 13
- The quote only partly states this claim. 1
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“In this case, computational errors accumulate at each level and two-level tests detect the Lack-Of-Fit of that approximation, leading to rejection even if the generator is good [7, 10, 13, 17].”
From Checking the quality of approximation of p-values in statistical tests for random number generators by using a three-level test (2019) · cites this paper as [17]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“Subsequently, Pareschi et al. [17] proposed d = 3 . 8 for n ≈ 10 6 , which we use here as modification.”
From Checking the quality of approximation of p-values in statistical tests for random number generators by using a three-level test (2019) · cites this paper as [17]
Citations
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,319
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
The Art of Computer Programming
Whitesides, G. E. (1970) · Nuclear Science and Engineering · doi:10.13182/nse70-a19705 · Cited by 6,008
Mathematical Methods of Statistics.
Geary, R. C., & Cramer, H. (1947) · The Economic Journal · doi:10.2307/2226151 · Cited by 5,927
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
Matsumoto, M., & Nishimura, T. (1998) · ACM Transactions on Modeling and Computer Simulation · doi:10.1145/272991.272995 · Cited by 5,780
Simulation modeling and analysis
(1999) · Journal of Manufacturing Systems · doi:10.1016/s0278-6125(99)90119-x · Cited by 3,833
Bassham, L. E., Rukhin, A. L., Soto, J., Nechvatal, J. R., Smid, M. E., Barker, E. B., Leigh, S. D., Levenson, M., Vangel, M., Banks, D. L., et al. (2010) · NIST Special Publication 800-22 Revision 1a · doi:10.6028/nist.sp.800-22r1a · Cited by 3,617
A Simple Unpredictable Pseudo-Random Number Generator
Blum, L., Blum, M., & Shub, M. (1986) · SIAM Journal on Computing · doi:10.1137/0215025 · Cited by 1,036
TestU01: A C library for empirical testing of random number generators
L'Ecuyer, P., & Simard, R. (2007) · ACM Transactions on Mathematical Software · doi:10.1145/1268776.1268777 · Cited by 1,014 · cited 7×
“This also makes these tests suitable for both true-random generators (based on some physical phenomenon that is intrinsically random) and pseudorandom generators (based on a recursive algorithm on a fi nite state machine).”
BackgroundMethodInfluentialShiryaev, A. N. (1996) · Graduate texts in mathematics · doi:10.1007/978-1-4757-2539-1 · Cited by 834
Research works printed but not linked: 4
- "Random Numbers Generation using Quantum Physics," White Paper, idQuantique, 2004. [Online]. Available: http://www.idquantique.com/ products/files/quantis-whitepaper.pdf
- Gianluca Setti (S'89-M'91-SM'02-F'06) received the Dr.Eng. degree (with honors) in electronic en- gineering and the Ph.D. degree in electronic engi- neering and computer science from the University of Bologna, Italy, in 1992 and 1997, respectively, for his contribution to the study of neural networks and chaotic systems. From May 1994 to July 1995, he was with the Laboratory of Nonlinear Systems (LANOS) of the Swiss Federal Institute of Tech- nology in Lausanne (EPFL) as Visiting Researcher. Since 1997 he has been with the School of Engi- neering at the University of Ferrara, Italy, where he is currently a Professor of Circuit Theory and Analog Electronics. He held several visiting position at Visiting Professor/Scientist at EPFL (2002, 2005), UCSD (2004), IBM T. J. Watson Laboratories (2004, 2007) and at the University of Washington in Seattle (2008), and is also a permanent faculty member of ARCES, University of Bologna. He is co-editor of the book Chaotic Electronics in Telecommunications (CRC Press, Boca Raton, 2000) and Circuits and Systems for Future Generation of Wireless Communications (Springer, 2009) as well as one of the guest editors of the May 2002 special issue of the PROCEEDINGS OF THE IEEE on Applications of Non-linear Dynamics to Electronic and Information Engineering. His research interests include nonlinear circuits, recurrent neural networks, implementation and application of chaotic circuits and systems, statistical signal processing, electromagnetic compatibility, wireless communications, and sensor networks. Dr. Setti received the 1998 Caianiello prize for the best Italian Ph.D. thesis on Neural Networks and he is corecipient of the 2004 IEEE CAS Society Darlington Award, as well as of the best paper award at ECCTD 2005 and the best student paper award at EMCZurich 2005 and ISCAS 2011. He served as an Associate Editor for the IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS-PART I (1999-2002 and 2002-2004) and for the IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS-PART II (2004-2007), as the Deputy-Editor-in-Chief, for the IEEE Circuits and Systems Magazine (2004-2007) and as the Editor-in-Chief for the IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS-PART II (2006-2007) and for the IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS-PART I (2008-2009). He was the 2004 Chair of the Technical Committee on Nonlinear Circuits and Systems of the of the IEEE CAS Society, a Distinguished Lecturer (2004- 2005), a member of the Board of Governors (2005-2008), and President (2010) of the same society. He was also the Technical Program Co-Chair of NDES2000 (Catania) the Track Chair for Nonlinear Circuits and Systems of ISCAS 2004 (Vancouver), the Special Sessions Co-Chair of ISCAS 2005 (Kobe) and ISCAS 2006 (Kos), the Technical Program Cochair of ISCAS2007 (New Orleans), and ISCAS 2008 (Seattle), as well as the General Co-Chair of NOLTA 2006 (Bologna).
- W. Killmann and W. Schindler, AIS 31: Functionality Classes and Eval- uation Methodology for True (Physical) Random Number Generators, Bundesamt fur Sicherheit in der Informationstechnik (BSI) version 3.1, Sep. 2001.
- W. Schindler, AIS 20: Functionality Classes and Evaluation Method- ology for Deterministic Random Number Generators, Bundesamt fur Sicherheit in der Informationstechnik (BSI) version 2.0, Dec. 1999.
Cited by
Items 101–192 of 192
Mo, L., Wang, A., Sun, Y., Xu, J., Zhang, Y., Zhang, X., Qin, Y., & Wang, Y. (2023) · Optics Express · doi:10.1364/oe.506211 · Cited by 6
Design of 24-by-24-replacement-matrix: a functionality to astronomical visual
Shah, T., & Haq, T. U. (2022) · Multimedia Tools and Applications · doi:10.1007/s11042-021-11682-6 · Cited by 6
“For the purpose of obtaining these requirements, we have used NIST SP 800–22 [8] to assess the haphazardness of digital images.”
MethodParrilla, L., García, A., Castillo, E., López-Villanueva, J. A., & Meyer-Baese, U. H. (2023) · Cryptography · doi:10.3390/cryptography7020026 · Cited by 6
“In order to validate our results, we have generated a set of bitstreams and have analyzed the statistical properties for their use in cryptography by means of the SP 800-22 suite [28], developed by the National Institute for Standardization (NIST).”
MethodStudy on upper limit of sample size for a two-level test in NIST SP800-22
Haramoto, H. (2021) · Japan Journal of Industrial and Applied Mathematics · doi:10.1007/s13160-020-00434-y · Cited by 5
“efects of the DFT test. Indeed, NIST 12 Hiroshi Haramoto corrected the approximation of the variance to a better value ˙2 1 = 0:050:95n=4 proposed by Kim et al. [5] from ˙2 0 . Later, Pareschi et al. [15] found a further good approximation value ˙2 2 = 0:050:95n=3:8. According to [3], we use ˙2 2 for variance in the f…”
BackgroundMethodA novel chaotification method for discrete memristors
Wang, H., Zhu, H., Li, B., Sun, K., & Liu, W. (2024) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-024-05643-9 · Cited by 5
Nabil, H., & Tayeb, H. (2025) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2025.117105 · Cited by 6
Yogi, B., & Khan, A. K. (2026) · Security and Privacy · doi:10.1002/spy2.70198 · Cited by 11
“The study evaluates the randomness of binary sequences generated during the encryption process using the NIST statistical test suite [50].”
Enhancing Visual Data Security: A Novel FSM-Based Image Encryption and Decryption Methodology
Shakhmetova, G., Barlybayev, A., Saukhanova, Z., Sharipbay, A., Raykul, S., & Khassenov, A. (2024) · Applied Sciences · doi:10.3390/app14114341 · Cited by 11
A counter mode and multi-channel based chaotic image encryption algorithm for the internet of things
Ge, B., Qu, G., Shen, Z., & Lin, J. (2024) · Frontiers in Physics · doi:10.3389/fphy.2024.1494056 · Cited by 6
A Virtual Optical Holographic Encryption System Using Expanded Diffie-Hellman Algorithm
Yang, P., Nagase, T., Kanamoto, T., Zeniya, T., & You, S. (2021) · IEEE Access · doi:10.1109/access.2021.3055866 · Cited by 5
“To evaluate the randomness of the ST, the ST is analyzed using the NIST test suite method [26].”
MethodPhysical publicly verifiable randomness from pulsars
Dawson, J. R., Hobbs, G. B., Gao, Y., Camtepe, S. A., Pieprzyk, J., Feng, Y., Tranfa, L., Bradbury, S., Zhu, W., & Li, D. (2022) · Astronomy and Computing · doi:10.1016/j.ascom.2022.100549 · Cited by 6
“The reason for this is unclear, but we note that the standard NIST implementation of this test has been shown to produce erroneously low P-valueT for known good RNGs, particularly in the case of long sequences (e.g. Kim et al., 2004; Pareschi et al., 2012).”
BackgroundNabil, H., & Tayeb, H. (2025) · Computational and Applied Mathematics · doi:10.1007/s40314-025-03562-8 · Cited by 4
Exploring LSTM-assisted A2C For Physical Layer Security in Vehicular Cyber-Physical Systems
Kurunathan, H., Li, K., Ni, W., Li, N., Tovar, E., & Guizani, M. (2024) · International Wireless Communications and Mobile Computing Conference (IWCMC) · doi:10.1109/iwcmc61514.2024.10592471 · Cited by 6
“We employed the NIST standard randomness test suite [25] to validate the randomness of the keys generated through the DRL algorithm.”
MethodImage encryption algorithm based on V-shaped scanning and matrix multiplication
Sun, J., Zhang, X., & Chen, C. (2025) · Physica Scripta · doi:10.1088/1402-4896/adb103 · Cited by 6
Shah, T., & Haq, T. U. (2023) · Journal of Supercomputing · doi:10.1007/s11227-023-05512-9 · Cited by 5
Dash, P., Sarma, M., & Samanta, D. (2024) · Security and Privacy · doi:10.1002/spy2.375 · Cited by 4
Zhao, S., Chuah, J. H., Khairuddin, A. S. M., & Chen, C. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad92e7 · Cited by 4
Savelov, M. P. (2023) · Discrete Mathematics and Applications · doi:10.1515/dma-2023-0029 · Cited by 5
A novel fingerprint image encryption algorithm based on chaos using APFM nonlinear adaptive filter
Hsiao, H.-I., & Lee, J. (2013) · IEEE International Symposium on Consumer Electronics (ISCE) · doi:10.1109/isce.2013.6570271 · Cited by 4
“We have employed the NIST SP 800-22a Test Suite [4] for examining the randomness of binary bit sequence (720000 bits) of converting cipher image (Fig 2(c)).”
MethodSecond-level randomness test based on the Kolmogorov-Smirnov test
Yamaguchi, A., & Saito, A. (2022) · JSIAM Letters · doi:10.14495/jsiaml.14.73 · Cited by 5
“However, there are some cases in which the exact distribution of the p-value is different from Funif depending on the first-level randomness test [3].”
BackgroundMethodInfluentialПредельное совместное распределение статистик критериев приближенной $\phi$-энтропии
Savelov, M. P. (2023) · Дискретная математика · doi:10.4213/dm1775 · Cited by 5
Park, H., Kang, J.-S., & Yeom, Y. (2016) · 정보보호학회논문지 · doi:10.13089/jkiisc.2016.26.1.49 · Cited by 4
Differential cryptanalysis of image cipher using block-based scrambling and image filteringPreprint
Yu, F. Q., Gong, X., Li, H., et al. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1812.11693 · Cited by 4
Smart Contracts - Cloud Storage-Assisted Medical Image Encryption and Sharing Solution
Liu, J., & Man, Z. (2026) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2026.3676743 · Cited by 6
“The NIST test evaluates whether generated sequences meet cryptographic randomness standards and statistical requirements [27].”
Cryptographic system for medical image security using chaotic APFM nonlinear adaptive filter
Hsiao, H.-I., & Lee, J. (2013) · International Conference on Orange Technologies · doi:10.1109/icot.2013.6521175 · Cited by 4
“We have utilized the NIST SP 800-22a Test Suite [10] for testing the randomness of the cipher images.”
MethodUser-Independent Randomized Pilot Activation for Secure Key Generation
Kojima, S., & Sugiura, S. (2024) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2024.3383868 · Cited by 3
A Method to Compute an Appropriate Sample Size of a Two-Level Test for the NIST Test Suite
Haramoto, H., & Matsumoto, M. (2018) · Springer proceedings in mathematics & statistics · doi:10.1007/978-3-319-91436-7_15 · Cited by 2
Real-time image encryption algorithm based on a 1D cascaded chaotic map and finite field diffusion
Wang, Q., Yang, Y., & Zhang, X. (2025) · Journal of Electronic Imaging · doi:10.1117/1.jei.34.1.013048 · Cited by 2
“34 Therefore, we need to convert the generated sequence into a binary sequence using Eq.”
Bidirectional coupling of two single memristive Hopfield inertial neurons
Boya, B. F. B. A., Njitacke, Z. T., Babenko, L. K., & Kengne, J. (2025) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-025-06339-4 · Cited by 3
Nabil, H., & Tayeb, H. (2025) · Chinese Physics B · doi:10.1088/1674-1056/ae1454 · Cited by 2
Chai, H., Pan, Q., & Wu, J. (2025) · Security and Safety · doi:10.1051/sands/2025015 · Cited by 8
A novel discrete tanh-based memristor chaotic map and its application
Ding, P., Sun, K., & Wang, H. (2026) · Modern Physics Letters B · doi:10.1142/s0217984926500405 · Cited by 2
Constructing a non-degenerate 2D chaotic map with application in irreversible PRNG
Zhou, Q. (2024) · Multimedia Tools and Applications · doi:10.1007/s11042-024-19787-4 · Cited by 2
“The US NIST statistical test suite provides 16 statistical tests to detect deviations of a binary sequence from randomness [19].”
Application of spread-spectrum techniques to class-E DC/DC converters: some preliminary results
Pareschi, F., Vincenzi, T., Mangia, M., et al. (2015) · doi:10.1109/norchip.2015.7364368 · Cited by 2
“Classical spreadspectrum techniques exploit triangular [4], [5] or periodic [1] waveforms, while most advanced techniques [6] may rely on random sequences [7] with good statistical properties [8].”
BackgroundSelf-citationA New Approach for the DFT NIST Test Applicable for Non-Stationary Input Sequences
Avraham, Y., & Pinchas, M. (2021) · Journal of Signal and Information Processing · doi:10.4236/jsip.2021.121001 · Cited by 3
“However, these tests (NIST) have several problems [21] [22] [23] [24] and as stated in [25], the NIST tests [18] require that the behavior of the tested sequence shall be stationary.”
BackgroundFast Software Implementation of Serial Test and Approximate Entropy Test of Binary Sequence
Yang, X.-W., Zhan, X.-Q., Kang, H., & Luo, Y. (2021) · Security and Communication Networks · doi:10.1155/2021/1375954 · Cited by 3
Encryption Modes Identification of Block Ciphers based on Machine Learning
Xia, R., Li, M., & Chen, S. (2022) · International Journal of Network Security & Its Applications · doi:10.5121/ijnsa.2022.14501 · Cited by 2
“Considering the previous work, many scholars used ASCII codes or bit segments as the feature indices, while we select three statistical indices published by NIST [15].”
MethodPanduro, J. J. R., Álvarez, E. C. B., Becerra, M. D. L. R., Avila, C. A. O., Valdovinos, M. L. B., & Cisneros, S. O. (2022) · International Conference on Mechatronics, Electronics and Automotive Engineering (ICMEAE) · doi:10.1109/icmeae58636.2022.00034 · Cited by 2
Physical Layer Key Generation for IOS-Assisted Communication Systems
Cao, G., Zhang, Y., Ji, Z., Zhang, M., & Li, Y. (2024) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2024.3430289 · Cited by 2
“Meanwhile,theproposedschemecanserve usersdistributedonbothsidesofthemetasurfaceandthegenerated keyscanpasstheNISTrandomnesstest[14]evenunderquasi-static conditions.”
A 6.4pJ/Bit Strong Physical Unclonable Function Based on Multiple-Stage Amplifier Chain
Zhang, J., Zhao, X., Law, M., et al. (2020) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas45731.2020.9180597 · Cited by 2
Impacts of chaotic mixing sequence on the Compressed Sensing blind spectrum reconstruction
Nguyen, U. L. P., Tan, P. V., Nguyen, L. L., & Nguyen, B. H. P. (2021) · International Conference on Advanced Technologies for Communications · doi:10.1109/atc52653.2021.9598319 · Cited by 2
TRIM: AI Guided Random Number Generation for Resource-Constrained IoT Systems
Suha, T., Rahman, M. H., Rice, A. E., Smith, C., Awad, R. A., & Chakraborty, P. (2025) · IEEE Access · doi:10.1109/access.2025.3586177 · Cited by 2
“Figure (1) illustrates the fundamental method for creating and testing (using statistical methods [28]) a TRNG.”
Group Secret Key Distribution Based on Physical-Layer Key Generation and NOMA-Assisted Downlink
Kojima, S., & Sugiura, S. (2025) · IEEE International Conference on Communications workshops · doi:10.1109/iccworkshops67674.2025.11162189 · Cited by 1
“We perform the NIST randomness tests [18].”
NLFSR PUF: A lightweight and reliable strong PUF with modeling-attack resistance
Huang, Z., Du, X., Su, C., & Bian, J. (2026) · Microelectronics Journal · doi:10.1016/j.mejo.2026.107137 · Cited by 1
Zhu, P., Wang, H., & Ji, Y. (2026) · Journal of Lightwave Technology · doi:10.1109/jlt.2026.3674193 · Cited by 1
“Rigorously,todemonstratethesecurityofthechaoticsystems, we use NIST special publication 800–22 to verify their randomness [31].”
Beainy, C. E. P., Cáceres, E. A. G., López, F. R. J., et al. (2011) · ITECKNE Innovación e Investigación en Ingeniería · doi:10.15332/iteckne.v9i1.64 · Cited by 1
“Para realizar dicho control de calidad se planteó utilizar una función de distribución de densidad de probabilidad discreta, que es utilizada frecuentemente en procesos de control de calidad [1-3].”
BackgroundAn Efficiency Optimization Scheme for the On-the-Fly Statistical Randomness Test
Chen, T., Ma, Y., Lin, J., Wang, Z., & Jing, J. (2015) · IEEE International Conference on Cyber Security and Cloud Computing (CSCloud) · doi:10.1109/cscloud.2015.10 · Cited by 1
The Simulation Research and NIST Test of Binary Quantification Methods for the Typical Chaos
Wang, J., Wang, Y., Wen, X., et al. (2015) · International Conference on Robot, Vision and Signal Processing · doi:10.1109/rvsp.2015.50 · Cited by 1
An algebraic and chaotic three-layered digital data encryption technique
Jahangir, S., Shah, T., & Ismail, A. H. (2023) · Nonlinear Dynamics · doi:10.1007/s11071-023-08835-7 · Cited by 2
“We utilized NIST SP 800-22 [21] for measuring the randomness of digital pictures since we had a specific end goal in mind.”
MethodA geographic information encryption system based on Chaos-LSTM and chaos sequence proliferation
Duan, J., Hu, L., Xiao, Q., Liu, M., & Yu, W. (2025) · Frontiers of Information Technology & Electronic Engineering · doi:10.1631/fitee.2300755 · Cited by 1
“The spectral entropy (SE) complexity (Xiong et al., 2021) calculation, TestU01 tests (De la Fraga et al., 2021), and the National Institute of Standards and Tech‐ nology (NIST) tests (Pareschi et al., 2012) are performed on the proliferation sequences.”
Chen, X., Di, X., Li, J., Zhao, J., & Liu, X. (2019) · International Conference on Graphics and Image Processing (ICGIP) · doi:10.1117/12.2524454 · Cited by 1
On pseudorandom number generators
Bastos, D. C., Kowada, L. A. B., & Machado, R. C. S. (2020) · ACTA IMEKO · doi:10.21014/acta_imeko.v9i4.730 · Cited by 1
Scattering-induced entropy boost for highly-compressed optical sensing and encryptionPreprint
Zhan, X., Chang, X., Li, D., Yan, R., Zhang, Y., Jang, M., Zhang, J., & Bian, L. (2023) · Research Square · doi:10.21203/rs.3.rs-2968694/v1 · Cited by 2
An Efficiency Optimization Scheme for the On-the-Fly Statistical Randomness Test
Shen, J., Chen, T., Wang, L., & Ma, Y. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-89500-0_2
SIMULACIONI MODEL METODE ZA GENERISANJE ŠUMA DISKRETNOG U VREMENU I KONTINUALNOG PO VREDNOSTI
Knežević, M., & Pejić, D. (2019) · Zbornik radova Fakulteta tehničkih nauka u Novom Sadu · doi:10.24867/05be00knezevic
“Ovakav fajl je namenjen za statističke testove koji služe za proveru primenjivosti generatora slučajnih vrednosti u kriptografiji [8].”
Study on upper limit of sample sizes for a two-level test in NIST SP800-22Preprint
Haramoto, H. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1912.10602
“efects of the DFT test. Indeed, NIST 12 Hiroshi Haramoto corrected the approximation of the variance to a better value ˙2 1 = 0:050:95n=4 proposed by Kim et al. [5] from ˙2 0 . Later, Pareschi et al. [15] found a further good approximation value ˙2 2 = 0:050:95n=3:8. According to [3], we use ˙2 2 for variance in the f…”
BackgroundMethodSecurity of Digital Images using Dynamical Systems
Souyah, A., & Faraoun, K. M. (2017)
Dynamic Computational Diversity with Multi-Radix Logic and Memory
Flikkema, P. G., Palmer, J. D., Yalçın, T., et al. (2020) · IEEE High Performance Extreme Computing Conference · doi:10.1109/hpec43674.2020.9286255
“Indeed, any deterministic, balanced sequence can appear to have maximum entropy based na¨ıvely on frequencies, so we also use standard tests for randomness [30], [31].”
MethodStatistical Assessment of two Rekeying Mechanisms applied to the Generation of Random Numbers
Peñate, A. A., Daymé, A. E., & Argudín, L. C. (2021) · Journal of Science and Technology on Information security · doi:10.54654/isj.v2i12.92
The Reference Distributions of Maurer’s Universal Statistical Test and Its Improved Tests
Hikima, Y., Iwasaki, A., & Umeno, K. (2021) · IEEE Transactions on Information Theory · doi:10.1109/tit.2021.3131691
SARIOĞLU, B. (2021) · TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES · doi:10.55730/1300-0632.3797 · Cited by 1
Beainy, C. E. P., Caceres, E. A. G., López, F. R. J., et al. (2014) · ITECKNE Innovación e Investigación en Ingeniería · doi:10.15332/iteckne.v9i1.2750
Enciphering Scheme using Planar Near-Rings and DNA Transform
Haq, T. U., Shah, T., Haq, I. U., & Fahad, S. (2022) · International Bhurban Conference on Applied Sciences and Technology (IBCAST) · doi:10.1109/ibcast54850.2022.9990261
“To obtain these requirements, we have used NIST SP 800-22 [21] to assess the randomness of the digital medium.”
MethodShah, T., & Haq, T. U. (2023) · Research Square · doi:10.21203/rs.3.rs-2654286/v1
A Chaos-Metastability Trng for Natively Flexible Igzo CircuitsPreprint
Gołofit, K., Wieczorek, P. Z., & Pilarz, M. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4473571
Unique Identity Generation with Global Features from Multimodal Biometric Data
Dash, P., Samanta, D., & Sarma, M. (2023) · doi:10.1145/3627631.3627654
“The randomness of the generated UIDs has been done using NIST test suite [18].”
MethodWeb based Vulnerabilities Modulation: A Comprehensive Study on Web Vulnerabilities
Raju Ranjan (2024) · INTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT · doi:10.55041/ijsrem32836
Fractal-Based Approach to Secure Key Generation from Fingerprint and Iris Biometrics
Dash, P., Sarma, M., & Samanta, D. (2024) · Communications in computer and information science · doi:10.1007/978-3-031-58181-6_9
Secret key generation for reconfigurable intelligent surface‐assisted MISO multi‐user system
Liu, K., Li, M., Huang, K., et al. (2024) · IET Communications · doi:10.1049/cmu2.12853
On the Mathematical Aspects of Cryptographic Randomness Tests Using Discrete Fourier Transform
Linh, H. D., Thi, L. T., & Văn, L. N. (2024) · International Conference on Cryptography and Information Security (VCRIS) · doi:10.1109/vcris63677.2024.10813437
Cryptographic Key Generation Based on RF Graphene Quantum Capacitor Trimmers
Ren, Y., Sun, C.-H., & Chen, P. (2024) · IEEE International Conference on RFID Technology and Applications (RFID-TA) · doi:10.1109/rfid-ta64374.2024.10965150
“We further evaluate the randomness by utilizing the test suites from the National Institute of Standards and Technology (NIST) [16].”
Simplification of transesterification kinetics in biodiesel production using statistical criteria
Pacheco, G. N., Pereira, F. M., & Guimarães, D. H. P. (2025) · Chemical Engineering Communications · doi:10.1080/00986445.2025.2502773 · Cited by 1
“To evaluate the residuals, three distinct tests were used: 1) the binomial test to assess randomness (Pareschi et al. 2012), using the Binomial Distribution and Cumulative Distribution Function (CDF) of Wolfram Mathematica to compute the p - value (pb) of the binomial test, where values of pb >…”
Improving a VOHE system’s security based on elliptic curve and quaternion function
Yang, P., Shan, Y., Zhang, J., & Huang, G. (2025) · Journal of Computational Methods in Sciences and Engineering · doi:10.1177/14727978251364423
Условия надежности двухуровневого подхода к тестированию в наборе тестов NIST SP800-22
Серов, А. А. (2025) · Математические вопросы криптографии · doi:10.4213/mvk495
Implementation of Encryption Using Glushkov Product of Automata
Saukhanova, Z., Sharipbay, A., Shakhmetova, G., et al. (2025) · The Eurasia Proceedings of Science Technology Engineering and Mathematics · doi:10.55549/epstem.1731140
Vaidyanathan, S. V., Akgül, A., Emin, B., Alaca, Y., Tlelo‐Cuautle, E., Rodríguez-Muñoz, J. D., Afendee, M., & Sambas, A. (2025) · Mechanisms and machine science · doi:10.1007/978-3-031-84449-2_14 · Cited by 1
Umbreen, H., Rehman, H. U., & Shah, T. (2025) · Multimedia Tools and Applications · doi:10.1007/s11042-025-21089-2 · Cited by 1
“To ensure that the Images met these requirements, their randomness was assessed using NIST SP 800 − 22 [ 40].”
Dynamic Privacy-preserving Identity Generation from Fingerprint Sensor Data for Secure Applications
Dash, P., Pandey, F., Sarma, M., et al. (2025) · ACM Transactions on Privacy and Security · doi:10.1145/3769862
“The randomnesses of the generated keys were checked using the NIST test suite [26] and Diehard test suite [19].”
A modular-bias-sin chaotification method for enhanced discrete memristor chaotic maps
Shu, Y., 王, H. 会. W., & 孙, K. 克. S. (2025) · Chinese Physics B · doi:10.1088/1674-1056/ae181e
Image Security Enhancement Using Non‐Chain Ring Algebraic Structure
Safdar, M. U., & Ali, A. (2026) · Security and Privacy · doi:10.1002/spy2.70188
Raymundo, M. T. F. R., Ramos, L. O., Shibukawa, V. P., et al. (2026) · Chemical Engineering Science · doi:10.1016/j.ces.2026.123346
Park, H.-J., Ngo, C. T., Lee, M.-H., & Hong, J.-P. (2026) · IEEE Access · doi:10.1109/access.2026.3667853 · Cited by 1
“That is, it may judge a statistically random bitstream as non-random even when the underlying RNG output is truly random [7], [8], [9], [10].”
Ren, L., & Zhang, D. (2026) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2026.3674497 · Cited by 1
“To substantiate our claim of information-theoretic security, we further perform the NIST SP 800-22 statistical test suite [49] on the generated shares G 1 and G 2 .”
Akter, S., Khalil, K., & Bayoumi, M. (2026) · IEEE International Conference on Secure IoT, Assured and Trusted Computing (SATC) · doi:10.1109/satc69565.2026.11542299
“[41].”
Memory-Free, Anti-Counterfeiting NFC Based on Physical Unclonable Function
Lee, Z.-R., Ren, Y., Alshahrani, S., Pham, D. A., Chen, J., & Chen, P. (2026) · IEEE Journal of Radio Frequency Identification · doi:10.1109/jrfid.2026.3706435
Liu, X., Ye, Q., Liu, W., et al. (2026) · Journal of King Saud University - Computer and Information Sciences · doi:10.1007/s44443-026-01037-2
“Converting the 8 LSB of the pseudorandom number into a binary random number stream is expressed as: The NIST SP 800-22 test suite comprises 15 statistical metrics for evaluating local randomness and global distribution characteristics (Pareschi et al. 2012).”
FedOwner: Protecting image classification models using black-box and white-box watermarking
Tyagi, T., & Singh, A. K. (2026) · Image and Vision Computing · doi:10.1016/j.imavis.2026.106113
Fidan, H. A., & Dalklç, G. (2026) · doi:10.1109/isades69945.2026.11608251
“…suite, examines the given file from multiple perspectives by focusing on the properties such as the proportion of zeros and ones (Frequency Test) [17], the oscillation of bit values (Runs Test), and the presence of periodic patterns (Discrete Fourier Transform Test), alongside complexity…”
Liu, X., Ye, Q., Li, J., et al. (2026) · Mathematics · doi:10.3390/math14162988
Nawaz, S. J., Wyne, S., Mansoor, B., et al. (2026) · IEEE Access · doi:10.1109/access.2026.3729382
“To evaluate KRR thoroughly, a full set of NIST [42] statistical tests is performed, following the analysis of these tests in [44], as shown in Fig.”
Barlybayev, A., Saukhanova, Z., Shakhmetova, G., Sharipbay, A., Raykul, S., & Khassenov, A. (2025) · Eastern-European Journal of Enterprise Technologies · doi:10.15587/1729-4061.2025.348368
“The suite is a set of tests, from the Na - tional Institute of Standards and Technology [26].”
Metadata
- Authors
- Pareschi, F., Rovatti, R., & Setti, G.
- Affiliations
- University of Ferrara (IT)
- University of Bologna (IT)
- Venue
- IEEE Transactions on Information Forensics and Security
- Published
- 2012-04
- Volume
- 7
- Issue
- 2
- Pages
- 491-505
- ISSN
- 1556-6013 (ISSN-L)
- 1556-6021
- OpenAlex
- W2091221194
- Cited by
- 189
- References
- 29
- Citations by year
- 2026: 16 · 2025: 24 · 2024: 25 · 2023: 20 · 2022: 15 · 2021: 22 · 2020: 16 · 2019: 15 · 2018: 13 · 2017: 5 · 2016: 5 · 2015: 7 · 2014: 1 · 2013: 4
- FWCI
- 3.67
- Type
- journal article
- Language
- en
- Open access
- green
- porto.polito.it
- Locations
- IEEE Transactions on Information Forensics and Security (publishedVersion)
- PORTO Publications Open Repository TOrino (Politecnico di Torino) (submittedVersion)
- Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna) (submittedVersion)
- PORTO@Iris (submittedVersion, other-oa)
- Institutional Research Information System University of Ferrara (University of Ferrara) (submittedVersion)
- Topics
- Physical Sciences › Mathematics › Statistics and Probability › Probability and Statistical Research
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Keywords
- NIST SP 800-22, randomness testing, pseudorandom number generators, true random number generator, p-value distribution, binomial distribution, p-value approximation, false positives, spectral test, cryptographic randomness
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-09-29, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-09-29 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (gpt-6-sol).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.