CORC  > 软件研究所  > 信息安全国家重点实验室  > 期刊论文
寻找布尔函数的零化子
谢佳 ; 王天择
刊名电子学报
2010
卷号38期号:11页码:2686-2690
关键词代数攻击 零化子 代数免疫阶Algebra Boolean functions Cryptography
ISSN号3722112
中文摘要通过解方程组来研究密码系统,是代数攻击的研究内容代.对方程组降次是降低求解复杂度的一种重要方法.为了达到这个目的,引入了布尔函数零化子的概念.然而迄今为止,尚未有求解零化子的有效算法.这篇文章提出了一种计算给定布尔函数的零化子集的算法.由前两个算法,可以得到给定布尔函数的零化子集的一组基;从第三个算法,可以得到最低次数的零化子.算法的复杂度与函数的单项式个数相关.对流密码来说,在很多情况下,相比以前的算法而言,这种算法的复杂度大为降低.最后,我们将给出一个实例,说明算法是如何工作的.
语种中文
公开日期2011-05-23
附注Algebraic attack is used to study cryptosystems by solving equations. To lower the degrees of the equations is an important method to reduce the complexity to solve them. Annihilators is introduced to reach this aim, but there is not an efficient way to find the annihilators of a boolean function up to now. The article presents a kind of algorithm to work out the space of the annihilators of a given boolean function. We can find a basis of the annihilators set by the former two algorithms. Using the third algorithm, we can find the annihilators with lowest degree. The complexity is concerned with the number of monomials in the boolean function, and it is greatly reduced than that of the algorithms before in most cases for stream ciphers. We will present a toy example at the end of the article to show how the third algorithm works.
内容类型期刊论文
源URL[http://124.16.136.157/handle/311060/10040]  
专题软件研究所_信息安全国家重点实验室_期刊论文
推荐引用方式
GB/T 7714
谢佳,王天择. 寻找布尔函数的零化子[J]. 电子学报,2010,38(11):2686-2690.
APA 谢佳,&王天择.(2010).寻找布尔函数的零化子.电子学报,38(11),2686-2690.
MLA 谢佳,et al."寻找布尔函数的零化子".电子学报 38.11(2010):2686-2690.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace