Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 33 of the 34 references it cites were found in a registry or an index; none of the 14 sources its claims cite is checked for support yet.

A statistical test suite for random and pseudorandom number generators for cryptographic applications

Open access
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, Heckert, N A, Dray, J F, Vo, S · 2010 · NIST Special Publication 800-22 Revision 1a

Abstract

The Information Technology Laboratory (ITL) at the National Institute of Standards and Technology (NIST) promotes the U.S. economy and public welfare by providing technical leadership for the nation's measurement and standards infrastructure. ITL develops tests, test methods, reference data, proof of concept implementations, and technical analysis to advance the development and productive use of information technology. ITL's responsibilities include the development of technical, physical, administrative, and management standards and guidelines for the cost-effective security and privacy of sensitive unclassified information in Federal computer systems.

Overview

CoChat Summary

TL;DR

This NIST Special Publication 800-22 Revision 1a presents a suite of 15 statistical tests for evaluating whether binary sequences produced by random or pseudorandom number generators are suitable for cryptographic applications. It provides test purposes, mathematical descriptions, examples, and guidance for interpreting P-values, while cautioning that statistical testing is only a first step and cannot replace cryptanalysis.

Key findings

  • The suite consists of 15 tests: Frequency (Monobit), Frequency within a Block, Runs, Longest Run of Ones, Binary Matrix Rank, Discrete Fourier Transform (Spectral), Non-overlapping Template Matching, Overlapping Template Matching, Maurer’s “Universal Statistical,” Linear Complexity, Serial, Approximate Entropy, Cumulative Sums, Random Excursions, and Random Excursions Variant. The Frequency test is recommended first because it supplies the most basic evidence of non-randomness.
  • Each test uses the null hypothesis \(H_0\) that the sequence is random; if P-value \(\ge \alpha\), the sequence is accepted as random, and if P-value \(<\alpha\), it is rejected. Examples use \(\alpha=0.01\), and NIST recommends \(\alpha\) in the range [0.001, 0.01].
  • The document states that no finite set of statistical tests is “complete,” that statistical testing cannot absolutely certify a generator, and that statistical testing cannot serve as a substitute for cryptanalysis.
  • Sample data files are 1,000,000 bits (binary expansions of \(e\), \(\pi\), \(\sqrt{2}\), \(\sqrt{3}\), and a G-SHA-1 sequence); reported example P-values include Frequency for \(\pi\) = 0.578211, for \(e\) = 0.953749, and for G-SHA-1 = 0.604458.

Methods

  • Design: The NIST Statistical Test Suite is an ANSI C reference implementation of 15 tests; each test defines a test statistic, a reference distribution (e.g., normal, half-normal, chi-square), a P-value, and a decision rule at the 1% level.
  • Data or sample: Tests apply to binary sequences from hardware or software RNGs/PRNGs; sample files are 1,000,000 bits, while many worked examples use small illustrative lengths such as \(n=100\).
  • Main analysis: For each sequence, P-values are computed and compared to \(\alpha\); empirical interpretation examines the proportion of sequences passing a test and the uniformity of P-values. A multiple-test dependence study applied 161 test P-values to Blum-Blum-Shub sequences of length 1,000,000 and used principal components/factor analysis, concluding there was no large redundancy among tests.

Limitations

  • The paper states that no set of statistical tests can absolutely certify a generator as appropriate, that statistical testing cannot substitute for cryptanalysis, and that generator design and cryptanalysis are outside its scope.
  • The paper states that many examples use small sample sizes for illustration only, e.g., \(n=10\), where the normal approximation is not really applicable; many tests rely on asymptotic reference distributions for large \(n\) (order \(10^3\) to \(10^7\)), and input parameter constraints apply.
  • The text makes evident additional limitations: numerical precision can degrade for large incomplete gamma parameter \(a\); Maurer’s variance approximation can make the test 2.67 times more permissive than theoretically admitted; Random Excursions is discontinued if \(J<500\); and multiple tests can yield contradictory conclusions, as in the Random Excursions example where one state gave a non-random result while seven states gave random results.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.6028/nist.sp.800-22r1a

Cites

33 of 33 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Figures

Image 1
From the PDF
Image 2
From the PDF
Image 3
From the PDF
Image 4
From the PDF
Image 5
From the PDF
Image 6
From the PDF
Figure 5-1 Depiction of the Final Analysis Report
Figure 5-1 Depiction of the Final Analysis ReportFrom the PDF

Verification

Claims the paper makes

0 Valid · 1 Not valid · 11 Not checked · 13 Own results and interpretations

20 more claims

Create a free account to see all 25 claims and every source verdict.

See all claims — free account

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?

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

Each contradiction between two passages listed here was confirmed by an independent check.

5 of 7 · the rest aren’t loaded

2 more findings

Create a free account to see every finding of this check.

See all findings — free account

Citations

Cites

Show all 34 references

Cited by

See all 3,620

Metadata

Authors
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., Heckert, N. A., Dray, J. F., & Vo, S.
Affiliations
National Institute of Standards and Technology (US)
Venue
NIST Special Publication 800-22 Revision 1a
Published
2010
OpenAlex
W1517403092
Cited by
3,617
References
34
Citations by year
2026: 128 · 2025: 205 · 2024: 192 · 2023: 208 · 2022: 166 · 2021: 291 · 2020: 290 · 2019: 250 · 2018: 254 · 2017: 207 · 2016: 183 · 2015: 184 · 2014: 201 · 2013: 155 · 2012: 139
Type
report
Language
en
Open access
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
  • Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
Keywords
random number generators, pseudorandom number generators, cryptographic randomness, NIST SP 800-22, randomness testing

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.

A language model drew the claims from the paper on 2026-09-27 (prompt extract-v2).

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A statistical test suite for random and pseudorandom number generators for cryptographic applications. https://app.cochat.ai/papers/10.6028/nist.sp.800-22r1a
The paper
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., Heckert, N. A., Dray, J. F., & Vo, S. (2010). A statistical test suite for random and pseudorandom number generators for cryptographic applications. NIST Special Publication 800-22 Revision 1a. https://doi.org/10.6028/nist.sp.800-22r1a

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.