Abstract
We present classical theories for randomness, starting from mathematical ones to others focusing on randomness testing, more useful in computer science. Those characterisations are made by bounding the computational resources required for testing. Next, we present some suitable practical randomness testing suites designed to measure the quality of random strings that can be efficiently generated. Finally, random string generation by binary uniform cellular automata of increasing quality illustrates the improvements of the randomness testing suites.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput. 13, 850–864 (1984)
Carlet, C.: Boolean functions for cryptography and error-correcting codes. Technical report, University of Paris 8 (2011)
Davie, G.: Characterising the Martin-Löf random sequences using computably enumerable sets of measure one. Inf. Process. Lett. 92(3), 157–160 (2004)
Goldreich, O.: Pseudorandomness. Not. AMS 46(10), 1209–1216 (1999)
Goldreich, O., Levin, L.A.: A hard core predicate for any one way function. In: 21st STOC, pp. 25–32 (1989)
Goldwasser, S., Micali, S.: Probabilistic encryption. JCSS 28(2), 270–299 (1984)
Gruska, J.: Foundations of Computing. International Thomson Publishing, London (1997)
Knuth, D.: Seminumerical Algorithms. Addison Wesley, Boston (1969)
Kolmogorov, A.: Three approaches to the quantitative definition of information. Problemy Pederachi Informatsii 1, 3–11 (1965)
Li, M., Vitányi, P.: An Introduction to Kolmogorov Complexity and Its Applications. TCS, Springer, New York (2008). https://doi.org/10.1007/978-0-387-49820-1
Marsaglia, G.: A current view of random number generators. In: Computer Sciences and Statistics, pp. 3–10 (1985)
Marsaglia, G.: Diehard (1995). http://www.stat.fsu.edu/pub/diehard/
Martin, B.: A Walsh exploration of elementary CA rules. J. Cell. Autom. 3(2), 145–156 (2008)
Formenti, E., Imai, K., Martin, B., Yunès, J.-B.: Advances on random sequence generation by uniform cellular automata. In: Calude, C.S., Freivalds, R., Kazuo, I. (eds.) Computing with New Resources. LNCS, vol. 8808, pp. 56–70. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-13350-8_5
Martin-Löf, P.: The definition of random sequences. Inf. Control 9, 602–619 (1966)
Ryan, C., Kshirsagar, M., Vaidya, G., Cunningham, A., Sivaraman, R.: Design of a cryptographically secure pseudo random number generator with grammatical evolution. Sci. Rep. 12(1), 8602 (2022). https://doi.org/10.1038/s41598-022-11613-x
Seredynski, F., Bouvry, P., Zomaya, A.Y.: Cellular automata computations and secret key cryptography. Parallel Comput. 30(5–6), 753–766 (2004)
Shackleford, B., Tanaka, M., Carter, R.J., Snider, G.: FPGA implementation of neighborhood-of-four cellular automata random number generators. In: Proceedings of the 2002 ACM/SIGDA Tenth International Symposium on Field-programmable Gate Arrays, pp. 106–112. FPGA 2002, ACM (2002)
Shannon, C., Weaver, W.: The mathematical theory of communication. University of Illinois Press (1964)
Wang, Q., Yu, S., Ding, W., Leng, M.: Generating high-quality random numbers by cellular automata with PSO. In: 2008 Fourth International Conference on Natural Computation, vol. 7, pp. 430–433 (2008)
Wertheimer, M.: The mathematics community and the NSA. Not. Am. Math. Soc. 62(2), 165–167 (2015)
Wolfram, S.: Cryptography with cellular automata. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 429–432. Springer, Heidelberg (1986). https://doi.org/10.1007/3-540-39799-X_32
Wolfram, S.: Random sequence generation by cellular automata. Adv. Appl. Math. 7, 123–169 (1986)
Xiao, G.Z., Massey, J.L.: A spectral characterization of correlation-immune combining functions. IEEE Trans. Inf. Theory 34(3), 569–571 (1988)
Yao, A.: Theory and application of trapdoor functions. In: 23d Symposium on Foundations of Computer Science (1982)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Martin, B. (2023). Randomness Quality and Trade-Offs for CA Random String Generators. In: Bournez, O., Formenti, E., Potapov, I. (eds) Reachability Problems. RP 2023. Lecture Notes in Computer Science, vol 14235. Springer, Cham. https://doi.org/10.1007/978-3-031-45286-4_1
Download citation
DOI: https://doi.org/10.1007/978-3-031-45286-4_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-45285-7
Online ISBN: 978-3-031-45286-4
eBook Packages: Computer ScienceComputer Science (R0)