Fast exhaustive search for quadratic systems in F₂ on FPGAs

DOI10.1007/978-3-662-43414-7_11MaRDI QIDQ2949530zbMATH OpenOpenAlexFDO

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

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

zbMATH Keywords

exhaustive searchfield-programmable gate arrays (FPGAs)multivariate quadratic polynomialsparallelizationsolving systems of equations

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Symbolic computation and algebraic computation (68W30) Cryptography (94A60)

Recommendations

• Fast exhaustive search for polynomial systems in \({\mathbb{F}_2}\)
• Implementing Joux-Vitse's crossbred algorithm for solving \(\mathcal M\mathcal Q\) systems over \(\mathbb F_2\) on GPUs
• Evaluation of solving time for multivariate quadratic equation system using XL algorithm over small finite fields on GPU
• Solving quadratic equations with XL on parallel architectures
• A crossbred algorithm for solving Boolean polynomial systems

Cited in

(7)

• The nested subset differential attack. A practical direct attack against LUOV which forges a signature within 210 minutes
• Logical cryptanalysis with WDSat
• Fast exhaustive search for polynomial systems in \({\mathbb{F}_2}\)
• A SAT-Based Approach for Index Calculus on Binary Elliptic Curves
• Parallel Processing and Applied Mathematics
• An estimator for the hardness of the MQ problem
• Fast Enumeration Algorithm for Multivariate Polynomials over General Finite Fields

This page was built for publication: Fast exhaustive search for quadratic systems in \(\mathbb {F}_2\) on FPGAs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2949530)