On the last fall degree of Weil descent polynomial systems
Ming-Deh Huang

TL;DR
This paper investigates the relationship between the last fall degrees of polynomial systems and their Weil descent over subfields, providing bounds especially for systems of linearized polynomials.
Contribution
It establishes a theorem linking the last fall degrees of original and Weil descent systems, with applications to linearized polynomial systems.
Findings
Proves a relation between last fall degrees of $\
Provides bounds on last fall degree for Weil descent systems of linearized polynomials.
Abstract
Given a polynomial system over a finite field which is not necessarily of dimension zero, we consider the Weil descent of over a subfield . We prove a theorem which relates the last fall degrees of and , where the zero set of corresponds bijectively to the set of -rational points of , and the zero set of is the set of -rational points of the Weil descent . As an application we derive upper bounds on the last fall degree of in the case where is a set of linearized polynomials.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Coding theory and cryptography · Algebraic Geometry and Number Theory
