| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9506338 | Applied Mathematics and Computation | 2005 | 9 Pages |
Abstract
A new secret sharing scheme based on a particular type of discrete delay dynamical systems: memory cellular automata, is proposed. Specifically, such scheme consists of a (k, n)-threshold scheme where the text to be shared is considered as one of the k initial conditions of the memory cellular automata and the n shares to be distributed are n consecutive configurations of the evolution of such cellular automata. It is also proved to be perfect and ideal.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
A. MartÃn del Rey, J. Pereira Mateus, G. RodrÃguez Sánchez,