An algorithm for solving over-determined multivariate quadratic systems over finite fields

DOI10.3934/amc.2022001OpenAlexW4213148114WikidataQ123910847 ScholiaQ123910847MaRDI QIDQ6067845

Tzer-Jen Wei, Jian-Ming Shih, Yuh-Hua Hu, Chih-Cheng Hsieh, Lih-Chung Wang

Publication date: 14 December 2023

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2022001

zbMATH Keywords

multivariate cryptosystemmultivariate quadratic (MQ) problem

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Solving polynomial systems; resultants (13P15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• Hybrid approach for solving multivariate systems over finite fields
• Cryptanalysis of Variants of UOV
• Rainbow, a New Multivariable Polynomial Signature Scheme
• Practical Cryptanalysis of SFLASH
• Unbalanced Oil and Vinegar Signature Schemes
• On the Security of HFE, HFEv- and Quartz
• Ideals, Varieties, and Algorithms
• Information Security and Privacy
• Advances in Cryptology - CRYPTO 2003
• All in the XL Family: Theory and Practice
• Information and Communications Security
• The XL-Algorithm and a Conjecture from Commutative Algebra
• Comparison Between XL and Gröbner Basis Algorithms
• Information Security and Privacy
• Security in Communication Networks
• Topics in Cryptology – CT-RSA 2005
• Public Key Cryptography - PKC 2005
• Topics in Cryptology – CT-RSA 2006
• Public Key Cryptography – PKC 2004