A Multi-secret Sharing Scheme Based on Cellular Automata
一个基于细胞自动机的多秘密共享方案

Based on a one-dimensional cellular automata and the Chinese remainder theorem,a new multi-secret sharing scheme was proposed in this paper.Multiple secrets are packed into one big secret,which is considered as one of the initial configurations of the cellular automata;the backward iteration of the cellular automata is used to recover the shared secrets.Analyses show the proposed scheme can be implemented easily,and is a computationally secure and perfect one.