Finite fields
Almost perfect nonlinear power functions on GF (2n): the Niho case
Information and Computation
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
On a Class of Permutation Polynomials over $\mathbb{F}_{2^n}$
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
Some results concerning cryptographically significant mappings over GF(2n)
Designs, Codes and Cryptography
New families of differentially 4-uniform permutations over F22k
SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
| Hi-index | 0.00 |
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.