摘要
旋转对称布尔函数在现代密码学中有重要的应用价值。给出了关于任意2次单轨道旋转对称布尔函数快速求值的算法,并得到了其重量的递归关系。结论提高了对2次单轨道旋转对称布尔函数求值的速度,有助于研究一般旋转对称布尔函数的重量和非线性度。
Rotation symmetric Boolean functions have important applications in modern cryptosystems.The fast evaluation algorithm of any quadratic single orbit rotation symmetric Boolean functions is given in this paper,and the recurrence relations of their weights are also proposed.The results in this paper can increase the speed of the evaluation of quadratic single orbit rotation symmetric Boolean functions.The method in this paper can be applied in further research on weights and nonlinearity of general rotation symmetric Boolean functions.
出处
《信息工程大学学报》
2012年第2期129-133,140,共6页
Journal of Information Engineering University
基金
国家自然科学基金资助项目(60803154)
关键词
旋转对称布尔函数
汉明重量
快速求值
递归关系
rotation symmetric Boolean functions
Hamming weight
fast evaluation
recurrence relation