Sharing secrets using elementary cellular automata
In this paper, a new cryptographic protocol to securely share a secret among a set of participants is presented. It is based on the use of non-reversible elementary cellular automata with rule numbers 90 and 150. The protocol is shown to be perfect and ideal.
elementary cellular automata secret sharing threshold schemes cryptography