CAJ | 학술논문

提出了用单项迹函数代替线性函数来定义的布尔函数一种新的谱值，称之为布尔函数的d-Walsh循环谱，通过计算d-Walsh循环谱来研究布尔函数的最佳单项迹函数逼近，使用该方法的计算复杂性仅为22n/n 。利用单项迹函数逼近序列密码的前馈函数可实现对序列密码的采样攻击，对序列密码设计与分析具有重要意义。
제출료용단항적함수대체선성함수래정의적포이함수일충신적보치，칭지위포이함수적d-Walsh순배보，통과계산d-Walsh순배보래연구포이함수적최가단항적함수핍근，사용해방법적계산복잡성부위22n/n 。이용단항적함수핍근서렬밀마적전궤함수가실현대서렬밀마적채양공격，대서렬밀마설계여분석구유중요의의。
A new spectrum of Boolean function was presented by monomial trace function instead of linear func -tion.The new spectrum was called as d-Walsh cyclic spectrum .Trace function monomials best approximation of Boole-an function was investigated and found by computing d-Walsh cyclic spectrum and the computational complexity was just 22n/n .By monomial trace function approximating the feedforward function of stream cipher , it is possible to com-mit a decimation attack on stream cipher , which may have important implications for cipher design and analysis .