Sharing Secrets by Computing Preimages of Bipermutive Cellular Automata
A secret sharing scheme based on one-dimensional bipermutive cellular automata is discussed in this paper. The underlying idea is to represent the secret as a configuration of a bipermutive CA and to iteratively apply a preimage computation algorithm until a sufficiently long configuration to be splitted among the participants is obtained. The scheme is proved to be both perfect and ideal, and a simple extension is shown to induce a sequential access structure which eventually becomes cyclic, where the upper bound on the length of the cycles depends on the radius of the adopted local rule.
KeywordsCellular automata cryptography secret sharing schemes bipermutivity preimage computation cyclic access structure
Unable to display preview. Download preview PDF.
- 1.Blakley, G.: Safeguarding cryptographic keys. In: Proceedings of the 1979 AFIPS National Computer Conference, pp. 313–317. AFIPS Press, Monval (1979)Google Scholar
- 5.Gutowitz, H.: Cryptography with dynamical systems. In: Goles, E., Boccara, N. (eds.) Cellular Automata and Cooperative Phenomena, pp. 237–274. Kluwer Academic Press (1993)Google Scholar
- 9.Stinson, D.R.: Cryptography: theory and practice, 3rd edn. CRC Press, Boca Raton (2006)Google Scholar