Improving Thomae-Wolf algorithm for solving underdetermined multivariate quadratic polynomial problem
DOI10.1007/978-3-030-81293-5_4OpenAlexW3186236200MaRDI QIDQ2118526FDOQ2118526
Authors: Hiroki Furue, Shuhei Nakamura, Tsuyoshi Takagi 
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81293-5_4
underdetermined systemhybrid approachpost-quantum cryptographymultivariate public key cryptography\( \mathcal{MQ}\) problem
Data encryption (aspects in computer science) (68P25) Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Title not available (Why is that?)
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- Title not available (Why is that?)
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- Information and Communications Security
- Solving Underdetermined Systems of Multivariate Quadratic Equations Revisited
- Hybrid approach for solving multivariate systems over finite fields
- Unbalanced Oil and Vinegar Signature Schemes
- Title not available (Why is that?)
- On the complexity of solving quadratic Boolean systems
- A crossbred algorithm for solving Boolean polynomial systems
- Analysis of QUAD
- A Polynomial-Time Algorithm for Solving a Class of Underdetermined Multivariate Quadratic Equations over Fields of Odd Characteristics
Cited In (3)
This page was built for publication: Improving Thomae-Wolf algorithm for solving underdetermined multivariate quadratic polynomial problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118526)
