摘要
本文对扩散码密码体制中多列扩散码组合对布尔函数次数的影响进行了探讨，引入了单项、多项和函数的组合约化的概念，探讨了组合约化的条件，给出了在扩散码列的任意线性组合下布尔函数厂次可约性的检验方法．并获得了一个布尔函数和扩散码的充分条件，在这个条件下对任意的线性组合布尔函数的次数不低于厂．文未给出了说明检验方法的实例．
The effect of the combinations of the rows of diffusion codes on the degree of Boolean functions is studied in this paper. The idea of combinatorial reduction of single terms, multiple terms and functions is introduced. The conditions of combinatorial reduction is discussed. The test method of r-degree reducibility of the Boolean function under arbitrary linear combinations of rows of diffusion code is given. A sufficient condition of Boolean functions and diffusion codes is obtained, under which the degree of Boolean function after arbitrary linear combinations will be not lower than r. The examples which illustrate the test method are given at the end of the paper.
出处
《计算机学报》
EI
CSCD
北大核心
1999年第4期337-342,共6页
Chinese Journal of Computers
关键词
扩散码
布尔函数
组合安全性
密码学
Diffusion codes, Boolean function, combinatorial security, cryptography
