首页> 外文期刊>Designs, Codes and Crytography >Linear codes from weakly regular plateaued functions and their secret sharing schemes
【24h】

Linear codes from weakly regular plateaued functions and their secret sharing schemes

机译:弱定期奏纹函数的线性码及其秘密共享方案

获取原文
获取原文并翻译 | 示例
           

摘要

Linear codes, the most significant class of codes in coding theory, have diverse applications in secret sharing schemes, authentication codes, communication, data storage devices and consumer electronics. The main objectives of this paper are twofold: to construct three-weight linear codes from plateaued functions over finite fields, and to analyze the constructed linear codes for secret sharing schemes. To do this, we generalize the recent contribution of Mesnager given in (Cryptogr Commun 9(1):71-84, 2017). We first introduce the notion of (non)-weakly regular plateaued functions over Fp, with p being an odd prime. We next construct three-weight linear p-ary (resp. binary) codes from weakly regular p-ary plateaued (resp. Boolean plateaued) functions and determine their weight distributions. We finally observe that the constructed linear codes are minimal for almost all cases, which implies that they can be directly used to construct secret sharing schemes with nice access structures. To the best of our knowledge, the construction of linear codes from plateaued functions over Fp, with p being an odd prime, is studied in this paper for the first time in the literature.
机译:线性码,编码理论中最重要的代码,具有秘密共享方案,认证代码,通信,数据存储设备和消费电子产品的不同应用程序。本文的主要目的是双重的:从有限的领域构成有限函数的三重线性码,并分析秘密共享方案的构建线性码。为此,我们概括了MESnager在(Cryptogr Commer 9(1):71-84,2017)中的最新贡献。我们首先介绍了(非) - 派出的概念,在FP上,P是一个奇数的素数。我们接下来构建三重线性p-ary(resp.finary)代码从弱常规的p-ary plateauide(resp.boolean plateauzed)函数,并确定其权重分布。我们终于观察到构造的线性码几乎所有情况都很短暂,这意味着它们可以直接用于构建具有很好的访问结构的秘密共享方案。据我们所知,在文献中,本文首次研究了来自FP的Plateauzed功能的线性码的构建,并在文献中首次在本文中进行了奇数。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号