求布尔函数零化子的一种算法以及一类代数攻击不变量
doi: 10.3724/SP.J.1146.2005.01134
An Algorithm to Determine the Annihilators of Boolean Function and a Class of Invariants of Algebraic Attacks
-
摘要: 该文首先给出了一种新的求布尔函数代数次数d的零化子的算法,并且利用布尔函数的特征矩阵得到了低次零化子存在性的判别条件。其次,该文通过研究(5,1,3,12)旋转对称饱和最优函数的代数免疫和一类构造函数的代数免疫,证明了一类函数为代数攻击不变量,并对此性质作了进一步推广。
-
关键词:
- 代数攻击;零化子;代数攻击不变量
Abstract: In this paper, a new algorithm to construct the annihilators of Boolean function is introduced, and using the feature matrix of Boolean function, a method to judge whether a Boolean function has low degree annihilators is presented. Then, by studying the algebraic immunities of (5,1,3,12) rotation symmetric saturated best functions and a type of constructed functions, a class of functions are proved to be invariants of algebraic attacks, and this property is generalized in the end. -
计量
- 文章访问数: 3304
- HTML全文浏览量: 59
- PDF下载量: 609
- 被引次数: 0