布尔函数的迹单项式逼近

Trace Function Monomials Approximation of Boolean Functions

提出了用单项迹函数代替线性函数来定义的布尔函数一种新的谱值,称之为布尔函数的d-Walsh循环谱,通过计算d-Walsh循环谱来研究布尔函数的最佳单项迹函数逼近,使用该方法的计算复杂性仅为22n/n.利用单项迹函数逼近序列密码的前馈函数可实现对序列密码的采样攻击,对序列密码设计与分析具有重要意义.

A new spectrum of Boolean function was presented by monomial trace function instead of linear function. The new spectrum was called as d -Walsh cyclic spectrum. Trace function monomials best approximation of Bollean function was investigated and found ty computiong d-Walsh cyclic spectrurll and the computallonal complexity was just2^2n/n.By monomial trace function approximating the feedforward function of stream cipher ,it is possible to commit a decimation attack on stram ciphel,wliich may have important implications ofr cipher design and analysis.