arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0608080cs.CR
收藏

布尔函数代数免疫性的下界

Lower Bounds on the Algebraic Immunity of Boolean Functions

Hao Chen, Jianhua Li

摘要:

从对流密码和分组密码进行代数攻击的动机出发([1,2,7,13,14,15]),在[21]中引入了{ \em代数免疫}(AI)的概念,并在[3,5,10,11,17,18,19,20,21]中进行了研究。高代数免疫性是抵抗代数攻击的必要条件。本文给出了布尔函数代数免疫的一些下界。应用所得结果给出了对称布尔函数和旋转对称布尔函数的AI下界。构造了AI接近最大可能值$\lceil \frac{n}{2}\rceil$的平衡旋转对称布尔函数.

英文摘要:

From the motivation of algebraic attacks to stream and block ciphers([1,2,7,13,14,15]), the concept of {\em algebraic immunity} (AI) was introduced in [21] and studied in [3,5,10,11,17,18,19,20,21]. High algebraic immunity is a necessary condition for resisting algebraic attacks. In this paper, we give some lower bounds on algebraic immunity of Boolean functions. The results are applied to give lower bounds on AI of symmetric Boolean functions and rotation symmetric Boolean functions. Some balanced rotation symmetric Boolean functions with their AI near the maximum possible value $\lceil \frac{n}{2}\rceil$ are constructed.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑