Program. Secret Sharing Scheme

Secret sharing is an important tool for the information security and the data privacy, and it plays an important role in protecting important information and secret data from being lost, destroyed, viciously modified, or into wrong hands. Secret sharing has been one important branch of modern cryptography and also one important research field of information security.In this paper proposed a new secret sharing scheme with using the theorem of weighted threshold and Mignotte row combination with Chinese Remainder theorem. This program resolve the shortcomings questions which the majority of current secret sharing scheme need the participants hold a number of sub-master secrets and the management and delivery are insecurity. In this paper the proposed scheme only requires each participant to hold one single privacy key, which simplifies the management and usage of the privacy key, and use the bulletin boards to avoid the transmission of secret information. Secret distributor can easily change the program's secret information and the threshold, make the management of the program with a great deal of flexibility.Based on a one-dimensional Reversible cellular automata and Chinese remainder theorem, a new secret sharing scheme was proposed in this paper. This program breaks down secret message into a number of sub-secrets. Multiple sub-secrets with the forms of binary text are considered as one of the initial configurations of the reversible cellular automata, evolved the secret shared sharing. At last, the backward iteration of the reversible cellular automata is used to recover the sub-secrets, then reconstruction the secret message.At the end of the paper, implementing the models of the two new programs, computer simulation shows the two programs are correct and feasible with good security.