通信学报2016，Vol.37Issue(10)：92-98,7.DOI:10.11959/j.issn.1000-436x.2016200
一类布尔函数的代数免疫度的下界
New bound of algebraic immunity of a class of Boolean function
摘要
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 dis-tance 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分类
信息技术与安全科学引用本文复制引用
田叶,张玉清,胡予濮,伍高飞..一类布尔函数的代数免疫度的下界[J].通信学报,2016,37(10):92-98,7.基金项目
国家自然科学基金资助项目（No.61572460, No.61272481）；国家重点研究计划基金资助项目（No.2016YFB0800703）；国家发展改革委员会信息安全专项基金资助项目（No.(2012)1424）；国家111计划基金资助项目（No.B16037） Foundation Items:The National Natural Science Foundation of China (No.61572460, No.61272481), The National Key Research and Development Project (No.2016YFB0800703), The National Information Security Special Projects of National Development, The Reform Commission of China (No.(2012)1424), China 111 Project (No.B16037) （2012）
