Welch sets for random generation and representation of reversible one-dimensional cellular automata

Abstract Reversible one-dimensional cellular automata are studied from the perspective of Welch Sets. This paper presents an algorithm to generate random Welch sets that define a reversible cellular automaton. Then, properties of Welch sets are used in order to establish two bipartite graphs describing the evolution rule of reversible cellular automata. The first graph gives an alternative representation for the dynamics of these systems as block mappings and shifts. The second graph offers a compact representation for the evolution rule of reversible cellular automata. Both graphs and their matrix representations are illustrated by the generation of random reversible cellular automata with 6 and 18 states.

[1]  Juan Carlos Seck Tuoh Mora,et al.  Procedures for calculating reversible one-dimensional cellular automata , 2005 .

[2]  Amina Souyah,et al.  Fast and efficient randomized encryption scheme for digital images based on Quadtree decomposition and reversible memory cellular automata , 2015, Nonlinear Dynamics.

[3]  Jarkko Kari,et al.  A Tight Linear Bound on the Neighborhood of Inverse Cellular Automata , 2005, ICALP.

[4]  Jarkko Kari,et al.  Conservation Laws in Rectangular CA , 2008, J. Cell. Autom..

[5]  J. Kari.  Representation of reversible cellular automata with block permutations , 1996, Mathematical systems theory.

[6]  Ziba Eslami,et al.  An authenticated image encryption scheme based on chaotic maps and memory cellular automata , 2013 .

[7]  Xingyuan Wang,et al.  A novel image encryption algorithm using chaos and reversible cellular automata , 2013, Commun. Nonlinear Sci. Numer. Simul..

[8]  Mehmet E. Koroglu,et al.  Error Correcting Codes via Reversible Cellular Automata Over Finite Fields , 2013, Arabian Journal for Science and Engineering.

[9]  Masakazu Nasu,et al.  Local maps inducing surjective global maps of one-dimensional tessellation automata , 1977, Mathematical systems theory.

[10]  Ramón Alonso-Sanz.  Reversible cellular automata with memory of delay type , 2014, Complex..

[11]  G. A. Hedlund.  Endomorphisms and automorphisms of the shift dynamical system , 1969, Mathematical systems theory.

[12]  G. Rodríguez Sánchez,et al.  Reversible elementary cellular automaton with rule number 150 and periodic boundary conditions over p , 2015 .

[13]  Tim Boykett,et al.  Efficient exhaustive listings of reversible one dimensional cellular automata , 2004, Theor. Comput. Sci..

[14]  Chao Wang,et al.  Reversibility of general 1D linear cellular automata over the binary field Z2 under null boundary conditions , 2015, Inf. Sci..

[15]  Tim Boykett.  Orderly Algorithm to Enumerate Central Groupoids and Their Graphs , 2004 .

[16]  Tim Boykett,et al.  Rectangular groupoids and related structures , 2013, Discret. Math..

[17]  Kamel Mohamed Faraoun.  Design of fast one-pass authenticated and randomized encryption schema using reversible cellular automata , 2014, Commun. Nonlinear Sci. Numer. Simul..

[18]  Ingo Wegener,et al.  Randomized local search, evolutionary algorithms, and the minimum spanning tree problem , 2004, Theor. Comput. Sci..

[19]  Juan Carlos Seck Tuoh Mora,et al.  Invertible behavior in elementary cellular automata with memory , 2012, Inf. Sci..

[20]  Xing Zhang,et al.  A New Public Key Encryption Scheme based on Layered Cellular Automata , 2014, KSII Trans. Internet Inf. Syst..

[21]  Mingchu Li,et al.  A Reversible Steganography Scheme of Secret Image Sharing Based on Cellular Automata and Least Significant Bits Construction , 2015 .

[22]  Kamel Mohamed Faraoun,et al.  Fast encryption of RGB color digital images using a tweakable cellular automaton based schema , 2014 .