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

针对Trivium型密码算法的代数攻击
引用本文:孙文龙,关杰. 针对Trivium型密码算法的代数攻击[J]. 上海交通大学学报, 2014, 48(10): 1434-1439
作者姓名:孙文龙  关杰
作者单位:(1.信息工程大学, 郑州 450000;2. 北京卫星导航中心, 北京 100094)
基金项目:国家自然科学基金(No.61202491);全军军事学研究生课题(2010JY0263-149)资助项目
摘    要:为了更好地研究Trivium算法的设计思想,选取了2个比较典型的修改Trivium算法,连同Trivium算法一起作为研究对象,把恢复算法的内部状态问题转化为可满足性问题,分析修改Trivium算法抵抗代数攻击的能力.比较了6种猜测策略,并且使用MiniSat2.0求解器求解.根据分析结果给出了Trivium型密码算法抵抗代数攻击的安全设计建议.

关 键 词:密码分析   代数攻击   可满足性问题   流密码  
收稿时间:2013-12-04

Algebraic Attacks on Trivium-Like Stream Ciphers
SUN Wen-long,;GUAN Jie. Algebraic Attacks on Trivium-Like Stream Ciphers[J]. Journal of Shanghai Jiaotong University, 2014, 48(10): 1434-1439
Authors:SUN Wen-long,  GUAN Jie
Affiliation:(1. Information Engineering University, Zhengzhou 450000, China; 2. Beijing Satellite Navigation Center, Beijing 100094, China)
Abstract:Trivium stream cipher is one of the finalists of European eSTREAM project. In order to have a better study of the design ideas of Trivium, two revised Trivium algorithms were typically chosen together with Trivium as the targets. The recovery of internal state was converted into the SAT problem to analyze the security of Trivium-like stream ciphers against algebraic attacks. Six guess strategies were tried, and then the equation systems were fed to MiniSat2.0. Finally, some suggestions for the security of Trivium like stream ciphers against algebraic attack were given according to the results.
Keywords:cryptanalysis  algebraic attacks  satisfiability problem  stream cipher  
本文献已被 CNKI 等数据库收录!
点击此处可从《上海交通大学学报》浏览原始摘要信息
点击此处可从《上海交通大学学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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