Roots of certain polynomials over finite fields
From MaRDI portal
Publication:6166735
Abstract: We determine the roots in F_{q^3} of the polynomial X^{2q^k+1} + X + c for each positive integer k and each c in F_q, where q is a power of 2. We introduce a new approach for this type of question, and we obtain results which are more explicit than the previous results in this area. Our results resolve an open problem and a conjecture of Zheng, Kan, Zhang, Peng, and Li.
Recommendations
- Roots and coefficients of polynomials over finite fields
- Roots and coefficients of multivariate polynomials over finite fields
- scientific article; zbMATH DE number 4093599
- Roots of polynomials in \(p\)-adic fields
- POLYNOMIAL REPRESENTATIONS FOR n-TH ROOTS IN FINITE FIELDS
- Power roots of polynomials over arbitrary fields
- Roots of sparse polynomials over a finite field
- Roots of random polynomials over a finite field
- On roots of polynomials and algebraically closed fields
Cites work
- scientific article; zbMATH DE number 732318 (Why is no real title available?)
- scientific article; zbMATH DE number 1867224 (Why is no real title available?)
- A characterization of the number of roots of linearized and projective polynomials in the field of coefficients
- A family of semifields in characteristic 2
- A new identity of Dickson polynomials
- A note on ``Cryptographically strong permutations from the butterfly structure
- Almost perfect nonlinear trinomials and hexanomials
- Bivariate factorizations connecting Dickson polynomials and Galois theory
- Breaking `128-bit secure' supersingular binary curves. (Or how to solve discrete logarithms in \({\mathbb F}_{2^{4 \cdot 1223}}\) and \({\mathbb F}_{2^{12 \cdot 367}}\))
- Characterization of $m$-Sequences of Lengths $2^{2k}-1$ and $2^{k}-1$ With Three-Valued Cross Correlation
- Classes of Quadratic APN Trinomials and Hexanomials and Related Structures
- Classification of fractional projective permutations over finite fields
- Codes with the same coset weight distributions as the Z/sub 4/-linear Goethals codes
- Combinatorial \(t\)-designs from quadratic functions
- Complete solution over \(\mathbb{F}_{p^n}\) of the equation \(X^{p^k+1}+X+a=0\)
- Completely characterizing a class of permutation quadrinomials
- Composition collisions and projective polynomials: statement of results
- Computation of a 30750-bit binary field discrete logarithm
- Cyclic Codes and Sequences: The Generalized Kasami Case
- Factorization of a class of polynomials over finite fields
- Finite semifields and projective planes
- Generalized Kasami Sequences: The Large Set
- Indiscreet logarithms in finite fields of small characteristic
- Infinite Families of 3-Designs and 2-Designs From Almost MDS Codes
- Lower bounds for decomposable univariate wild polynomials
- More differentially 6-uniform power functions
- Niho type cross-correlation functions via dickson polynomials and Kloosterman sums
- Note on cubics over GF(2ⁿ) and GF(3ⁿ)
- On \(x^{q+1}+ax+b\)
- On a class of quadratic polynomials with no zeros and its application to APN functions
- On existence of Budaghyan-Carlet APN hexanomials
- On permutation quadrinomials with boomerang uniformity 4 and the best-known nonlinearity
- On some quadratic APN functions
- On the Menezes-Teske-Weng conjecture
- On the Walsh spectrum of a family of quadratic APN functions with five terms
- On the discrete logarithm problem in finite fields of fixed characteristic
- On the equation \(x^{2^l+1}+x+a=0\) over \(\mathrm{GF}(2^k)\)
- On the function field sieve and the impact of higher splitting probabilities. Application to discrete logarithms in \(\mathbb{F}_{2^{1971}}\) and \(\mathbb{F}_{2^{3164}}\)
- On the generalized large set of Kasami sequences
- On the iterations of the maps \(ax^{2^k}+b\) and \((a x^{2^k} + b)^{-1}\) over finite fields of characteristic two
- On the size of Kakeya sets in finite vector spaces
- Period-Different $m$-Sequences With at Most Four-Valued Cross Correlation
- Seminuclear Extensions of Galois Fields
- Solving \(X^{q+1}+X+a=0\) over finite fields
- Solving \(x^{2^k + 1} + x + a = 0\) in \(\mathbb{F}_{2^n}\) with \(\gcd(n, k) = 1\)
- Solving a $$6120$$ -bit DLP on a Desktop Computer
- The number of almost perfect nonlinear functions grows exponentially
- Topics in Cryptology – CT-RSA 2004
- \(X^{2^l+1}+x+a\) and related affine polynomials over \(\mathrm{GF}(2^k\))
Cited in
(19)- Taking pth roots modulo polynomials over finite fields
- Taking roots over high extensions of finite fields
- Roots of Pell-Lucas polynomials
- Two classes of permutation trinomials over \(\mathbb{F}_{q^3}\) in characteristic two
- A note on square roots in finite fields
- Lengths of roots of polynomials in a Hahn field
- Roots and critical points of polynomials over Cayley–Dickson algebras
- scientific article; zbMATH DE number 5843625 (Why is no real title available?)
- Parametrizing roots of polynomial congruences
- On quadratic integral polynomials with only finitely many roots in any commutative finite-dimensional algebra
- Counting the number of distinct real roots of certain polynomials by Bezoutian and the Galois groups over the rational number field
- Bivariate trinomials over finite fields
- Counting roots of fully triangular polynomials over finite fields
- Roots of unity and the polynomials with coefficients in \(\mathbb{T}\)
- Counting polynomials over finite fields with given root multiplicities
- scientific article; zbMATH DE number 7604446 (Why is no real title available?)
- scientific article; zbMATH DE number 6327479 (Why is no real title available?)
- scientific article; zbMATH DE number 4116844 (Why is no real title available?)
- Types of root systems in number fields
This page was built for publication: Roots of certain polynomials over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166735)
