Preimages of \(p\)-linearized polynomials over \(\mathbb{F}_p\)
From MaRDI portal
Publication:2130027
DOI10.1007/s12095-021-00514-xzbMath1496.11137arXiv2011.10954OpenAlexW3191456655MaRDI QIDQ2130027
Kwang Ho Kim, Jong Hyok Choe, Sihem Mesnager, Dok Nam Lee
Publication date: 25 April 2022
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.10954
Polynomials in general fields (irreducibility, etc.) (12E05) Equations in general fields (12E12) Polynomials over finite fields (11T06)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smoothness and factoring polynomials over finite fields
- A characterization of linearized polynomials with maximum kernel
- Solving some affine equations over finite fields
- Solving \(X^{q+1}+X+a=0\) over finite fields
- On the Menezes-Teske-Weng conjecture
- On the number of roots of some linearized polynomials
- On the number of the rational zeros of linearized polynomials and the second-order nonlinearity of cubic Boolean functions
- Solving \(x+x^{2^l}+\ldots +x^{2^{ml}}=a\) over \(\mathbb{F}_{2^n} \)
- A condition for scattered linearized polynomials involving Dickson matrices
- Scalar \(q\)-subresultants and Dickson matrices
- Solving \(x^{2^k + 1} + x + a = 0\) in \(\mathbb{F}_{2^n}\) with \(\gcd(n, k) = 1\)
- A characterization of the number of roots of linearized and projective polynomials in the field of coefficients
- Linearized polynomials over finite fields revisited
- Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials
- A New Algorithm for Factoring Polynomials Over Finite Fields
- Subquadratic-time factoring of polynomials over finite fields
- Some results on linearized trinomials that split completely
This page was built for publication: Preimages of \(p\)-linearized polynomials over \(\mathbb{F}_p\)
