首页 | 本学科首页   官方微博 | 高级检索  
     检索      

布尔函数的迹单项式逼近
引用本文:祁传达,袁小转,邵辉.布尔函数的迹单项式逼近[J].信阳师范学院学报(自然科学版),2014(3):440-443.
作者姓名:祁传达  袁小转  邵辉
作者单位:信阳师范学院数学与信息科学学院,河南信阳,464000
基金项目:国家自然科学基金项目(61272465);河南省自然科学基金项目
摘    要:提出了用单项迹函数代替线性函数来定义的布尔函数一种新的谱值,称之为布尔函数的d-Walsh循环谱,通过计算d-Walsh循环谱来研究布尔函数的最佳单项迹函数逼近,使用该方法的计算复杂性仅为22n/n.利用单项迹函数逼近序列密码的前馈函数可实现对序列密码的采样攻击,对序列密码设计与分析具有重要意义.

关 键 词:布尔函数  d-Walsh谱  迹函数  单项迹函数逼近

Trace Function Monomials Approximation of Boolean Functions
Qi Chuanda,Yuan Xiaozhuan,Shao Hui.Trace Function Monomials Approximation of Boolean Functions[J].Journal of Xinyang Teachers College(Natural Science Edition),2014(3):440-443.
Authors:Qi Chuanda  Yuan Xiaozhuan  Shao Hui
Institution:Qi Chua;Yuan Xiaozhuan;Shao Hui;College of Mathematics and Information Science,Xinyang Normal University;
Abstract: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 Boolean 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 commit a decimation attack on stream cipher,which may have important implications for cipher design and analysis.
Keywords:Boolean function  d-Walsh spectrum  trace function  trace function monomials approximation
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号