A (2, n)-SECRET SHARING SCHEME BASED ON LINEAR CELLULAR AUTOMATA
An algorithm to share a secret among a set of users is introduced in this work. It is based on the use of linear cellular automata over the finite set F(2) and it is considered as a generalization of a previous work due to the authors dealing with an elementary cellular automata-based secret sharing scheme. The algorithm is shown to be secure, ideal, and perfect.
secret sharing linear cellular automata threshold schemes cryptography