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.94038OpenAlexW1450631554MaRDI QIDQ2949530
Bo-Yin Yang, Ruben Niederhagen, Chen-Mou Cheng, Charles Bouillaguet, 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
parallelizationexhaustive searchsolving systems of equationsfield-programmable gate arrays (FPGAs)multivariate quadratic polynomials
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Polynomials over finite fields (11T06)
Related Items (4)
A SAT-Based Approach for Index Calculus on Binary Elliptic Curves ⋮ An estimator for the hardness of the MQ problem ⋮ The nested subset differential attack. A practical direct attack against LUOV which forges a signature within 210 minutes ⋮ Logical cryptanalysis with WDSat
This page was built for publication: Fast Exhaustive Search for Quadratic Systems in $$\mathbb {F}_{2}$$ on FPGAs
