A universal statistical test for random bit generators
Open accessThe claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
No references could be resolved yet.
Research works printed but not linked: 14
- R. E. Blahut, Principles and Practice of Information Theory, Reading, MA: Addison-Wesley, 1987.
- E. J. Dudewicz and E. C. van der Meulen, Entropy-based tests of uniformity, Journal of the American Statistical Association, vol. 76, no. 376, Dec. 1981, pp. 967-974.
- P. Elias, Interval and recency rank source coding: Two on-line adaptive variable-length schemes, IEEE Transactions on Information Theory, vol. 33, Jan. 1987, pp. 3-10.
- W. Feller, An Introduction to Probability Theory and Its Applications, 3rd edn., vol. 1, New York: Wiley, 1968.
- J. E. Hop~oft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, Reading, MA: Addison-Wesley, 1979.
- D. E. Knuth, The Art of Computer Programming, vol. 2, 2nd edn., Reading, MA: Addison-Wesley, 1981.
- A. N. Kolmogorov, Three approaches to the quantitative definition of information, Problemy Peredachi lnformatsii, vol. 1, no. 1, 1965, pp. 3-11.
- P. Martin-Lrf, The definition of random sequences, Information and Control, vol. 9, 1966, pp. 602-619.
- J. L. Massey, An introduction to contemporary cryptology, Proceedings of the IEEE, vol. 76, no. 5, 1988, pp. 533-549.
- C. E. Shannon, A mathematical theory of communication, Bell System Technical Journal, vol. 27, Oct. 1948, pp. 379-423 and 623-656.
- F.M.J. Willems, Universal data compression and repetition times, IEEE Transactions on Informa- tion Theory, vol. 35, Jan. 1989, pp. 54-58.
- J. M. Wozencraft and B. Reiffen, Sequential Decodino, Cambridge, MA: Technical Press of the M.I.T., 1960.
- J. Ziv, Compression tests for randomness and estimating the statistical model of an individual sequence, in: Sequences (ed. R. M. Capocelli), Berlin: Springer-Verlag, 1990, pp. 366-373.
- J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Transactions on Information Theory, vol. 23, May 1977, pp. 337-343.
Cited by
Sorted by citations
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 · see citing works
Rukhin, A., Sota, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Heckert, A., et al. (2000) · doi:10.6028/nist.sp.800-22 · Cited by 1,867 · see citing works
A noise-based IC random number generator for applications in cryptography
Petrie, C. S., & Connelly, J. A. (2000) · IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications · doi:10.1109/81.847868 · Cited by 487 · see citing works
Recommendation for the Entropy Sources Used for Random Bit Generation
Turan, M. S., Barker, E., Kelsey, J., McKay, K. A., Baish, M. L., & Boyle, M. (2018) · NIST Special Publication 800-90B · doi:10.6028/nist.sp.800-90b · Cited by 489 · see citing works
The strict avalanche criterion randomness test
Castro, J. C. H., Sierra, J. M., Seznec, A., Izquierdo, A., & Ribagorda, A. (2005) · Mathematics and Computers in Simulation · doi:10.1016/j.matcom.2004.09.001 · Cited by 122 · see citing works
New statistical randomness tests: 4-bit template matching tests
SULAK, F. (2017) · TURKISH JOURNAL OF MATHEMATICS · doi:10.3906/mat-1509-19 · Cited by 5 · see citing works
- Authors
- Maurer, U. M.
- Affiliations
- ETH Zurich (CH)
- Corresponding author
- Maurer, Ueli M.
- Venue
- Journal of Cryptology
- Published
- 1992-01
- Volume
- 5
- Issue
- 2
- Pages
- 89-105
- ISSN
- 0933-2790 (ISSN-L)
- 1432-1378
- OpenAlex
- W2025905409
- Cited by
- 263
- References
- 0
- Citations by year
- 2026: 3 · 2025: 11 · 2024: 9 · 2023: 9 · 2022: 6 · 2021: 13 · 2020: 11 · 2019: 8 · 2018: 8 · 2017: 11 · 2016: 8 · 2015: 16 · 2014: 10 · 2013: 11 · 2012: 11
- FWCI
- 2.68
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Journal of Cryptology (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Physical Sciences › Computer Science › Artificial Intelligence › Coding theory and cryptography
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
- Keywords
- random bit generator, statistical randomness testing, 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.
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
