Abstract
We study permutation polynomials of the shape F(X) = G(X) + γ Tr(H(X)) over \(\mathbb{F}_{2^n}\) . We prove that if the polynomial G(X) is a permutation polynomial or a linearized polynomial, then the considered problem can be reduced to finding Boolean functions with linear structures. Using this observation we describe six classes of such permutation polynomials.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bierbrauer, J., Kyureghyan, G.: Crooked binomials. Des. Codes Cryptogr. 46, 269–301 (2008)
Dubuc, S.: Characterization of linear structures. Des. Codes Cryptogr. 22, 33–45 (2001)
Hollmann, H.D.L., Xing, Q.: A class of permutation polynomials of \(\mathbb{F}_{2^n}\) related to Dickson polynomials. Finite Fields Appl. 11(1), 111–122 (2005)
Kyureghyan, G.: Crooked maps in \(\mathbb{F}_{2^n}\). Finite Fields Appl. 13(3), 713–726 (2007)
Lai, X.: Additive and linear structures of cryptographic functions. In: Preneel, B. (ed.) FSE 1994. LNCS, vol. 1008, pp. 75–85. Springer, Heidelberg (1995)
Laigle-Chapuy, Y.: A note on a class of quadratic permutations over \({F}_{2^n}\). In: Boztaş, S., Lu, H.-F(F.) (eds.) AAECC 2007. LNCS, vol. 4851, pp. 130–137. Springer, Heidelberg (2007)
Lidl, R., Niederreiter, H.: Finite Fields. Encyclopedia of Mathematics and its Applications 20
Yashchenko, V.V.: On the propagation criterion for Boolean functions and bent functions. Problems of Information Transmission 33(1), 62–71 (1997)
Yuan, J., Ding, C., Wang, H., Pieprzyk, J.: Permutation polynomials of the form (x p − x + δ)s + L(x). Finite Fields Appl. 14(2), 482–493 (2008)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Charpin, P., Kyureghyan, G.M. (2008). On a Class of Permutation Polynomials over \(\mathbb{F}_{2^n}\) . In: Golomb, S.W., Parker, M.G., Pott, A., Winterhof, A. (eds) Sequences and Their Applications - SETA 2008. SETA 2008. Lecture Notes in Computer Science, vol 5203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85912-3_32
Download citation
DOI: https://doi.org/10.1007/978-3-540-85912-3_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85911-6
Online ISBN: 978-3-540-85912-3
eBook Packages: Computer ScienceComputer Science (R0)