Bent函数数目的一个最好可能上界

A Best Possible Upper Bound on Bent Functions

依据Bent函数的特征矩阵,利用组合数学中的容斥原理和图论中的子图概念,给出在流密码学中有重要应用的Bent函数数目的一个上界,计算实例说明该上界是最好可能的上界。

An upper bound on Bent functions,which is important in stream ciphers,is given with help of the characteristic matrix of Bent functions,the inclusion-exclusion principle in combinational mathematics and subgraph in graph theory.Examples show that the upper bound is best possible.