A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications

By Andrew L. Rukhin, Juan Soto, James Nechvatal, M. Smid, Elaine B. Barker. 2000

4,480 citations recorded by the source corpus.

Abstract : This paper discusses some aspects of selecting and testing random and pseudorandom number generators. The outputs of such generators may he 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 he 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 he useful as a first step in determining whether or not a generator is suitable for a particular cryptographic application. The design and cryptanalysis of generators is outside the scope of this paper.

Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition

View Paper: https://www.semanticscholar.org/paper/961fc0f6c68303cde94a28fdb24e6eaf3ef040b4

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Reuven Y. Rubinstein
  2. Juan Carlos García-Escartín
  3. Miguel Herrero-Collantes
  4. Roel Maes
  5. Zhongyun Hua
  6. Yicong Zhou
  7. Ingo Fischer
  8. Miguel C. Soriano

In Computer Vision and Pattern Recognition

  1. Zhongyun Hua
  2. Reuven Y. Rubinstein
  3. Yicong Zhou
  4. Hejiao Huang
  5. Roel Maes
  6. Pierre L'Ecuyer
  7. Richard J. Simard
  8. Juan Carlos García-Escartín

Citations in the corpus