On the last fall degree of zero-dimensional Weil descent systems

DOI10.1016/j.jsc.2017.08.002zbMath1391.13052arXiv1505.02532OpenAlexW1764529246MaRDI QIDQ1690789

Ming-Deh A. Huang, Michiel Kosters, Sze Ling Yeo, Yun Yang

Publication date: 12 January 2018

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

Full work available at URL: https://arxiv.org/abs/1505.02532

zbMATH Keywords

Gröbner basispolynomial systemzero-dimensionalcryptographic protocolsfirst fall degreeWeil descentECDLPHFElast fall degree

Mathematics Subject Classification ID

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

Related Items

Stronger bounds on the cost of computing Gröbner bases for HFE systems ⋮ Solving degree, last fall degree, and related invariants ⋮ Computing coupled border bases ⋮ On product decomposition ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ On the last fall degree of Weil descent polynomial systems ⋮ Recent Developments in Multivariate Public Key Cryptosystems ⋮ High-rank attack on HMFEv

Uses Software

• MutantXL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic
• On the relation between the MXL family of algorithms and Gröbner basis algorithms
• Polynomial maps on vector spaces over a finite field
• 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
• On the discrete logarithm problem in elliptic curves
• Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP
• On Polynomial Systems Arising from a Weil Descent
• Inverting HFE Systems Is Quasi-Polynomial for All Fields
• Advances in Cryptology - CRYPTO 2003
• Inverting HFE Is Quasipolynomial
• Factoring polynomials over finite fields: A survey