电子学报2013，Vol.41Issue(2)：220-226,7.DOI:10.3969/j.issn.0372-2112.2013.02.003
基于极小线性码上的秘密共享方案
Secret Sharing Schemes Based on Minimal Linear Codes
摘要
Abstract
Theoretically, every linear code can be used to construct secret sharing schemes.However,determining the access structure of the schemes based on linear codes is very hard. The concept of minimal linear code is proposed, which makes the determination of the access structure of the schemes based on the duals of minimal linear codes easier. It is shown that the shortening codes of minimal linear codes are minimal as well. Then the conditions whether several types of irreducible cyclic codes are minimal or not are presented. Furthermore, the access structures of secret sharing schemes based on the duals of minimal linear codes are studied. Finally,the access structures of the schemes in specific examples are obtained through programming.关键词
极小线性码/存取结构/极小码字/秘密共享方案/不可约循环码Key words
minimal linear code/access structures/minimal codeword/secret sharing scheme/irreducible cyclic codes分类
信息技术与安全科学引用本文复制引用
宋云,李志慧,李永明..基于极小线性码上的秘密共享方案[J].电子学报,2013,41(2):220-226,7.基金项目
国家自然科学基金(No.60873119) （No.60873119）
