## CryptoDB

### Paper: Improved Algebraic Cryptanalysis of QUAD, Bivium and Trivium via Graph Partitioning on Equation Systems

Authors: Kenneth Koon-Ho Wong Gregory V. Bard URL: http://eprint.iacr.org/2010/349 Search ePrint Search Google We present a novel approach for solving systems of polynomial equations via graph partitioning. The concept of a variable-sharing graph of a system of polynomial equations is defined. If such graph is disconnected, then the corresponding system of equations can be split into smaller ones that can be solved individually. This can provide a significant speed-up in computing the solution to the system, but is unlikely to occur either randomly or in applications. However, by deleting a certain vertices on the graph, the variable-sharing graph could be disconnected in a balanced fashion, and in turn the system of polynomial equations are separated into smaller ones of similar sizes. In graph theory terms, this process is equivalent to finding balanced vertex partitions with minimum-weight vertex separators. The techniques of finding these vertex partitions are discussed, and experiments are performed to evaluate its practicality for general graphs and systems of polynomial equations. Applications of this approach in algebraic cryptanalysis on symmetric ciphers are presented. For the QUAD family of stream ciphers, we show how a malicious party can manufacture conforming systems that can be easily broken. For the stream cipher Trivium and its variants, we achieve significant speedups in algebraic attacks launched against them. In each of these cases, the systems of polynomial equations involved are well-suited to our graph partitioning method. These results may open a new avenue for evaluating the security of symmetric ciphers against algebraic attacks.
##### BibTeX
@misc{eprint-2010-23250,
title={Improved Algebraic Cryptanalysis of QUAD, Bivium and Trivium via Graph Partitioning on Equation Systems},
booktitle={IACR Eprint archive},
keywords={public-key cryptography / algebraic attacks, graph partitioning, polynomial equations, Trivium, QUAD},
url={http://eprint.iacr.org/2010/349},
note={Extended version of published paper in proceedings of ACISP 2010 kk.wong@qut.edu.au 14776 received 16 Jun 2010},
author={Kenneth Koon-Ho Wong and Gregory V. Bard},
year=2010
}