Abstract: The Cellular Automata (CA) were invented in the late 1940 by Stanislaw Ulam and John Von Neumann. CA are simple models of computation in which the components act together and exhibit complex behavior. Initially CA are represented as model of self-reproducing organisms. Later they are applied in various areas like Physics, biology and other applications. The self-reproducing behavior is then utilized to construct Universal Turing Machine. This Survey is about the applications of CA closer to Computer Science especially designing Pseudo Random Number Generator. Keywords: Cellular Automata, CA, Applications of CA , Pseudo random number generator, PRNG, 1D CA rules. I. IntroductIon Cellular Automata consist of unlimited lattice of cells of d dimensions. One dimensional CA consist of a row of cells and set of rules. Two dimensional CA consist of a table or matrix of cells and a collection of rules. At time t each cell will be in any one of the permissible states. At time ‘t’ the rules are applied to a set of cells to generate a new generation of CA [1]. The rules involve the states of the neighbor cells. The neighborhood was defned by various authors. Alvy Ray Smith III [2] defned the neighborhood template. A cellular space is labeled by pair (T,r) where T is the neighborhood template and r is the number of permissible states for cells. Some of the most popular A Survey on Cellular Automata with the Application in Pseudo Random Number Generation I. Gethzi Ahila Poornima 1 , B. Paramasivan 2 , K. Mohaideen Pitchai 3 , M. Bhuvaeswari 4 1 Department of Computer Science and Engineering, National Engineering College, Anna University, Tamil Nadu, India. Email:gethzi.akila@gmail.com 2 Department of Computer Science and Engineering, National Engineering College, Anna University, Tamil Nadu, India. Email: bparamasivan@yahoo.co.in 3 Department of Computer Science and Engineering, National Engineering College, Anna University, Tamil Nadu, India. Email: mohaideen1981@gmail.com 4 Department of Computer Science and Engineering, National Engineering College, Anna University, Tamil Nadu, India. Email: itsbhuvana@gmail.com neighborhood templates are Von Neumann neighborhood (Orthogonal) and Moore (Unit Cube) neighborhood. A. Classifcation of Cellular Automata Wolfram classifed CA into four classes based on typical behavior [3]. These classes are Class I-Evolution of CA which leads to trivial Confgurations, Class II- Evolution of CA which leads to periodic Confguration, Class III-Evolution of CA which leads to chaotic and Class IV-Evolution of CA which leads to complicated and persistent structure. Wentian Li et al [4] classifed CA into six classes based on the differences between their statistical measures. They are spatially homogenous fxed points, spatially inhomogeneous fxed points, periodic behavior, locally chaotic behavior, chaotic behavior and complex behavior. Based on some static characteristics, CA can be categorized into different types. Based on the dimensions of CA, they are classifed as one dimensional, two dimensional and N-dimensional CA. Based on the capabilities of changing cell status (current state), CA is of two types. They are Programmable CA (PCA) and Controllable CA (CCA). In PCA, the action of some cells can be controlled via some Rule Control Signal (RCS). The RCS will decide the rule to be applied to that particular cell. In CCA, the actions of some cells are controlled via Cell Control Signal (CCS) in addition to RCS. The classifcation of Cellular Automata is given in the Fig. 1 Journal of Network and Information Security Volume 5 Issue 2 2017 ISSN.: 2321-6859