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

@inproceedings{Rukhin2000AST,
  title={A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications},
  author={Andrew L. Rukhin and Juan Soto and James Nechvatal and Miles E. Smid and Elaine B. Barker},
  year={2000}
}
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… Expand

Figures and Tables from this paper

Statistical Tests for Random and Quantum Random Number Generators
TLDR
This paper presents the analysis of a few statistical tests performed on two random number generators: a classic-software, and a quantum-hardware to determine if a generator is adequate to be used in particular cryptographic applications. Expand
TESTING OF TRUE RANDOM NUMBER GENERATORS USED IN CRYPTOGRAPHY
This paper presents a short introduction to theory of testing and evaluation of the True Random Number Generators (TRNGs) used in cryptographic applications. The requirements for TRNGs applied inExpand
True Random Number Generators in FPGAs
The issue of random number generation is crucial for the implementation of cryptographic systems in FPGAs. Random numbers are often used in key generation processes, authentication protocols,Expand
Fault Analysis and Evaluation of a True Random Number Generator Embedded in a Processor
TLDR
This article describes experiments and several standard statistical tools for the testing of true Random Number Generators and presents experimental results obtained through the study of a generator embedded in a processor in order to illustrate the methodology. Expand
SURVEY PAPER : PSEUDO RANDOM NUMBER GENERATORS AND SECURITY TESTS
Many security applications are based on Pseudo Random Number Generators (PRNGs). Random binary numbers constitute a major reliance in many network security algorithms. For example, commonExpand
A Method to Generate Random Number for Cryptographic Application
  • X. Niu, Yongting Wang, Di Wu
  • Mathematics, Computer Science
  • 2014 Tenth International Conference on Intelligent Information Hiding and Multimedia Signal Processing
  • 2014
TLDR
NIST Statistical Test Suite which provides 15 statistical methods is used to test the randomness of the random number generated by this method, and the result of tests shows that the Random Number generator is random. Expand
Performance Analysis of Cryptographic Pseudorandom Number Generators
TLDR
Different BCAs are explored and implemented, and their results are analyzed and addressed, and this paper may help in producing a strong key generation, which is deemed necessary for cryptographic authentication and other security applications. Expand
Testing for Randomness in Pseudo Random Number Generators Algorithms in a Cryptographic Application
TLDR
The researchers employed Chi-Square test on the first 100 random numbers between 0 to 1000 generated using the above generators and it concluded that, Fibonacci Random Numbers Generator Algorithms can provide a more secured cryptographic application. Expand
GENERATION AND TESTING OF RANDOM NUMBERS FOR CRYPTOGRAPHIC APPLICATIONS
Random number sequences are of crucial importance in almost every aspect of modern digital cryptography, having a significant impact on the strength of cryptographic primitives in securing secretExpand
Random Number Generators for Integrated Circuits and FPGAs
TLDR
The random number generator is expected to produce a stream of independent, statistically uniform, and unpredictable random bits, the output should be unpredictable even to the strongest adversary. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 52 REFERENCES
The serial test for sampling numbers and other tests for randomness
In the serial test for sampling numbers ( 3, 4 ) an expression is used. It is in the form of a sum of squares and has previously been supposed to have asymptotically a χ 2 (γ-variate) distribution.Expand
An Accurate Evaluation of Maurer's Universal Test
TLDR
This work compute the precise value of c(L,K) and shows that the inaccuracy due to the heuristic estimate can make the test 2.67 times more permissive than what is theoretically admitted. Expand
An Exhaustive Analysis of Multiplicative Congruential Random Number Generators with Modulus $2^{31} - 1$
This paper presents the results of an exhaustive search to find optimal full period multipliers for the multiplicative congruential random number generator with prime modulus $2^{31} - 1$. Here aExpand
Compression, tests for randomness and estimating the statistical model of an individual sequence
In this survey we consider finite alphabet stationary sources, where the only available statistics about the source is an individual sequence which is emitted by it. Based on this empiricallyExpand
A computer package for measuring the strength of encryption algorithms
TLDR
A computer package used for assessing the security of newly-developed encryption algorithms and their ciphers prior to use is described. Expand
Handbook of Applied Cryptography
From the Publisher: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access ofExpand
A Simple Unpredictable Pseudo-Random Number Generator
TLDR
Two closely-related pseudo-random sequence generators are presented: the ${1 / P} generator, with input P a prime, and the $x^2 \bmod N$generator, which outputs the quotient digits obtained on dividing 1 by P. Expand
Randomness and degrees of irregularity.
  • S. Pincus, B. H. Singer
  • Mathematics, Medicine
  • Proceedings of the National Academy of Sciences of the United States of America
  • 1996
TLDR
ApEn (approximate entropy), defining maximal randomness for sequences of arbitrary length, indicating the applicability to sequences as short as N = 5 points, and an infinite sequence formulation of randomness is introduced that retains the operational (and computable) features of the finite case. Expand
Runs and patterns in probability : selected papers
Preface. Part 1: Combinatorial Probability. 1. Expressions in Terms of Binomial Coefficients for Some Multivariate Distributions of Order k D.L. Antzoulakos, A.N. Philippou. 2. Success Runs in aExpand
Not all (possibly) "random" sequences are created equal.
  • S. Pincus, R. Kálmán
  • Mathematics, Medicine
  • Proceedings of the National Academy of Sciences of the United States of America
  • 1997
TLDR
This work assess randomness via approximate entropy (ApEn), a computable measure of sequential irregularity, applicable to single sequences of both finite and infinite length, and indicates the novelty and facility of the multidimensional viewpoint taken by ApEn, in contrast to classical measures. Expand
...
1
2
3
4
5
...