Development of hybrid approach for solving MQ problem: Intermediate hybrid approach
From MaRDI portal
Publication:6139500
DOI10.14495/JSIAML.15.109OpenAlexW4388687887MaRDI QIDQ6139500FDOQ6139500
Authors: Kosuke Sakata
Publication date: 19 December 2023
Published in: JSIAM Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.14495/jsiaml.15.109
Recommendations
- An Efficient $$F_4$$ -style Based Algorithm to Solve MQ Problems
- Multivariable algebra theory and its application in cryptography
- Multivariate encryption schemes based on the constrained MQ problem
- Hybrid approach for solving multivariate systems over finite fields
- Solving polynomial systems over finite fields: improved analysis of the hybrid approach
Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to systems of equations (65H10)
Cites Work
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- A survey on signature-based algorithms for computing Gröbner bases
- 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
- Hybrid approach for solving multivariate systems over finite fields
- On an installation of Buchberger's algorithm
- Signature rewriting in Gröbner basis computation
- Semi-regular sequences and other random systems of equations
This page was built for publication: Development of hybrid approach for solving MQ problem: Intermediate hybrid approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6139500)