Affinity of permutations of F₂^n
From MaRDI portal
Publication:2489926
DOI10.1016/J.DAM.2005.03.022zbMATH Open1089.94020OpenAlexW2023638163MaRDI QIDQ2489926FDOQ2489926
Authors: Xiang-Dong Hou
Publication date: 28 April 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.03.022
Recommendations
- On affine classification of permutations on the space \(\mathrm{GF}(2)^3\)
- The affinity of a permutation of a finite vector space
- [[:Publication:5386086|A Note on a Class of Quadratic Permutations over ${\mathbb F}_Template:2^n$]]
- Permutation polynomials over \(\mathbb{F}_{2^n}\) of the form \((x^{2^i} + x + \delta)^{s_1} +(x^{2^i} + x + \delta)^{s_2} + x\)
- Proof of a conjecture on permutation polynomials over finite fields
general linear grouppermutation groupalmost perfect nonlinear functionquadratic functiongeneral affine group
Cites Work
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Title not available (Why is that?)
- Almost perfect nonlinear power functions on \(\mathrm{GF}(2^n)\): the Niho case.
- Title not available (Why is that?)
- Cryptography. Theory and practice
- \(GL(m,2)\) acting on \(R(r,m)/R(r-1,m)\)
- \(AGL(m,2)\) acting on \(R(r,m)/R(s,m)\)
Cited In (30)
- On second-order derivatives of Boolean functions and cubic APN permutations in even dimension
- Wave-shaped round functions and primitive groups
- Almost perfect nonlinear families which are not equivalent to permutations
- Permutation polynomials EA-equivalent to the inverse function over \(\mathrm{GF}(2^n)\)
- On CCZ-inequivalence of some families of almost perfect nonlinear functions to permutations
- Some results concerning cryptographically significant mappings over \(\text{GF}(2^{n})\)
- Differentially low uniform permutations from known 4-uniform functions
- Primitivity of the group of a cipher involving the action of the key-schedule
- A note on APN permutations in even dimension
- Construction of lightweight S-boxes using Feistel and MISTY structures
- On an algorithm generating 2-to-1 APN functions and its applications to ``The big APN problem
- A triple-error-correcting cyclic code from the Gold and Kasami-Welch APN power functions
- On the differential equivalence of APN functions
- The affinity of a permutation of a finite vector space
- On differential uniformity and nonlinearity of functions
- Decomposition of Dillon's APN permutation with efficient hardware implementation
- On constructing APN permutations using subfunctions
- If a generalised butterfly is APN then it operates on 6 bits
- Title not available (Why is that?)
- A further study on bridge structures and constructing bijective S-boxes for low-latency masking
- Permutation polynomials and their differential properties over residue class rings
- On Cryptographically Significant Mappings over GF(2 n )
- On EA-equivalence of certain permutations to power mappings
- Sparse permutations with low differential uniformity
- On affine classification of permutations on the space \(\mathrm{GF}(2)^3\)
- On permutations that break subspaces of specified dimensions
- Title not available (Why is that?)
- Almost perfect and planar functions
- Nonlinearity of APN functions: comparative analysis and estimates
- Perfect nonlinear functions and cryptography
This page was built for publication: Affinity of permutations of \(\mathbb F_{2}^{n}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489926)