Fast Exhaustive Search for Quadratic Systems in $$\mathbb {F}_{2}$$ on FPGAs
From MaRDI portal
Publication:2949530
DOI10.1007/978-3-662-43414-7_11zbMath1339.94038MaRDI QIDQ2949530
Charles Bouillaguet, Bo-Yin Yang, Ruben Niederhagen, Chen-Mou Cheng, Tung Chou
Publication date: 1 October 2015
Published in: Selected Areas in Cryptography -- SAC 2013 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-43414-7_11
parallelization; exhaustive search; solving systems of equations; field-programmable gate arrays (FPGAs); multivariate quadratic polynomials
68W30: Symbolic computation and algebraic computation
94A60: Cryptography
11T06: Polynomials over finite fields