• CRYPTOGRAPHIC SECRET SHARING SCHEME OF FINITE STATE MACHINES USING LU DECOMPOSITION

Abstract

A secret sharing scheme is a method of distributing a message in parts among participants, each of which is allocated a share of the message.  The message can be accessed completely only when the group of participants come together, thus ensuring the safety of the message.

Automata theory is the study of abstract computing devices or machines. It is a behavior model composed of a finite number of states, transitions between those states, and actions in which one can inspect the way logic runs when certain conditions are met. Recently finite state machines are used in cryptography, not only to encrypt the message, but also to maintain the secrecy of the message.

In this paper, new secret sharing scheme is proposed using finite state machines.