GL(m,2) acting on R(r,m)/R(r−1,m)
Discrete Mathematics
Almost perfect nonlinear power functions on GF (2n): the Niho case
Information and Computation
Codes, Bent Functions and Permutations Suitable For DES-likeCryptosystems
Designs, Codes and Cryptography
Cryptography: Theory and Practice,Second Edition
Cryptography: Theory and Practice,Second Edition
On Cryptographically Significant Mappings over GF(2n)
WAIFI '08 Proceedings of the 2nd international workshop on Arithmetic of Finite Fields
Some results concerning cryptographically significant mappings over GF(2n)
Designs, Codes and Cryptography
On EA-equivalence of certain permutations to power mappings
Designs, Codes and Cryptography
On unbalanced Feistel networks with contracting MDS diffusion
Designs, Codes and Cryptography
Permutation polynomials EA-equivalent to the inverse function over GF (2n)
Cryptography and Communications
Results on rotation-symmetric S-boxes
Information Sciences: an International Journal
The affinity of a permutation of a finite vector space
Finite Fields and Their Applications
Note: Permutation polynomials and their differential properties over residue class rings
Discrete Applied Mathematics
| Hi-index | 0.00 |
It was conjectured that if n is even, then every permutation of F"2^n is affine on some 2-dimensional affine subspace of F"2^n. We prove that the conjecture is true for n=4, for quadratic permutations of F"2^n and for permutation polynomials of F"2"^"n with coefficients in F"2"^"n"^"/"^"2. The conjecture is actually a claim about (AGL(n,2),AGL(n,2))-double cosets in permutation group S(F"2^n) of F"2^n. We give a formula for the number of (AGL(n,2),AGL(n,2))-double cosets in S(F"2^n) and classify the (AGL(4,2),AGL(4,2))-double cosets in S(F"2^4).