English

Preimages of $p-$Linearized Polynomials over $\GF{p}$

Information Theory 2020-11-24 v1 Cryptography and Security math.IT

Abstract

Linearized polynomials over finite fields have been intensively studied over the last several decades. Interesting new applications of linearized polynomials to coding theory and finite geometry have been also highlighted in recent years. Let pp be any prime. Recently, preimages of the pp-linearized polynomials i=0kl1Xpli\sum_{i=0}^{\frac kl-1} X^{p^{li}} and i=0kl1(1)iXpli\sum_{i=0}^{\frac kl-1} (-1)^i X^{p^{li}} were explicitly computed over \GFpn\GF{p^n} for any nn. This paper extends that study to pp-linearized polynomials over \GFp\GF{p}, i.e., polynomials of the shape L(X)=i=0tαiXpi,αi\GFp.L(X)=\sum_{i=0}^t \alpha_i X^{p^i}, \alpha_i\in\GF{p}. Given a kk such that L(X)L(X) divides XXpkX-X^{p^k}, the preimages of L(X)L(X) can be explicitly computed over \GFpn\GF{p^n} for any nn.

Cite

@article{arxiv.2011.10954,
  title  = {Preimages of $p-$Linearized Polynomials over $\GF{p}$},
  author = {Kwang Ho Kim and Sihem Mesnager and Jong Hyok Choe and Dok Nam Lee},
  journal= {arXiv preprint arXiv:2011.10954},
  year   = {2020}
}
R2 v1 2026-06-23T20:25:20.198Z