登录 | 注册 | 退出 | 公司首页 | 繁体中文 | 满意度调查
综合馆
利用一种SAT问题全解算法求Trivium可滑动对
  • 摘要

    Trivium是进入到eSTREAM计划最终方案的一个序列密码体制,而在其初始化过程中存在可滑动对.SAT求解器可以有效地求解非线性方程组,然而一般的SAT求解器在求出一个解之后便会结束.对MiniSAT求解器中的算法进行改进,使之可以得出方程所有解.将改进的算法应用于Trivium中可滑动对的求解,得到了初始化拍数从111到120的所有可滑动对.相比于使用Gr(o)bner基方法,求解效率有了极大的提高.

  • 作者

    戴江海  戚文峰  DAI Jiang-hai  QI Wen-feng 

  • 作者单位

    信息工程大学信息工程学院,河南郑州,450002

  • 刊期

    2012年1期

  • 关键词

    SAT问题  MiniSAT  序列密码  Trivium  可滑动对 

参考文献
  • [1] Cook S A. The complexity of theorem-proving procedures. 1971
  • [2] Courtois N;O Neil S;Quisquater J J. Practical algebraic attacks on the HiTag2 stream cipher. 2009
  • [3] Dinur I;Shamir A. Cubic Attacks on Tweakable Black Box Polynomials. 2009
  • [4] Aumasson J P;Meier W;Dinur I. Cube Testers and Key Recovery Attacks on Reduced Round MD6 and Trivium. 2009
  • [5] Priemuth S D;Biryukov A. Slid Pairs in Salsa20 and Trivium. 2008
  • [6] Eén N;S(o)rensson N. An extensible SAT-solver. 2003
  • [7] Davis M;Logemann G;Loveland D. A machine program for theorem proving. Communications of the ACM, 1962,07
  • [8] McMillan K. Applying SAT methods in unbounded symbolic model checking. Computer Aided Verification, 2002
  • [9] Soos M. SAT Solvers in the Context of Cryptography. Presentation for Rennes's Cryptography Seminar.Rennes,France, 2010
  • [10] Zhao W;Wu W. ASIG:An all-solution SAT solver for CNF formulas. Computer Aided Design and Computer Graphics, 2009
  • [11] Grumberg O;Schuster A;Yadgar A. Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis. 2004
  • [12] Zhang L. Searching for Truth:techniques for satisfiability of boolean formulas. Ph.D.Thesis,Princeton University, 2003
  • [13] Jin H. Discussion Forum.Certain pairs of key-Ⅳ pairs for Trivium[05:11PM September 13]. 2005
  • [14] Srensson N;Eén N. Minisat vl.13-A SAT solver with conflict-clause minimization[SAT 2005]. 2005
  • [15] Courtois N T;Klimov A;Patarin J. Efficient algorithms for solving overdefined systems of multivariate polynomial equations. 2000
  • [16] Kipnis A;Shamir A. Cryptanalysis of the HFE public key cryptosystem by relinearization. 1999
  • [17] McDonald C;Charnes C;Pieprzyk J. Attacking Bivium with MiniSat[Tech.Rep.2007/040]. ECRYPT Stream Cipher Project, 2007
  • [18] Estream. The ECRYPT stream cipher project. http://www.ecrypt.eu.org/stream/, 2011-05-10
  • [19] Shamir A. How to solve it:New techniques in algebraic cryptanalysis. Invited talk at CRYPTO 2008
  • [20] Adams W W;Loustaunau P. An introduction to grobner bases. USA:AMS, 1994
  • [21] Bard G V;Courtois N T;Jefferson C. Efficient Methods for Conversion and Solution of Sparse Systems of Low-Degree Multivariate Polynomials over GF(2) via SAT-Solvers. Cryptology ePrint Archive,Report 2007/024, 2007
  • [22] Courtois N;Bard G V;Wagner D. Algebraic and slide attacks on KeeLoq. 2008
  • [23] Soos M;Nohl K;Castelluccia C. Extending SAT solvers to cryptographic problems. 2009
查看更多︾
相似文献 查看更多>>
18.232.188.251