On the complexity of solving generic overdetermined bilinear systems
From MaRDI portal
Publication:6163795
DOI10.3934/amc.2021047zbMath1522.13039arXiv2006.09442MaRDI QIDQ6163795
Daniel Cabarcas, John Baena, Javier A. Verbel
Publication date: 30 June 2023
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.09442
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Vector spaces, linear dependence, rank, lineability (15A03) Solving polynomial systems; resultants (13P15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gröbner bases of bihomogeneous ideals generated by polynomials of bidegree \((1,1)\): algorithms and complexity
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Asymptotically faster quantum algorithms to solve multivariate quadratic equations
- Key recovery attack for all parameters of \(\mathrm{HFE}^-\)
- Key recovery attack for ZHFE
- On the complexity of solving quadratic Boolean systems
- On the complexity of ``Superdetermined minrank instances
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- Solving Degree and Degree of Regularity for Polynomial Systems over a Finite Fields
- Solution theory for complete bilinear systems of equations
- On the solvability of systems of bilinear equations in finite fields
- Hybrid approach for solving multivariate systems over finite fields
- Sparse Gröbner bases
- MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy
- Flexible Partial Enlargement to Accelerate Gröbner Basis Computation over $\mathbb{F}_2$
- Solving sparse linear equations over finite fields
- Solving polynomial systems over finite fields
This page was built for publication: On the complexity of solving generic overdetermined bilinear systems
