The least-squares solutions in linear codes based multisecret-sharing approach.

The theory of generalised inverses of matrices has been applied in many areas since 1950. Some of them are Markov chains, robotics differential equations, etc. Especially, the applications over finite fields of this theory have an important role in cryptography and coding theory. In this work, we study a new multisecret-sharing scheme by using the generalised inverses of matrices and least-squares solutions in linear codes. We determine the access structure. Its security improves on that of multisecret-sharing schemes.