Abstract
We consider the problem of evolving a particular kind of shift-invariant transformation – namely, Reversible Cellular Automata (RCA) defined by conserved landscape rules – using GA and GP. To this end, we employ three different optimization strategies: a single-objective approach carried out with GA and GP where only the reversibility constraint of marker CA is considered, a multi-objective approach based on GP where both reversibility and the Hamming weight are taken into account, and a lexicographic approach where GP first optimizes only the reversibility property until a conserved landscape rule is obtained, and then maximizes the Hamming weight while retaining reversibility. The results are discussed in the context of three different research questions stemming from exhaustive search experiments on conserved landscape CA, which concern (1) the difficulty of the associated optimization problem for GA and GP, (2) the utility of conserved landscape CA in the domain of cryptography and reversible computing, and (3) the relationship between the reversibility property and the Hamming weight.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Chopard, B.: Cellular automata and lattice Boltzmann modeling of physical systems. In: Rozenberg, G., Bäck, T., Kok, J.N. (eds.) Handbook of Natural Computing, pp. 287–331. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-540-92910-9_9
Landauer, R.: Irreversibility and heat generation in the computing process. IBM J. Res. Dev. 5(3), 183–191 (1961)
Mariot, L., Picek, S., Leporati, A., Jakobovic, D.: Cellular automata based S-boxes. Cryptogr. Commun. 11(1), 41–62 (2018). https://doi.org/10.1007/s12095-018-0311-8
Kari, J.: Reversible cellular automata: from fundamental classical results to recent developments. New Gener. Comput. 36(3), 145–172 (2018). https://doi.org/10.1007/s00354-018-0034-6
Mitchell, M., Crutchfield, J.P., Das, R., et al.: Evolving cellular automata with genetic algorithms: a review of recent work. In: Proceedings of the First International Conference on Evolutionary Computation and Its Applications (EvCA 1996), vol. 8 (1996)
Bäck, T., Breukelaar, R.: Using genetic algorithms to evolve behavior in cellular automata. In: Calude, C.S., Dinneen, M.J., Păun, G., Pérez-Jímenez, M.J., Rozenberg, G. (eds.) UC 2005. LNCS, vol. 3699, pp. 1–10. Springer, Heidelberg (2005). https://doi.org/10.1007/11560319_1
Toffoli, T., Margolus, N.H.: Invertible cellular automata: a review. Phys. D 45(1–3), 229–253 (1990)
Wolfram, S.: Statistical mechanics of cellular automata. Rev. Mod. Phys. 55(3), 601 (1983)
Hedlund, G.A.: Endomorphisms and automorphisms of the shift dynamical systems. Math. Syst. Theory 3(4), 320–375 (1969). https://doi.org/10.1007/BF01691062
Bertoni, G., Daemen, J., Peeters, M., Assche, G.V.: The Keccak reference (2011)
Daemen, J.: Cipher and hash function design strategies based on linear and differential cryptanalysis. Ph.D. thesis, Doctoral Dissertation, KU Leuven, March 1995
Patt, Y.: Injections of neighborhood size three and four on the set of configurations from the infinite one-dimensional tessellation automata of two-state cells. Technical report, Army Electronics Command Fort Monmouth, NJ (1972)
Sipper, M., Tomassini, M.: Co-evolving parallel random number generators. In: Voigt, H.-M., Ebeling, W., Rechenberg, I., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 950–959. Springer, Heidelberg (1996). https://doi.org/10.1007/3-540-61723-X_1058
Picek, S., Mariot, L., Leporati, A., Jakobovic, D.: Evolving S-boxes based on cellular automata with genetic programming. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2017, pp. 251–252 (2017)
Picek, S., Mariot, L., Yang, B., Jakobovic, D., Mentens, N.: Design of S-boxes defined with cellular automata rules. In: Proceedings of the Computing Frontiers Conference, CF 2017, pp. 409–414 (2017)
Mariot, L., Picek, S., Jakobovic, D., Leporati, A.: Evolutionary algorithms for the design of orthogonal latin squares based on cellular automata. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2017, pp. 306–313 (2017)
Picek, S., Carlet, C., Guilley, S., Miller, J.F., Jakobovic, D.: Evolutionary algorithms for Boolean functions in diverse domains of cryptography. Evol. Comput. 24(4), 667–694 (2016)
Mariot, L., Jakobovic, D., Leporati, A., Picek, S.: Hyper-bent Boolean functions and evolutionary algorithms. In: Sekanina, L., Hu, T., Lourenço, N., Richter, H., García-Sánchez, P. (eds.) EuroGP 2019. LNCS, vol. 11451, pp. 262–277. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-16670-0_17
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Mariot, L., Picek, S., Jakobovic, D., Leporati, A. (2020). An Evolutionary View on Reversible Shift-Invariant Transformations. In: Hu, T., Lourenço, N., Medvet, E., Divina, F. (eds) Genetic Programming. EuroGP 2020. Lecture Notes in Computer Science(), vol 12101. Springer, Cham. https://doi.org/10.1007/978-3-030-44094-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-030-44094-7_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-44093-0
Online ISBN: 978-3-030-44094-7
eBook Packages: Computer ScienceComputer Science (R0)