The complexity of solving Weil restriction systems

Autor:	Caminata, Alessio, Ceria, Michela, Gorla, Elisa
Rok vydání:	2021
Předmět:	Computer Science - Cryptography and Security Computer Science - Symbolic Computation Mathematics - Commutative Algebra
Druh dokumentu:	Working Paper
Popis:	The solving degree of a system of multivariate polynomial equations provides an upper bound for the complexity of computing the solutions of the system via Groebner bases methods. In this paper, we consider polynomial systems that are obtained via Weil restriction of scalars. The latter is an arithmetic construction which, given a finite Galois field extension $k\hookrightarrow K$, associates to a system $\mathcal{F}$ defined over $K$ a system $\mathrm{Weil}(\mathcal{F})$ defined over $k$, in such a way that the solutions of $\mathcal{F}$ over $K$ and those of $\mathrm{Weil}(\mathcal{F})$ over $k$ are in natural bijection. In this paper, we find upper bounds for the complexity of solving a polynomial system $\mathrm{Weil}(\mathcal{F})$ obtained via Weil restriction in terms of algebraic invariants of the system $\mathcal{F}$. Comment: Final version. To appear in Journal of Algebra
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2112.10506 Zobrazit plný text záznamu View this record from Arxiv