Autómatas celulares y aplicaciones

Un autómata celular es un modelo matemático para un sistema dinámico que evoluciona en pasos discretos. Este trabajo presenta una aplicación de los autómatas celulares para el cifrado de información y el reparto de secretos. Se detalla un ejemplo didáctico de su aplicación para el cifrado de secretos empleando imágenes digitales. El desarrollo de este trabajo ha servido como actividad académica dirigida a alumnado de Ingeniería en Informática, para fomentar su interés en la criptografía mediante herramientas matemáticas estudiadas a lo largo de su carrera

Designing Robust LMCA-based Threshold Secret Sharing Scheme for Digital Images Using Multiple Configurations Assignment

In this paper, we present a new (t,n)-threshold secret images sharing scheme based on linear memory cellular automata (LMCA). While all existing LMCA-based sharing scheme are not robust, the proposed one provides full robustness property. Precisely, any subset of t participants can collude to recover the shared secret, in contrast to existing LMCA-based schemes when this is possible only for participants having consecutive shares. To achieve robustness, produced shares are constructed using subsets of different LMCA’s configurations instead of using single ones. The subsets are defined according to an assignments matrix that is generated using a specific heuristic. The proposed scheme is shown to be robust, and its security is experimentally evaluated with respect to the problem of secret color image sharing. Obtained results illustrate the secrecy of the produced shares, while comparison gives an accurate evaluation with respect to existing schemes

A New Secret Sharing Scheme for Images Based on Additive 2-Dimensional Cellular Automata

En: Pattern Recognition and Image Analysis – Lecture Notes in Computer Science 3522 (2005), 411-418.A new secret color image sharing scheme based on two-dimensional memory cellular automata, is proposed. Such protocol is of a (n,n)-threshold scheme where the secret image to be shared is considered as one of the initial configurations of the cellular automata. The original idea is to study how a reversible model of computation permits to compute the shares and then using the reverse computation in order to recover the original image. The scheme is proved to be perfect and ideal, and resistant to the most important attacks such as statistical attacks.This work has been supported by Ministerio de Educación y Ciencia (Spain) under grant SEG2004-02418, and by the Consejer´ıa de Educación y Cultura of Junta de Castilla y León (Spain), under grant SA052/03.Peer reviewe