Pseudorandom Number Generation Using Cellular Automata
High-performance pseudorandom number generators (PRNGs) play an important role in a variety of applications like computer simulations, and industrial applications including cryptography. High-quality PRNG can be constructed by employing cellular automata (CA). Advantage of the PRNG that employs CA includes that it is fast and suitable for hardware implementation. In this paper, we propose a two-dimensional (2-D) CA based PRNG. Our scheme uses the structure of programmable CA (PCA) for improving randomness quality. Moreover, for reducing of serial correlations among the produced pseudorandom bits, a consecutive bits replacing spacing technique is proposed. Finally, we provide experimental results to verify the randomness quality using ENT and DIEHARD test suites.
KeywordsControl Signal Cellular Automaton Cellular Automaton Pseudorandom Number Pseudorandom Number Generator
Unable to display preview. Download preview PDF.
- M. Matsumoto, “Simple Cellular Automata as Pseudorandom m-sequence Generators for Built-In Self-Test”, ACM Transactions on Modelling and Computer Simulation, ACM Press, New York, 1998, Vol. 8, No. 1, pp. 31-42.Google Scholar
- S. U. Guan and S. Zhang, “A Family of Controllable Cellular Automata for Pseudorandom Number Generation”, International Journal of Modern Physics C, World Scientific Publishing, 2002, Vol. 13, No. 8, pp. 1047-1073.Google Scholar
- S. Wolfram, “Cryptography with Cellular Automata”, Advances in Cryptology: Crypto ‘ 85 Proceedings, Springer-Verlag, New York, 1985. LNCS 218, pp. 429-432.Google Scholar
- S. Wolfram, “Random Sequence Generation by Cellular Automata”, Advanced in Applied Mathematics, Academic Press, Orlando, 1986, Vol. 7, pp. 123-169.Google Scholar