在一般随机布尔函数及布尔函数的代数次数或代数标准型项数受限情况下,从理论上分析了立方攻击的成功概率,对立方攻击密码分析方法提供了理论支持。理论结果与对流密码算法Trivium及Grain v1的实验结果是相吻合的。
The success probability of cube attack was theoretically discussed when a boolean function was chosen at random and the algebraic degree or the number of terms in its algebraic normal form representation was restricted. The results provided theoretic support to cube attack. The theoretical results meet with the experimental results of the analysis of the stream ciphers Trivium and Grain vl very closely.