参考文献:[1]Dembowski P and Ostrom T G, Planes of order n with collineation groups of order n 2, Math Z, 1968, 103: 239–258.CrossRef MathSciNet MATH [2]Dembowski P, Finite Geometries, Springer-Verlag, New York, Heidelberg, Berlin, 1968.CrossRef MATH [3]Patarin J, Hidden fields equations (HFE) and isomorphisms of polynomials (IP): Two new families of asymmetric algorithms, Advances in Cryptology — Eurocrypt 1996, Ed. by Maurer U, Saragossa, 1996. [4]Lidl R, Mullen G L, and Turnwald G, Dickson Polynomials, Longman Scientific and Technical, Essex, United Kingdom, 1993.MATH [5]Hou X D, Mullen G L, and Turnwald G, Reversed Dickson polynomial over finite fiels, Finite Fields Appl., 2009, 15: 748–773.CrossRef MathSciNet MATH [6]Nyberg K, Differentially uniform mapping for cryptography, Advances in Cryptology — EUROCRYPT 1993, Springer-Verlag, New York, 1993. [7]Ding C S, Cyclic codes from some monomials and trinomials, SIAM J. Discr. Math., 2013, 27(4): 1977–1994.CrossRef MATH [8]Coulter R S and Matthews R W, Dembowski-Ostrom polynomial from Dickson polynomials, Finite Fields Appl., 2010, 16: 369–379.CrossRef MathSciNet MATH [9]Lidl R and Niederreiter H, Finite Fields, 2nd Edition, Cambirdge University Press, Cambridge, 1997. [10]Wu B F, Linearized and linearized derived permutation polynomials over finite fields and their compositional inverses, Doctor’s Degree Thesis, University of Chinese Academy of Sciences, Beijing, 2013. [11]MacWilliams F J and Sloane N, The Theory of Error-Correcting Codes, North Holland Publishing Co., Amsterdam, 1997. [12]Gold R, Maximal recursive sequences with 3-valued recursive crosscorrelation functions, IEEE Trans. Inform Theory, 1968, 14(1): 377–385.CrossRef [13]Berger T P, Canteaut A, Charpin P, and Laigle-Chapuy Y, On almost perfect nonlinear functons over F2, IEEE Trans. Inform Theory, 2006, 52(9): 4160–4170.CrossRef MathSciNet MATH [14]Wu B F, Liu Z J, Jin Q F, and Zhang X M, A note on two classes of Boolean functions with optimal algebraic immunity, Journal of Systems Science and Complexity, 2014, 27(4): 785–794.CrossRef MathSciNet
作者单位:Xiaoming Zhang (1) Baofeng Wu (1) (2) Zhuojun Liu (1)
1. Key Laboratory of Mathematics Mechanization, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, 100190, China 2. State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, 100093, China
刊物类别:Mathematics and Statistics
刊物主题:Systems Theory and Control Applied Mathematics and Computational Methods of Engineering Operations Research/Decision Theory Probability Theory and Stochastic Processes
出版者:Academy of Mathematics and Systems Science, Chinese Academy of Sciences, co-published with Springer
ISSN:1559-7067
文摘
This paper gives a full classification of Dembowski-Ostrom polynomials derived from the compositions of reversed Dickson polynomials and monomials over finite fields of characteristic 2. The authors also classify almost perfect nonlinear functions among all such Dembowski-Ostrom polynomials based on a general result describing when the composition of an arbitrary linearized polynomial and a monomial of the form \({x^{1 + {2^\alpha }}}\) is almost perfect nonlinear. It turns out that almost perfect nonlinear functions derived from reversed Dickson polynomials are all extended affine equivalent to the well-known Gold functions. Keywords Almost perfect nonlinear function Dembowski-Ostrom polynomial linearized polynomial reversed Dickson polynomial