Abstract
The security of a One-time Pad Cryptography system depends on the keystream generator, which has been studied to produce a high randomness quality over the last thirty years. A Cellular Automata (CA) Pseudorandom Number Generator (PRNG) is more efficiently implement rather than LFSR, Linear Congruential generator, Fibonacci generator, etc.. Moreover, a CA structure-based PRNG is highly regular and simpler than previous PRNGs. Accordingly, we propose a new PRNG based on a virtual three-dimension (3-D) CA with the Moore neighborhood structure. In order to evaluate the quality of randomness, the ENT and the DIEHARD test suites are used. The results of these tests show that the quality of randomness is better than previous PRNGs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Tomassini, M., Sipper, M., Perrenoud, M.: On the generation of high quality random numbers by two-dimensional cellular automata. IEEE Transactions on Computers 49, 1146–1151 (2000)
Tomassini, M., Sipper, M., Zolla, M., Perrenoud, M.: Generating high-quality random numbers in parallel by cellular automata. Future Generation Computer Systtems 16, 291–305 (1999)
Hortensius, P.D., Mcleod, R.D., Pries, W., Miller, D.M., Card, H.C.: Cellular automata-based pseudorandom number generators for built-in self-test. IEEE Transaction Computer-Aided Design 8, 842–859 (1989)
Wolfram, S.: Cryptography with cellular automata. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 429–432. Springer, Heidelberg (1986)
Guan, S.-U., Zhang, S., Quieta, M.T.: 2-D Variation With Asymmetric Neighborship for Pseudorandom Number Generation. IEEE Transaction on Computers 23, 378–388 (2004)
Quieta, M.T.R., Guan, S.-U.: Optimization of 2D Lattice Cellular Automata for Pseudorandom Number Generation. International Journal of Modern Physics C 16(3), 479–500 (2005)
Tan, S.K., Guan, S.-U.: Evolving cellular automata to generate nonlinear sequences with desirable properties. Applied Soft. Computing 7, 1131–1134 (2007)
Chaudhuri, P.P., et al.: Additive Cellular Automata Theory and Applications, vol. 1, pp. 18–19. IEEE Compter Society Press, Los Alamitos (1997)
Diehard, G.M.: (1998), http://www.stat.fsu.edu/pub/diehard
ENT Test Suite, http://www.fourmilab.ch/random
Stallings, W.: Cryptography and Network Security Principles and Practices, 3rd edn., pp. 24–27. Prentice Hall, Englewood Cliffs (2003)
Winter,, et al.: Genetic Algorithms in Engineering and Computer Science, pp. 24–27. Wiley Prentice Hall, New york (1995)
Kang, B.-H.: A Pseudorandom Number Genrator Based on Two-Dimensional Programmable Cellular Automata, Doctor’s Thesis, Kyungpook National University (June 2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shin, SH., Park, GD., Yoo, KY. (2008). A Virtual Three-Dimension Cellular Automata Pseudorandom Number Generator Based on the Moore Neighborhood Method. In: Huang, DS., Wunsch, D.C., Levine, D.S., Jo, KH. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. ICIC 2008. Lecture Notes in Computer Science(), vol 5227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85984-0_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-85984-0_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85983-3
Online ISBN: 978-3-540-85984-0
eBook Packages: Computer ScienceComputer Science (R0)