Cryptology ePrint Archive: Report 2013/436

Fast Exhaustive Search for Quadratic Systems in $\mathbb{F}_2$ on FPGAs --- Extended Version

Charles Bouillaguet and Chen-Mou Cheng and Tung Chou and Ruben Niederhagen and Bo-Yin Yang

Abstract: In 2010, Bouillaguet et al. proposed an efficient solver for polynomial systems over $\mathbb{F}_2$ that trades memory for speed. As a result, 48 quadratic equations in 48 variables can be solved on a graphics card (GPU) in 21 minutes. The research question that we would like to answer in this paper is how specifically designed hardware performs on this task. We approach the answer by solving multivariate quadratic systems on reconfigurable hardware, namely Field-Programmable Gate Arrays (FPGAs). We show that, although the algorithm proposed by Bouillaguet et al. has a better asymptotic time complexity than traditional enumeration algorithms, it does not have a better asymptotic complexity in terms of silicon area. Nevertheless, our FPGA implementation consumes 25 times less energy than their GPU implementation. This is a significant improvement, not to mention that the monetary cost per unit of computational power for FPGAs is generally much cheaper than that of GPUs.

Category / Keywords: implementation / multivariate quadratic polynomials, solving systems of equations, exhaustive search, parallelization, Field-Programmable Gate Arrays (FPGAs)

Publication Info: SAC 2013 (in co-operation with IACR), proceedings published by Springer in the Lecture Notes in Computer Science series

Date: received 11 Jul 2013, last revised 11 Jul 2013

Contact author: ruben at polycephaly org

Available format(s): PDF | BibTeX Citation

Short URL: ia.cr/2013/436

[ Cryptology ePrint archive ]