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 be any prime. Recently, preimages of the linearized polynomials and were explicitly computed over for any . This paper extends that study to linearized polynomials over , i.e., polynomials of the shape Given a such that divides , the preimages of can be explicitly computed over for any .
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}
}