A Threshold Secret Sharing Scheme Based on LMCA and Chinese Remainder Theorem

摘要

In this paper, A new threshold secret sharing scheme is proposed. Based on one-dimensional memory cellular automata, a big secret is decomposed to some sub-secrets using the Chinese remainder theorem. These sub-secrets in the form of binary texts are considered as one of the k initial configurations of the memory cellular automata of k order and then secret shares are evolved. The function of backward iteration of the cellular automata is used to recover these sub-secrets. Moreover, we can reconstruct the shared secret. Analyses show that the proposed scheme can be constructed quickly. It can be applied easily and computed securely.