An Efficient $$F_4$$ -style Based Algorithm to Solve MQ Problems

DOI10.1007/978-3-030-26834-3_3MaRDI QIDQ6488927

Shigenori Uchiyama, Naoyuki Shinohara, Takuma Ito

Publication date: 14 March 2024

Mathematics Subject Classification ID

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

Related Items (1)

An estimator for the hardness of the MQ problem

Cites Work

• Unnamed Item
• Unnamed Item
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• 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
• M4GB
• Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials

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