上海交通大学学报

上海交通大学学报（自然版） ›› 2014, Vol. 48 ›› Issue (10): 1434-1439.

• 无线电电子学、电信技术 • 上一篇    下一篇

针对Trivium型密码算法的代数攻击

孙文龙1,2，关杰1   

  1. (1.信息工程大学， 郑州 450000；2. 北京卫星导航中心， 北京 100094)
  • 收稿日期:2013-12-04 出版日期:2014-10-28 发布日期:2014-10-28
  • 基金资助:

    ：国家自然科学基金(No.61202491)，全军军事学研究生课题(2010JY0263149)资助项目

Algebraic Attacks on Trivium-Like Stream Ciphers

SUN Wenlong1,GUAN Jie1   

  1. (1. Information Engineering University, Zhengzhou 450000, China; 2. Beijing Satellite Navigation Center, Beijing 100094, China)
  • Received:2013-12-04 Online:2014-10-28 Published:2014-10-28

摘要：

摘要：  为了更好地研究Trivium算法的设计思想，选取了2个比较典型的修改Trivium算法，连同Trivium算法一起作为研究对象，把恢复算法的内部状态问题转化为可满足性问题，分析修改Trivium算法抵抗代数攻击的能力.比较了6种猜测策略，并且使用MiniSat2.0求解器求解.根据分析结果给出了Trivium型密码算法抵抗代数攻击的安全设计建议.

关键词: 密码分析, 代数攻击, 可满足性问题, 流密码

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.

Key words: cryptanalysis, algebraic attacks, satisfiability problem, stream cipher

中图分类号: