Add to ORKGAbstract. We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along Semaev’s summation poly-nomials. 1
AbstractThis paper gives nearly optimal lower bounds on the minimum degree of polynomial calculus re...
AbstractA detailed study of the degree setting for Gosper's algorithm for indefinite hypergeometric ...
AbstractIn this work, we introduce the p-weight degree of a polynomial over a finite field with resp...
We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along...
We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along...
Polynomial systems arising from a Weil descent have many applications in cryptography, including the...
Abstract. Polynomials systems arising from a Weil descent have many ap-plications in cryptography, i...
In this paper, we will study the properties of the curve, which is obtained by Weil descent from a g...
Weil descent methods have recently been applied to attack the Hidden Field Equation (HFE) public key...
In this paper we study and relate several invariants connected to the solving degree of a polynomial...
Abstract. In the late 70’s A. Kouchnirenko posed the problem of bounding from above the number of po...
The size of the set of all permutations of n with a given descent set is a polynomial in n, called t...
A construct is developed which is useful in the investigation of the global convergence properties o...
In [2], Downey and Greenberg use the ordinals below ε0 to bound the number of mind-changes of comput...
Using some commutative algebra we prove Max Noether’s Theorem, the Jacobi Formula and B´ezout’s The...
AbstractThis paper gives nearly optimal lower bounds on the minimum degree of polynomial calculus re...
AbstractA detailed study of the degree setting for Gosper's algorithm for indefinite hypergeometric ...
AbstractIn this work, we introduce the p-weight degree of a polynomial over a finite field with resp...
We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along...
We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along...
Polynomial systems arising from a Weil descent have many applications in cryptography, including the...
Abstract. Polynomials systems arising from a Weil descent have many ap-plications in cryptography, i...
In this paper, we will study the properties of the curve, which is obtained by Weil descent from a g...
Weil descent methods have recently been applied to attack the Hidden Field Equation (HFE) public key...
In this paper we study and relate several invariants connected to the solving degree of a polynomial...
Abstract. In the late 70’s A. Kouchnirenko posed the problem of bounding from above the number of po...
The size of the set of all permutations of n with a given descent set is a polynomial in n, called t...
A construct is developed which is useful in the investigation of the global convergence properties o...
In [2], Downey and Greenberg use the ordinals below ε0 to bound the number of mind-changes of comput...
Using some commutative algebra we prove Max Noether’s Theorem, the Jacobi Formula and B´ezout’s The...
AbstractThis paper gives nearly optimal lower bounds on the minimum degree of polynomial calculus re...
AbstractA detailed study of the degree setting for Gosper's algorithm for indefinite hypergeometric ...
AbstractIn this work, we introduce the p-weight degree of a polynomial over a finite field with resp...