中文
相关论文

相关论文: On the last fall degree of Weil descent polynomial…

200 篇论文

In this article we will discuss a new, mostly theoretical, method for solving (zero-dimensional) polynomial systems, which lies in between Gr\"obner basis computations and the heuristic first fall degree assumption and is not based on any…

交换代数 · 数学 2015-06-19 Ming-Deh A. Huang , Michiel Kosters , Yun Yang , Sze Ling Yeo

Let us consider a generalized Artin-Schreier algebraic function field extension $F$ of the rational function field $\F_{p^n}(x)$ defined over the finite field extension $K=\F_{p^n}$ of the prime field $\F_p$. We assume that $K$ is…

数论 · 数学 2025-05-29 Stéphane Ballet , Robert Rolland

We study the last fall degrees of {\em semi-local} polynomial systems, and the computational complexity of solving such systems for closed-point and rational-point solutions, where the systems are defined over a finite field. A semi-local…

计算复杂性 · 计算机科学 2023-11-07 Ming-Deh A. Huang

Let $F$ be a univariate polynomial or rational fraction of degree $d$ defined over a number field. We give bounds from above on the absolute logarithmic Weil height of $F$ in terms of the heights of its values at small integers: we review…

数论 · 数学 2022-10-11 Jean Kieffer

We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along Semaev's summation polynomials relevant to the solution of the Elliptic Curve Discrete Logarithm Problem via Gr\"obner basis algorithms.

组合数学 · 数学 2020-11-25 Stavros Kousidis , Andreas Wiemers

In these short notes, we will show the following. Let F_q be a finite field and let E/\F_q be an elliptic curve. Let S_r be the rth summation/Semaev polynomial for E. Under an assumption, we show that it is NP-complete to check if S_r…

数论 · 数学 2015-06-09 Michiel Kosters , Sze Ling Yeo

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…

密码学与安全 · 计算机科学 2023-02-06 Alessio Caminata , Michela Ceria , Elisa Gorla

The (weak) Nullstellensatz over finite fields says that if $P_1,\ldots,P_m$ are $n$-variate degree-$d$ polynomials with no common zero over a finite field $\mathbb{F}$ then there are polynomials $R_1,\ldots,R_m$ such that…

组合数学 · 数学 2022-09-14 Guy Moshkovitz , Jeffery Yu

We consider the finite set of isogeny classes of $g$-dimensional abelian varieties defined over the finite field $\mathbb{F}_q$ with endomorphism algebra being a field. We prove that the class within this set whose varieties have maximal…

数论 · 数学 2021-12-24 Elena Berardini , Alejandro J. Giangreco Maidana

In this paper, we establish some finiteness results about the multiplicative dependence of rational values modulo sets which are `close' (with respect to the Weil height) to division groups of finitely generated multiplicative groups of a…

A differential version of the classical Weil descent is established in all characteristics. It yields a theory of differential restriction of scalars for differential varieties over finite differential field extensions. This theory is then…

代数几何 · 数学 2018-07-31 Omar León Sánchez , Marcus Tressl

Let $A$ be an abelian surface over a finite field $k$. The $k$-isogeny class of $A$ is uniquely determined by a Weil polynomial $f_A$ of degree 4. We give a classification of the groups of $k$-rational points on varieties from this class in…

代数几何 · 数学 2012-05-18 Sergey Rybakov

Let ${\mathcal L}/{\mathcal K}$ be a finite Galois extension and let $X$ be an affine algebraic variety defined over ${\mathcal L}$. Weil's Galois descent theorem provides necessary and sufficient conditions for $X$ to be definable over…

代数几何 · 数学 2021-05-04 Rubén A. Hidalgo , Sebastián Reyes-Carocca

Recent theorems of Dubickas and Mossinghoff use auxiliary polynomials to give lower bounds on the Weil height of an algebraic number $\alpha$ under certain assumptions on $\alpha$. We prove a theorem which introduces an auxiliary polynomial…

数论 · 数学 2015-06-22 Charles L. Samuels

Using Weil descent, we give bounds for the number of rational points on two families of curves over finite fields with a large abelian group of automorphisms: Artin-Schreier curves of the form $y^q-y=f(x)$ with $f\in\Fqr[x]$, on which the…

代数几何 · 数学 2010-05-28 Antonio Rojas-Leon

We prove new combinatorial results about polynomial configurations in large subsets of finite fields. Bergelson--Leibman--McCutcheon (2005) showed that for any polynomial $P(x) \in \mathbb{Z}[x]$ with $P(0) = 0$, if $A \subseteq…

数论 · 数学 2026-03-25 Ethan Ackelsberg , Vitaly Bergelson

Let $V$ be an $n$-dimensional vector space over the finite field $\mathbb{F}_{q}$ and let $\left[V\atop k\right]_q$ denote the family of all $k$-dimensional subspaces of $V$. A family $\mathcal{F}\subseteq \left[V\atop k\right]_q$ is called…

组合数学 · 数学 2024-11-28 Yunjing Shan , Junling Zhou

Let $\mathbb{F}_q$ be a finite field with $q=p^n$ elements. In this paper, we study the number of $\mathbb{F}_q$-rational points on the affine hypersurface $\mathcal X$ given by $a_1 x_1^{d_1}+\dots+a_s x_s^{d_s}=b$, where…

数论 · 数学 2021-10-15 José Alves Oliveira

Let $A$ be an abelian variety over a finite field $k$. The $k$-isogeny class of $A$ is uniquely determined by the Weil polynomial $f_A$. We assume that $f_A$ is separable. For a given prime number $\ell\neq\mathrm{char}\, k$ we give a…

代数几何 · 数学 2013-12-02 Sergey Rybakov

In this paper we study and relate several invariants connected to the solving degree of a polynomial system. This provides a rigorous framework for estimating the complexity of solving a system of polynomial equations via Groebner bases…

密码学与安全 · 计算机科学 2022-06-02 Alessio Caminata , Elisa Gorla
‹ 上一页 1 2 3 10 下一页 ›