通信学报 ›› 2016, Vol. 37 ›› Issue (10): 92-98.doi: 10.11959/j.issn.1000-436x.2016200

• 学术论文 • 上一篇    下一篇

一类布尔函数的代数免疫度的下界

田叶1,张玉清1,2,胡予濮1,伍高飞1   

  1. 1 西安电子科技大学综合业务网理论及关键技术国家重点实验室,陕西 西安 710071
    2 中国科学院大学国家计算机网络入侵防范中心,北京 101408
  • 出版日期:2016-10-25 发布日期:2016-10-25
  • 基金资助:
    国家自然科学基金资助项目;国家自然科学基金资助项目;国家重点研究计划基金资助项目;国家发展改革委员会信息安全专项基金资助项目;国家111计划基金资助项目

New bound of algebraic immunity of a class of Boolean function

Ye TIAN1,Yu-qing ZHANG1,2,Yu-pu HU1,Gao-fei WU1   

  1. 1 State Key Laboratory of Integrated Services Networks,Xidian University,Xi’an 710071,China
    2 National Computer Network Intrusion Protection Center,University of Chinese Academy of Sciences,Beijing 101408,China
  • Online:2016-10-25 Published:2016-10-25
  • Supported by:
    The National Natural Science Foundation of China;The National Natural Science Foundation of China;The National Key Research and Development Project;The National Information Security Special Projects of National Development,The Reform Commission of China;China 111 Project

摘要:

代数免疫度是衡量布尔函数抵抗代数攻击的重要指标。最近,Mesnager等研究了布尔函数的零化子与函数所对应循环码最小距离之间的联系,代数免疫度的下界可以由对应的循环码的最小距离得到。解决了Mesnager提出的一个公开问题,给出了一类特定函数的零化子次数的下界,并得到一类布尔函数的代数免疫度的下界。

关键词: 密码学, 布尔函数, 零化子, 代数免疫度, 循环码, 最小距离

Abstract:

Algebraic immunity quantified the resistance of a Boolean function to the algebraic attack.Recently,Mesnager,et al showed that there were direct linked between the annihilators used in algebraic attacks and the coding theory.They showed that the lower bound of the algebraic immunity of Boolean functions could been derived from the minimum distance of the associated cyclic codes.An open problem proposed by Mesnager is settled with a detailed proof.Also,a lower bound of algebraic immunity of a class of Boolean functions will be introduced.

Key words: cryptography, Boolean functions, annihilators, algebraic immunity, cyclic code, minimum distance

No Suggested Reading articles found!