On semi-local decomposition

DOI10.1016/J.JSC.2025.102483MaRDI QIDQ6890931zbMATH OpenFDO

Authors Ming-Deh A. Huang

Publication date 2 December 2025

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JSC.2025.102483

zbMATH Keywords

polynomial systemsemi-local decomposition

Mathematics Subject Classification ID

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

Cites work

• Advances in Cryptology - CRYPTO 2003
• Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic
• Efficient algorithms for some special cases of the polynomial equivalence problem
• Efficient key recovery for all HFE signature variants
• Inverting HFE Is Quasipolynomial
• Inverting HFE systems is quasi-polynomial for all fields
• Last fall degree, HFE, and Weil descent attacks on ECDLP
• Multivariate Public Key Cryptography
• On polynomial systems arising from a Weil descent
• On product decomposition
• On the last fall degree of zero-dimensional Weil descent systems
• Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case

This page was built for publication: On semi-local decomposition

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