10140

Fast Exhaustive Search for Quadratic Systems in F2 on FPGAs – Extended Version

Charles Bouillaguet, Chen-Mou Cheng, Tung Chou, Ruben Niederhagen, Bo-Yin Yang
Universite de Lille, France
Cryptology ePrint Archive: Report 2013/436, 2013

@misc{cryptoeprint:2013:436,

   author={Charles Bouillaguet and Chen-Mou Cheng and Tung Chou and Ruben Niederhagen and Bo-Yin Yang},

   title={Fast Exhaustive Search for Quadratic Systems in $mathbb{F}_2$ on FPGAs — Extended Version},

   howpublished={Cryptology ePrint Archive, Report 2013/436},

   year={2013},

   note={url{http://eprint.iacr.org/}}

}

Download Download (PDF)   View View   Source Source   

690

views

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.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: