A New Construction of Pseudorandom Number Generator

Random number sequences and RNGs play an important role in trusted computing environments and cryptographic applications. For example, we use random numbers in the generation of keys in TPM. In some web protocols, random numbers are applied to resist replay attacks. It is necessary to guarantee the quality of RNGs and their random sequences because deterministic factors are likely to be involved in the generation process. If a random number generator is not designed carefully, then the output number sequences may become predictable and bring high security risks. Thus, the design of random number generators that produce high-quality random number sequences has been a hot research topic in these decades. Recently, with the development of resource constrained environments, the demand of lightweight random number generators dramatically increases. People prefer to use the random number generators with extreme high efficiency in the on-the-fly applications. This will affect the security performance of the generators. In this paper, we design a random number generator which meets the current lightweight requirements in the resource-limited environments. Our design is originally based on a lightweight block cipher, and applies the property of random looking output of block cipher to the random number generators. We combine a traditional encryption mode with a novel structure for the random number generator, so that the trade-off between security and efficiency can be made perfectly. We also take a comprehensive security evaluation for our random number generator.

[1]  G. Marsaglia,et al.  Some Difficult-to-pass Tests of Randomness , 2022 .

[2]  Howard C. Card,et al.  Parallel Random Number Generation for VLSI Systems Using Cellular Automata , 1989, IEEE Trans. Computers.

[3]  Achim Zeileis,et al.  Strucchange: An R package for testing for structural change in linear regression models , 2002 .

[4]  Yao Haidong Discussion on High-quality RNG and Scheme of True RNG , 2007 .

[5]  Richard P. Brent,et al.  Note on Marsaglia's Xorshift Random Number Generators , 2004 .

[6]  Yongge Wang Resource bounded randomness and computational complexity , 2000, Theor. Comput. Sci..

[7]  C. F. Chong,et al.  Tuning the Collision Test for Power , 2004, ACSC.

[8]  W. Press,et al.  Numerical Recipes in Fortran: The Art of Scientific Computing.@@@Numerical Recipes in C: The Art of Scientific Computing. , 1994 .

[9]  Jason Wittenberg,et al.  Clarify: Software for Interpreting and Presenting Statistical Results , 2003 .

[10]  Guido Bertoni,et al.  Sponge-Based Pseudo-Random Number Generators , 2010, CHES.

[11]  Michael Gude Concept for a High Performance Random Number Generator Based on Physical Random Phenomena , 1985 .

[12]  Serge Vaudenay,et al.  Distinguishing Distributions Using Chernoff Information , 2010, ProvSec.

[13]  Paul C. van Oorschot,et al.  Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude , 1996, CRYPTO.

[14]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[15]  G. Marsaglia,et al.  Evaluating Kolmogorov's distribution , 2003 .