An Efficient F₄ -style Based Algorithm to Solve MQ Problems

DOI10.1007/978-3-030-26834-3_3MaRDI QIDQ6488927zbMATH OpenFDO

Authors Takuma Ito, Naoyuki Shinohara, Shigenori Uchiyama

Publication date 14 March 2024

Full work available at URL https://doi.org/10.1007/978-3-030-26834-3_3

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Nonnumerical algorithms (68W05) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Recommendations

• A multivariate quadratic challenge toward post-quantum generation cryptography
• Extended algorithm for solving underdefined multivariate quadratic equations
• An estimator for the hardness of the MQ problem
• Multivariable algebra theory and its application in cryptography
• Implementing Joux-Vitse's crossbred algorithm for solving \(\mathcal M\mathcal Q\) systems over \(\mathbb F_2\) on GPUs

Cites work

• A new efficient algorithm for computing Gröbner bases (F₄)
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Hidden fields equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms
• scientific article; zbMATH DE number 4070803 (Why is no real title available?)
• scientific article; zbMATH DE number 217454 (Why is no real title available?)
• M4GB. An efficient Gröbner-basis algorithm
• Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials

Cited in

(3)

• An estimator for the hardness of the MQ problem
• Development of hybrid approach for solving MQ problem: Intermediate hybrid approach
• A technique to reduce memory usage of M4GB algorithm

This page was built for publication: An Efficient $$F_4$$ -style Based Algorithm to Solve MQ Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488927)