The least-squares solutions in linear codes based multisecret-sharing approach (Q2024770)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The least-squares solutions in linear codes based multisecret-sharing approach |
scientific article; zbMATH DE number 7343546
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The least-squares solutions in linear codes based multisecret-sharing approach |
scientific article; zbMATH DE number 7343546 |
Statements
The least-squares solutions in linear codes based multisecret-sharing approach (English)
0 references
4 May 2021
0 references
Summary: 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.
0 references
secret sharing
0 references
multisecret-sharing scheme
0 references
linear code
0 references
generalised inverses of matrices
0 references
