论文信息 - A Note on a Class of Quadratic Permutations over F2n

A Note on a Class of Quadratic Permutations over F2n

Finding new classes of permutation polynomials is a challenging problem. Blockhuis at al. investigated the permutation behavior of polynomials of the form Σi=0 n-1 aiX2i+1 over F2n. In this paper, we extend their results and propose as a new conjecture that if n= 2e then X2 is the only unitary permutation polynomial of this type.

Yann Laigle-Chapuy | Yann Laigle-Chapuy

[1] Marie Henderson,et al. Permutations amongst the Dembowski-Ostrom polynomials , 2001 .

[2] R. Lidl,et al. When does a polynomial over a finite field permute the elements of the fields , 1988 .

[3] Anne Canteaut,et al. Almost Perfect Nonlinear functions , 2005 .

[4] Ueli Maurer,et al. Advances in Cryptology — EUROCRYPT ’96 , 2001, Lecture Notes in Computer Science.

[5] Hans Dobbertin,et al. Almost Perfect Nonlinear Power Functions on GF(2n): The Niho Case , 1999, Inf. Comput..

[6] Jacques Patarin,et al. Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms , 1996, EUROCRYPT.

[7] Claude Carlet,et al. A class of quadratic APN binomials inequivalent to power functions , 2006, IACR Cryptol. ePrint Arch..

[8] Rudolf Lide,et al. Finite fields , 1983 .