On the complexity of solving quadratic Boolean systems
From MaRDI portal
Publication:1931429
DOI10.1016/j.jco.2012.07.001zbMath1255.65090arXiv1112.6263OpenAlexW2095823805MaRDI QIDQ1931429
Pierre-Jean Spaenlehauer, Magali Bardet, Bruno Salvy, Jean-Charles Faugère
Publication date: 14 January 2013
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1112.6263
Complexity and performance of numerical algorithms (65Y20) Numerical computation of roots of polynomial equations (65H04)
Related Items
Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems, Refined F5 Algorithms for Ideals of Minors of Square Matrices, A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions, An estimator for the hardness of the MQ problem, On the complexity of solving generic overdetermined bilinear systems, Using small-scale quantum devices to solve algebraic equations, On affine tropical F5 algorithms, On the efficiency of solving Boolean polynomial systems with the characteristic set method, Quantum algorithm design: techniques and applications, Unnamed Item, Solving non-linear Boolean equation systems by variable elimination, Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\), Practical complexities of probabilistic algorithms for solving Boolean polynomial systems, Fuzzy matching template attacks on multivariate cryptography: a case study, Speeding up deciphering by hypergraph ordering, Boolean ideals and their varieties, Improving Thomae-Wolf algorithm for solving underdetermined multivariate quadratic polynomial problem
Uses Software
