Paper 2013/436
Fast Exhaustive Search for Quadratic Systems in on FPGAs --- Extended Version
Charles Bouillaguet, Chen-Mou Cheng, Tung Chou, Ruben Niederhagen, and Bo-Yin Yang
Abstract
In 2010, Bouillaguet et al. proposed an efficient solver for polynomial systems over
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Published elsewhere. SAC 2013 (in co-operation with IACR), proceedings published by Springer in the Lecture Notes in Computer Science series
- Keywords
- multivariate quadratic polynomialssolving systems of equationsexhaustive searchparallelizationField-Programmable Gate Arrays (FPGAs)
- Contact author(s)
- ruben @ polycephaly org
- History
- 2013-07-17: received
- Short URL
- https://ia.cr/2013/436
- License
-
CC BY
BibTeX
@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, Paper 2013/436}, year = {2013}, url = {https://eprint.iacr.org/2013/436} }