Fast exhaustive search for polynomial systems in F2

C. Bouillaguet, H.-C. Chen, C.M. Cheng, T. Chou, R.F. Niederhagen, A. Shamir, B.Y. Yang

Research output: Book/ReportReportAcademic

2 Downloads (Pure)


Abstract. We analyze how fast we can solve general systems of multivariate equations of various low degrees over F2; this is a well known hard problem which is important both in itself and as part of many types of algebraic cryptanalysis. Compared to the standard exhaustive-search technique, our improved approach is more efficient both asymptotically and practically. We implemented several optimized versions of our techniques on CPUs and GPUs. Modern graphic cards allows our technique to run more than 10 times faster than the most powerful CPU available. Today, we can solve 48+ quadratic equations in 48 binary variables on a NVIDIA GTX 295 video card (USD 500) in 21 minutes. With this level of performance, solving systems of equations supposed to ensure a security level of 64 bits turns out to be feasible in practice with a modest budget. This is a clear demonstration of the power of GPUs in solving many types of combinatorial and cryptanalytic problems. Keywords: multivariate polynomials, system-solving, parallelization, Graphic Processing Units (GPUs).
Original languageEnglish
Number of pages17
Publication statusPublished - 2010

Publication series

NameCryptology ePrint Archive


Dive into the research topics of 'Fast exhaustive search for polynomial systems in F2'. Together they form a unique fingerprint.

Cite this