ISCAS OpenIR  > 信息安全国家重点实验室
a new efficient algorithm for computing all low degree annihilators of sparse polynomials with a high number of variables
Xu Lin; Lin Dongdai; Li Xin
2010
会议名称6th International Conference on Information Security Practice and Experience
会议录名称Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码123-137
会议日期MAY 12-13,
会议地点Seoul, SOUTH KOREA
出版地HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY
出版者INFORMATION SECURITY PRACTICE AND EXPERIENCE, PROCEEDINGS
ISSN0302-9743
ISBN978-3-642-12826-4
部门归属Xu, Lin; Lin, Dongdai; Li, Xin Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing 100080, Peoples R China.
摘要Algebraic attacks have proved to be an effective threat to block and stream cipher systems. In the realm of algebraic attacks, there is one major concern that, for a given Boolean polynomial f, if f or f 1 has low degree annihilators. Existing methods for computing all annihilators within degree d of f in n variables, such as Gauss elimination and interpolation, have a complexity based on the parameter k(n,d) = Sigma(d)(i=0) ((n)(i)), which increases dramatically with n. As a result, these methods are impractical when dealing with sparse polynomials with a large n, which widely appear in modern cipher systems. In this paper, we present a new tool for computing annihilators, the characters w.r.t. a Boolean polynomial. We prove that the existence of annihilators of f and f 1 7-esp. relies on the zero characters and the critical characters zu.r.t. f. Then we present a new algorithm for computing annihilators whose complexity relies on lef,d, the number of zero or critical characters within degree d w.r.t.f. Since 16,d << k(n,d) when f is sparse, this algorithm is very efficient for sparse polynomials with a large n. In our experiments, all low degree annihilators of a random balanced sparse polynomial in 256 variables can be found in a few minutes.
关键词Algebraic Attack Annihilator Algebraic Immunity Boolean Polynomial Computational Algebra
主办者Korea Internet & Security Agcy, Elect & Telecommun Res Inst, Korea Inst Informat Security & Cryptography, Korea Commun Commiss
内容类型会议论文
URI标识http://ir.iscas.ac.cn/handle/311060/8616
专题信息安全国家重点实验室
推荐引用方式
GB/T 7714
Xu Lin,Lin Dongdai,Li Xin. a new efficient algorithm for computing all low degree annihilators of sparse polynomials with a high number of variables[C]. HEIDELBERGER PLATZ 3, D-14197 BERLIN, GERMANY:INFORMATION SECURITY PRACTICE AND EXPERIENCE, PROCEEDINGS,2010:123-137.
条目包含的文件
文件名称/大小 文献类型 版本类型 开放类型 使用许可
a new efficient algo(264KB) 开放获取--请求全文
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Xu Lin]的文章
[Lin Dongdai]的文章
[Li Xin]的文章
百度学术
百度学术中相似的文章
[Xu Lin]的文章
[Lin Dongdai]的文章
[Li Xin]的文章
必应学术
必应学术中相似的文章
[Xu Lin]的文章
[Lin Dongdai]的文章
[Li Xin]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

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