Journal of Network and Information Security

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

A Survey on Cellular Automata with the Application in Pseudo Random Number Generation


Affiliations
1 Department of Computer Science and Engineering, National Engineering College, Anna University, Tamil Nadu, India
     

   Subscribe/Renew Journal


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.
Subscription Login to verify subscription
User
Notifications
Font Size



  • A Survey on Cellular Automata with the Application in Pseudo Random Number Generation

Abstract Views: 449  |  PDF Views: 6

Authors

I. Gethzi Ahila Poornima
Department of Computer Science and Engineering, National Engineering College, Anna University, Tamil Nadu, India
B. Paramasivan
Department of Computer Science and Engineering, National Engineering College, Anna University, Tamil Nadu, India
K. Mohaideen Pitchai
Department of Computer Science and Engineering, National Engineering College, Anna University, Tamil Nadu, India
M. Bhuvaeswari
Department of Computer Science and Engineering, National Engineering College, Anna University, Tamil Nadu, India

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.

References