摘要
本文首次求出了重量为4(或2″—4)和6(或2″—6)的n元相关免疫布尔函数的精确个数。同时还用递归算法改进了现有的下界公式。
The exact numbers of n-variable Boolean functions with correlational immunity are initially found for the cases of weight 4(or 2n-4) and 6(or 2°- 6). The known lower bounds for the enumeration of such Boolean functions are also improved greatly by the recursive algorithms.
基金
国家青年自然基金资助课题
关键词
布尔函数
计数
密码
相关免疫
Boolean functions
Enumeration
Cryptography
Correlation-immunity
