Introduction to Secure PRNGs

Pseudo-Random Number Generators (PRNGs) are required for generating secret keys in cryptographic algorithms, generating sequences of packet in Network simulations (workload generators) and other applications in various fields. In this paper we will discuss a list of some requirements for generating a reliable random sequence and then will present some PRNG methods which are based on combinational chaotic logistic map. In the final section after a brief introduction to two statistical test packets, TestU01 and NIST suite tests, the PRNG methods which are presented in the fourth section will be appraised under these test packets and the results will be reported.

[1]  Christian P. Robert,et al.  Introducing Monte Carlo Methods with R , 2009 .

[2]  Kwok-Wo Wong,et al.  A true random number generator based on mouse movement and chaotic cryptography , 2009 .

[3]  Salih Ergun,et al.  Truly random number generators based on a non-autonomous chaotic oscillator , 2007 .

[4]  Paul C. Kocher,et al.  The intel random number generator , 1999 .

[5]  Pierre L'Ecuyer,et al.  Fast random number generators based on linear recurrences modulo 2: overview and comparison , 2005, Proceedings of the Winter Simulation Conference, 2005..

[6]  Andre Osterloh,et al.  A meta-level true random number generator , 2010, Int. J. Crit. Comput. Based Syst..

[7]  Hassan Hassanabadi,et al.  Improving Middle Square Method RNG Using Chaotic Map , 2011 .

[8]  Bruce D. McCullough,et al.  A review of TESTU01 , 2006 .

[9]  Wang Fuping,et al.  A novel chaos-based pseudo-random number generator , 2006 .

[10]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

[11]  Fred J. Hickernell,et al.  Randomized Halton sequences , 2000 .

[12]  Vinod Patidar,et al.  A Pseudo Random Bit Generator Based on Chaotic Logistic Map and its Statistical Testing , 2009, Informatica.

[13]  Elaine B. Barker,et al.  A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications , 2000 .

[14]  M. Luescher,et al.  A Portable High-quality Random Number Generator for Lattice Field Theory Simulations , 1993 .

[15]  Igor E. Shparlinski.  On the uniformity of distribution of the decryption exponent in fixed encryption exponent RSA , 2004, Inf. Process. Lett..

[16]  R. Subramanian,et al.  Ensuring data storage security in cloud computing using Sobol Sequence , 2010, 2010 First International Conference On Parallel, Distributed and Grid Computing (PDGC 2010).