Jump to ContentJump to Main Navigation
Show Summary Details
More options …

Groups Complexity Cryptology

Managing Editor: Shpilrain, Vladimir / Weil, Pascal

Editorial Board: Conder, Marston / Dehornoy, Patrick / Eick, Bettina / Fine, Benjamin / Gilman, Robert / Grigoriev, Dima / Ko, Ki Hyoung / Kreuzer, Martin / Mikhalev, Alexander V. / Myasnikov, Alexei / Perret, Ludovic / Roman'kov, Vitalii / Rosenberger, Gerhard / Sapir, Mark / Thomas, Rick / Tsaban, Boaz / Capell, Enric Ventura

2 Issues per year

CiteScore 2016: 0.35

SCImago Journal Rank (SJR) 2016: 0.372
Source Normalized Impact per Paper (SNIP) 2016: 0.517

Mathematical Citation Quotient (MCQ) 2016: 0.23

See all formats and pricing
More options …

Algebraic attacks using SAT-solvers

Philipp Jovanovic / Martin Kreuzer
Published Online: 2010-11-15 | DOI: https://doi.org/10.1515/gcc.2010.016


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

About the article

Received: 2010-07-28

Revised: 2010-10-19

Published Online: 2010-11-15

Published in Print: 2010-12-01

Citation Information: Groups – Complexity – Cryptology, Volume 2, Issue 2, Pages 247–259, ISSN (Online) 1869-6104, ISSN (Print) 1867-1144, DOI: https://doi.org/10.1515/gcc.2010.016.

Export Citation

Comments (0)

Please log in or register to comment.
Log in