Reversibility of a family of 2D cellular automata hybridized by diamond and cross rules over finite fields and an application to visual cryptography

This article studies the behavior of two-dimensional finite cellular automata defined by two special family of rules under null boundary condition. The rule matrices of these families of two-dimensional hybrid cellular automata composed by diamond and cross rules respectively over the finite field Fp (p prime) are established. Further, explicit formulae that gives the rank of these rule matrices are provided. Hence, we are able to determine the reversibility of these cellular automata. Finally, we conclude by presenting an application of this family to pseudo random number generators applied to visual cryptography. © 2019 Old City Publishing, Inc.