A Comparative Study of Some Pseudorandom Number Generators

We present results of an extensive test program of a group of pseudorandom number generators which are commonly used in the applications of physics, in particular in Monte Carlo simulations. The generators include public domain programs, manufacturer installed routines and a random number sequence produced from physical noise. We start by traditional statistical tests, followed by detailed bit level and visual tests. The computational speed of various algorithms is also scrutinized. Our results allow direct comparisons between the properties of different generators, as well as an assessment of the efficiency of the various test methods. This information provides the best available criterion to choose the best possible generator for a given problem. However, in light of recent problems reported with some of these generators, we also discuss the importance of developing more refined physical tests to find possible correlations not revealed by the present test methods.Comment: University of Helsinki preprint HU-TFT-93-22 (minor changes in Tables 2 and 7, and in the text, correspondingly

Pseudorandom number generation with self programmable cellular automata

In this paper, we propose a new class of cellular automata – self programming cellular automata (SPCA) with specific application to pseudorandom number generation. By changing a cell's state transition rules in relation to factors such as its neighboring cell's states, behavioral complexity can be increased and utilized. Interplay between the state transition neighborhood and rule selection neighborhood leads to a new composite neighborhood and state transition rule that is the linear combination of two different mappings with different temporal dependencies. It is proved that when the transitional matrices for both the state transition and rule selection neighborhood are non-singular, SPCA will not exhibit non-group behavior. Good performance can be obtained using simple neighborhoods with certain CA length, transition rules etc. Certain configurations of SPCA pass all DIEHARD and ENT tests with an implementation cost lower than current reported work. Output sampling methods are also suggested to improve output efficiency by sampling the outputs of the new rule selection neighborhoods

An Evolutionary Approach to the Design of Controllable Cellular Automata Structure for Random Number Generation

Cellular Automata (CA) has been used in pseudorandom number generation over a decade. Recent studies show that two-dimensional (2-d) CA Pseudorandom Number Generators (PRNGs) may generate better random sequences than conventional one-dimensional (1-d) CA PRNGs, but they are more complex to implement in hardware than 1-d CA PRNGs. In this paper, we propose a new class of 1-d CA Controllable Cellular Automata (CCA) without much deviation from the structure simplicity of conventional 1-d CA. We give a general definition of CCA first and then introduce two types of CCA – CCA0 and CCA2. Our initial study on them shows that these two CCA PRNGs have better randomness quality than conventional 1-d CA PRNGs but their randomness is affected by their structures. To find good CCA0/CCA2 structures for pseudorandom number generation, we evolve them using the Evolutionary Multi-Objective Optimization (EMOO) techniques. Three different algorithms are presented in this paper. One makes use of an aggregation function; the other two are based on the Vector Evaluated Genetic Algorithm (VEGA). Evolution results show that these three algorithms all perform well. Applying a set of randomness tests on the evolved CCA PRNGs, we demonstrate that their randomness is better than that of 1-d CA PRNGs and can be comparable to that of two-dimensional CA PRNGs

Analysis of Random Number Generators Using Monte Carlo Simulation

Revisions are almost entirely in the introduction and conclusion. Results are unchanged, however the comments and recommendations on different generators were changed, and more references were added.Comment: Email: [email protected] 16 pages, Latex with 1 postscript figure. NPAC technical report SCCS-52

Recent Trends in Image Encryption: A Review

Security of multimedia data is gaining acceptance owing to the growth and acceptability of images in various applications and in telecommunication. Encryption is one of the ways to ensure high security of images as they are used in many fields such as in secure medical imaging services, military intelligence, internet and intranet communication, e-banking etc. These images are stored or transmitted through a network; hence the security of such image data is important. In this work, recently developed encryption techniques are studied and analyzed to promote further development of more encryption methods to ensure additional security and versatility. All the techniques reviewed came into existence within the last five years (2011-2015) and are found to be useful for the present day encryption applications. Each technique is unique in its own way, which might be suitable for different applications. As time goes on, new encryption techniques are evolving. Hence, fast and secure conventional encryption techniques will always be needed in applications requiring high rate of security

Randomness Quality of CI Chaotic Generators: Applications to Internet Security

Due to the rapid development of the Internet in recent years, the need to find new tools to reinforce trust and security through the Internet has became a major concern. The discovery of new pseudo-random number generators with a strong level of security is thus becoming a hot topic, because numerous cryptosystems and data hiding schemes are directly dependent on the quality of these generators. At the conference Internet`09, we have described a generator based on chaotic iterations, which behaves chaotically as defined by Devaney. In this paper, the proposal is to improve the speed and the security of this generator, to make its use more relevant in the Internet security context. To do so, a comparative study between various generators is carried out and statistical results are given. Finally, an application in the information hiding framework is presented, to give an illustrative example of the use of such a generator in the Internet security field.Comment: 6 pages,6 figures, In INTERNET'2010. The 2nd Int. Conf. on Evolving Internet, Valencia, Spain, pages 125-130, September 2010. IEEE Computer Society Press Note: Best Paper awar

Optical quantum random number generators: a comparative study

Quantum random number generators give the opportunity to, in theory, obtain completely unpredictable numbers only perturbed by the noise in the measurement. The obtained data can be digitalized and processed so that it gives as a result a uniform sequence of binary random numbers without any relation with the classical noise in the system. In this work we analyze the performance of optical QRNGs with three different arrangements: a homodyne detector measuring vacuum fluctuations, a homodyne detector measuring amplified spontaneous emission from an EDFA and a spontaneous emission phase noise-based generator. The raw data from the experiments is processed using a Toeplitz extractor, giving as a result sequences of binary numbers capable of passing the NIST Statistical Test Suite.Universidade de Vigo/CISU