“…The set {C 0 ,C 1 ,.....,C t-1 } is then used to build an (n+t-1)-th order evolution of the LMCA to obtain a set of n consecutive configuration {C t ,C t+1 ,.....,C n+t-1 } distributed among the n participants. When required, any set of t consecutive configurations {C t+ ,C t++1 ,.....,C 2t+-1 } is used to define a set {̃( 0) ,̃( 1) , … ,̃( −1) } as the initial configuration to run the inverse LMCA backward for +t iterations and recover the secret [5]. The set of t-1 transition rules used for the LMCA evolution 1, 2,....., t-1 is generated initially by the dealer and made public without affecting the security of the scheme.…”