Topic
Statistical randomness
About: Statistical randomness is a research topic. Over the lifetime, 101 publications have been published within this topic receiving 2305 citations. The topic is also known as: statistically random.
Papers published on a yearly basis
Papers
TL;DR: TestU01 as discussed by the authors is a software library implemented in the ANSI C language, and offering a collection of utilities for the empirical statistical testing of uniform random number generators (RNGs).
Abstract: We introduce TestU01, a software library implemented in the ANSI C language, and offering a collection of utilities for the empirical statistical testing of uniform random number generators (RNGs). It provides general implementations of the classical statistical tests for RNGs, as well as several others tests proposed in the literature, and some original ones. Predefined tests suites for sequences of uniform random numbers over the interval (0, 1) and for bit sequences are available. Tools are also offered to perform systematic studies of the interaction between a specific test and the structure of the point sets produced by a given family of RNGs. That is, for a given kind of test and a given class of RNGs, to determine how large should be the sample size of the test, as a function of the generator's period length, before the generator starts to fail the test systematically. Finally, the library provides various types of generators implemented in generic form, as well as many specific generators proposed in the literature or found in widely used software. The tests can be applied to instances of the generators predefined in the library, or to user-defined generators, or to streams of random numbers produced by any kind of device or stored in files. Besides introducing TestU01, the article provides a survey and a classification of statistical tests for RNGs. It also applies batteries of tests to a long list of widely used RNGs.
1,135 citations
1 Apr 2010
TL;DR: This paper discusses some aspects of selecting and testing random and pseudorandom number generators and their relation to cryptanalysis, and some recommended statistical tests are provided.
Abstract: This paper discusses some aspects of selecting and testing random and pseudorandom number generators. The outputs of such generators may be used in many cryptographic applications, such as the generation of key material. Generators suitable for use in cryptographic applications may need to meet stronger requirements than for other applications. In particular, their outputs must be unpredictable in the absence of knowledge of the inputs. Some criteria for characterizing and selecting appropriate generators are discussed in this document. The subject of statistical testing and its relation to cryptanalysis is also discussed, and some recommended statistical tests are provided. These tests may be useful as a first step in determining whether or not a generator is suitable for a particular cryptographic application. However, no set of statistical tests can absolutely certify a generator as appropriate for usage in a particular application, i.e., statistical testing cannot serve as a substitute for cryptanalysis. The design and cryptanalysis of generators is outside the scope of this paper.
684 citations
TL;DR: A new statistical test for random bit generators is presented which can detect any significant deviation of a device's output statistics from the statistics of a truly random bit source when the device can be modeled as an ergodic stationary source with finite memory but arbitrary (unknown) state transition probabilities.
Abstract: A new statistical test for random bit generators is presented which, in contrast to presently used statistical tests, is universal in the sense that it can detect any significant deviation of a device's output statistics from the statistics of a truly random bit source when the device can be modeled as an ergodic stationary source with finite memory but arbitrary (unknown) state transition probabilities. The test parameter is closely related to the device's per-bit entropy which is shown to be the correct quality measure for a secret-key source in a cryptographic application. The test hence measures the cryptographic badness of a device's possible defect. The test is easy to implement and very fast and thus well suited for practical applications. A sample program listing is provided.
319 citations
TL;DR: It is shown that data compression methods can be used as a basis for testing randomness tests and two new tests for randomness are described, based on ideas of universal coding, which show that the power of the new tests is greater than of many known algorithms.
75 citations
Patent•
10 May 1999
TL;DR: In this paper, a method of generating a private key for use in a public key data communication system implemented between a pair of correspondents is disclosed, and the method comprises the steps of generating the random number for use as private key and testing the number against a predetermined set of criteria.
Abstract: A method of generating a private key for use in a public key data communication system implemented between a pair of correspondents is disclosed. The method comprises the steps of generating a random number for use as a private key and testing the number against a predetermined set of criteria. The criteria are chosen to determine the statistical randomness of the number. The random number is utilized as a key upon satisfying the criteria.
49 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2021 | 7 |
| 2020 | 11 |
| 2019 | 6 |
| 2018 | 8 |
| 2017 | 11 |
| 2016 | 9 |