First fall degree and Weil descent
From MaRDI portal
Publication:405966
DOI10.1016/j.ffa.2014.07.001zbMath1355.13020OpenAlexW2049995026WikidataQ62047249 ScholiaQ62047249MaRDI QIDQ405966
Jacob Schlather, Christophe Petit, Timothy J. Hodges
Publication date: 8 September 2014
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2014.07.001
Cryptography (94A60) Arithmetic theory of polynomial rings over finite fields (11T55) Solving polynomial systems; resultants (13P15)
Related Items (6)
On the security of biquadratic \(C^\ast\) public-key cryptosystems and its generalizations ⋮ Semi-regularity of pairs of Boolean polynomials ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ Homological characterization of bounded \(\mathbb{F}_2\)-regularity ⋮ On the existence of homogeneous semi-regular sequences in \(\mathbb{F}_2[X_1,\ldots,X_n/(X_1^2,\ldots,X_n^2)\)] ⋮ On the first fall degree of summation polynomials
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cryptanalysis of HFE, multi-HFE and variants for odd and even characteristic
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- The degree of regularity of a quadratic polynomial
- Representation by quadratic forms in a finite field
- Operating Degrees for XL vs. F4/F5 for Generic $\mathcal{M}Q$ with Number of Equations Linear in That of Variables
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
- Computing loci of rank defects of linear matrices using Gröbner bases and applications to cryptology
- The Degree of Regularity of HFE Systems
- Cryptanalysis of Multivariate and Odd-Characteristic HFE Variants
- Cryptanalysis of the Hidden Matrix Cryptosystem
- A Zero-Dimensional Gröbner Basis for AES-128
- 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
This page was built for publication: First fall degree and Weil descent
