Development of hybrid approach for solving MQ problem: Intermediate hybrid approach

DOI10.14495/JSIAML.15.109MaRDI QIDQ6139500zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

multivariate polynomialshybrid approachmultivariate public-key cryptographyGröbner basis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to systems of equations (65H10)

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

Cites work

• scientific article; zbMATH DE number 2151220 (Why is no real title available?)
• A new efficient algorithm for computing Gröbner bases (F₄)
• 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
• 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
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Semi-regular sequences and other random systems of equations
• Signature rewriting in Gröbner basis computation

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)