P. L. Ecuyer and R. Panneton, “Fast Random Number Generators Based on Linear Recurrences Modulo 2: Overview and Comparison,” Proceedings of the Winter Simulation Conference, IEEE Press, Springer, New York, 2005, pp. 110-119. doi:10.1007/978-1-4419-1576-4

has been cited by the following article:

• TITLE: Introduction to Secure PRNGs

  AUTHORS: Majid Babaei, Mohsen Farhadi

  KEYWORDS: Cryptography, Chaotic Random Bit Generator, NIST Test Suite, Testu01

  JOURNAL NAME: International Journal of Communications, Network and System Sciences, Vol.4 No.10, October 12, 2011

  ABSTRACT: 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.