Abstract
In this paper, is considered a problem of selection rules for one-dimensional (1D) totalistic cellular automaton (TCA), which is used for generation of pseudorandom sequences which could be useful in cryptography. The quality of pseudorandom bit sequences generated by TCA-based pseudorandom number generator (PRNG) depends on appropriately selected totalistic rules assigned to CA cells. There is presented a methodology of selecting TCA rules, starting from initial selection based on application Entropy of bit streams generated by the TCA. Next, the selected rules were examined with the use of the NIST SP 800-22rev1a tests and the Diehard set of Marsaglia tests. In the paper was analyzed, the uniform TCA with totalistic rules with neighborhood radius equal to 1, 2, 3, and 4. During the studies, selected sets of TCA are presented as a new set of CA rules, which can be used as quite cryptographically strong TCA-based PRNG, supplying a new huge space of keys.
Sign-in/Register to access full text options 
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
