Abstract
Cellular Automata (CA) is used in pseudo-random number generators (PRNG) to produce high-rate random numbers. The randomness of such numbers directly depends upon the CA rules and the number of neighbor cells. The two-dimensional (2D) CA has several limitations such as, finding the best CA rules, boundary cell problems, etc. To address the problems existing in the 2D CA, we propose a random number generator based on 3D cellular automata. The proposed generator is based on rule numbers 43, 85, 170, and 201, and incremental boundary conditions. The rules are randomly changed after each cycle depending on a clock bit mechanism. The output bits are then passed to the Diehard and ENT test suites to test its randomness [1]. The results reveal that the bit stream generated by the proposed scheme passes all the tests present in the test suites.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
