Details:
Title | Algebraic attacks using SAT-solvers. | Author(s) | Philipp Jovanovic, Martin Kreuzer | Type | Article in Journal | Abstract | Algebraic attacks lead to the task of solving polynomial systems over 𝔽2. We study recent suggestions of using SAT-solvers for this task. In particular, we develop several strategies for converting the polynomial system to a set of CNF clauses. This generalizes the approach in [Bard, Courtois, Jefferson, Cryptology ePrint Archive 2007, 2007]. Moreover, we provide a novel way of transforming a system over 𝔽2e to a (larger) system over 𝔽2. Finally, the efficiency of these methods is examined using standard examples such as CTC, DES, and Small Scale AES. | Keywords | Algebraic cryptanalysis; SAT solver; AES; polynomial system solving | ISSN | 1867-1144; 1869-6104/e |
URL |
http://www.degruyter.com/view/j/gcc.2010.2.issue-2/gcc.2010.016/gcc.2010.016.xml |
Language | English | Journal | Groups Complex. Cryptol. | Volume | 2 | Number | 2 | Pages | 247--259 | Publisher | De Gruyter, Berlin | Year | 2010 | Edition | 0 | Translation |
No | Refereed |
No |
|