Abstract
This paper depicts simple cellular automata (CAs) as potential pseudo-random number generators (PRNGs). It introduces a technique to represent CAs as first degree equation identified by some tuples. Some 3-neighborhood 10-state CAs, identified by 6 tuples, are selected following greedy criteria. Concept of window is used to extract a number from each configuration. We observe that, our scheme of choosing the CAs has potentiality to beat all other existing PRNGs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Bhattacharjee, K., Naskar, N., Roy, S., Das, S.: A survey of cellular automata: types, dynamics, non-uniformity and applications. Natl. Comput. 19(2), 433–461 (2020)
Bhattacharjee, K., Das, S.: Random number generation using decimal cellular automata. Commun. Nonlinear Sci. Numer. Simul. 78, 104878 (2019)
Bhattacharjee, K., Das, S.: PRNG library (2021). https://github.com/kamalikaB/. Accessed Nov 26, 2021
Bhattacharjee, K., Maity, K., Das, S.: A search for good pseudo-random number generators: survey and empirical studies (2018). abs/1811.04035
L’Ecuyer, P., Simard, R.: TestU01: A C library for empirical testing of random number generators. ACM Trans. Mathe. Softw. 33(4), 22:1–22:40 (2007)
Marsaglia, G.: DIEHARD: a battery of tests of randomness (1996). http://stat.fsu.edu/~~geo/diehard.html
Matsumoto, Makoto, Nishimura, Takuji: Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. 8(1), 3–30 (1998)
Pal Chaudhuri, P., Roy Chowdhury, D., Nandi, S., Chattopadhyay, S.: Additive Cellular Automata–Theory and Applications, vol. 1. IEEE Computer Society Press, USA (1997). ISBN 0-8186-7717-1
Saito, M., Matsumoto, M.: SIMD-oriented Fast Mersenne Twister (SFMT): twice faster than Mersenne Twister (2017). http://www.math.sci.hiroshima-u.ac.jp/~m-mat/MT/SFMT/#dSFMT
Soto, J.: Statistical testing of random number generators. In: Proceedings of the 22nd National Information Systems Security Conference, vol. 10, p. 12. NIST Gaithersburg, MD (1999)
Acknowledgements
The author is grateful to Prof. Sukanta Das for his support, comments, guidance and encouragement to do this work.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Bhattacharjee, K. (2022). First Degree Cellular Automata as Pseudo-Random Number Generators. In: Das, S., Martinez, G.J. (eds) Proceedings of First Asian Symposium on Cellular Automata Technology. ASCAT 2022. Advances in Intelligent Systems and Computing, vol 1425. Springer, Singapore. https://doi.org/10.1007/978-981-19-0542-1_10
Download citation
DOI: https://doi.org/10.1007/978-981-19-0542-1_10
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-0541-4
Online ISBN: 978-981-19-0542-1
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)