Skip to main content
Log in

Preimages of p −Linearized Polynomials over \({\mathbb {F}}_{p}\)

  • Published:
Cryptography and Communications Aims and scope Submit manuscript

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 p be any prime. Recently, preimages of the p −linearized polynomials \({\sum }_{i=0}^{\frac kl-1} X^{p^{li}}\) and \({\sum }_{i=0}^{\frac kl-1} (-1)^{i} X^{p^{li}}\) were explicitly computed over \({\mathbb {F}}_{p^{n}}\) for any n. This paper extends that study to p −linearized polynomials over \({\mathbb {F}}_{p}\), i.e., polynomials of the shape \(L(X)=\sum \limits _{i=0}^{t} \alpha _{i} X^{p^{i}}, \alpha _{i}\in {\mathbb {F}}_{p}.\) Given a k such that L(X) divides \(X-X^{p^{k}}\), the preimages of L(X) can be explicitly computed over \({\mathbb {F}}_{p^{n}}\) for any n.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Blake, I., Seroussi, G., Smart, N.: Elliptic curves in cryptography number 265 in london mathematical society lecture note series cambridge university press (1999)

  2. Camion, P.: Improving an algorithm for factoring polynomials over a finite field and constructing large irreducible polynomials. IEEE Trans. Info Th. 29, 378–385 (1983)

    Article  MathSciNet  Google Scholar 

  3. Cantor, D., Zassenhaus, H.: A new algorithm for factoring polynomials over finite fields. Math Comp., 36 587 – 592 (1981)

  4. Carlet, C.: Boolean Functions for Cryptography and Error Correcting Codes. Chapter of the monography Boolean Models and Methods in Mathematics, Computer Science, and Engineering, Y. Crama and P. Hammer eds. Cambridge University Press, pp 257–397 (2010)

  5. Carlet, C.: Vectorial Boolean Functions for Cryptography. Chapter of the monography Boolean Models and Methods in Mathematics, Computer Science, and Engineering, Y. Crama and P. Hammer eds, Cambridge University Press, pp 398 –469 (2010)

  6. Csajbók, B.: Scalar q −subresultants and Dickson matrices. Journal of Algebra 547, 116–128 (2020)

    Article  MathSciNet  Google Scholar 

  7. Csajbók, B., Marino, G., Polverino, O., Zullo, F.: A characterization of linearized polynomials with maximum kernel. Finite Fields and Their Applications 56, 109–130 (2019)

    Article  MathSciNet  Google Scholar 

  8. Kaltofen, E., Shoup, V.: Subquadratic-time factoring of polynomials over finite fields. Math Comput. 67(223) 1179 – 1197 (1998)

  9. Kedlaya, K., Umans, C.: Fast modular composition in any characteristic. In: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 146 – 155 (2008)

  10. Kim, K.H., Choe, J., Mesnager, S.: Solving Xq+ 1 + X + a = 0 over Finite Fields. Finite Fields and Their Applications, Vol. 70, 101797. https://doi.org/10.1016/j.ffa.2021.101797 (2021)

  11. Kim, K.H., Mesnager, S.: Solving \(x^{2^{k}+1}+x+a=0\) in \(\mathbb {F}_{2^{n}}\) with \(\gcd (n,k)=1\). Finite Fields and Their Applications, Vol. 63, 101630. https://doi.org/10.1016/j.ffa.2019.101630 (2020)

  12. Lidl, R., Niederreiter, H.: Finite Fields, Volume 20 of Encyclopedia of Mathematics and Its Applications, second. Cambridge University Press, Cambridge (1997)

    Google Scholar 

  13. McGuire, G., Sheekey, J.: A characterization of the number of roots of linearized and projective polynomials in the field of coefficients. Finite Fields and Their Applications 57, 68–91 (2019)

    Article  MathSciNet  Google Scholar 

  14. McGuire, G., Mueller, D.: Some results on linearized trinomials that split completely. arXiv:1905.11755. Proceedings of Fq14 (2020)

  15. Mesnager, S., Kim, K.H., Choe, J.H., Lee, D.N.: Solving Some Affine Equations over Finite Fields. Finite Fields and Their Applications, Vol. 68, 101746. https://doi.org/10.1016/j.ffa.2020.101746 (2020)

  16. Mesnager, S., Kim, K.H., Choe, J.H., Lee, D.N., Go, D.S.: Solving \(x+x^{2^{l}}+\cdots +x^{2^{ml}}=a\) over \(\mathbb {F}_{2^{n}}\). Cryptogr. Commun. 12(4), 809–817 (2020)

    Article  MathSciNet  Google Scholar 

  17. Mesnager, S., Kim, K.H., Choe, J., Tang, C.: On the Menezes-Teske-Weng’s conjecture. Cryptography and Communications 12(1), 19–27 (2020)

    Article  MathSciNet  Google Scholar 

  18. Mesnager, S., Kim, K.H., Jo, M.S.: On the number of the rational zeros of linearized polynomials and the second-order nonlinearity of cubic Boolean functions. Cryptogr. Commun. 12(4), 659–674 (2020)

    Article  MathSciNet  Google Scholar 

  19. Polverino, O., Zullo, F.: On the number of roots of some linearized polynomials. Linear Algebra Appl. 601, 189–218 (2020)

    Article  MathSciNet  Google Scholar 

  20. Shoup, V.: On the deterministic complexity of factoring polynomials over finite fields. Information Processing Letters 38, 39–42 (1991)

    Article  MathSciNet  Google Scholar 

  21. Shparlinski, I.E.: Computational problems in finite fields kluwer academic publishers (1992)

  22. Wu, B., Liu, Z.: Linearized polynomials over finite fields revisited. Finite Fields and Their Applications 22, 79–100 (2013)

    Article  MathSciNet  Google Scholar 

  23. Zanella, C.: A condition for scattered linearized polynomials involving Dickson matrices. Journal of Geometry 110(3), 50 (2019)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors are very grateful to the referees and the Associate Editor for several valuable comments, which improved the exposition of the results.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sihem Mesnager.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kim, K.H., Mesnager, S., Choe, J.H. et al. Preimages of p −Linearized Polynomials over \({\mathbb {F}}_{p}\). Cryptogr. Commun. 14, 75–86 (2022). https://doi.org/10.1007/s12095-021-00514-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12095-021-00514-x

Keywords

Mathematics Subject Classification (2010)

Navigation