Computer Science – Cryptography and Security
Scientific paper
2012-02-18
Computer Science
Cryptography and Security
6 pages
Scientific paper
There are several methods for constructing secret sharing schemes, one of which is based on coding theory. Theoretically, every linear code can be used to construct secret sharing schemes. However, in general, determining the access structures of the schemes based on linear codes is very hard. This paper proposed the concept of minimal linear code, which makes the determination of the access structures of the schemes based on the duals of minimal linear codes easier. It is proved that the shortening codes of minimal linear codes are also minimal ones. Then the conditions whether several types of irreducible cyclic codes are minimal linear codes are presented. Furthermore, the access structures of secret sharing schemes based on the duals of minimal linear codes are studied, and these access structures in specific examples are obtained through programming.
Li Zhihui
Song Yun
No associations
LandOfFree
Secret sharing with a class of minimal linear codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Secret sharing with a class of minimal linear codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secret sharing with a class of minimal linear codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-33031