A Generalisation of Dillon's APN Permutation With the Best Known Differential and Nonlinear Properties for All Fields of Size 2^{4k+2}
From MaRDI portal
Publication:4566580
DOI10.1109/TIT.2017.2676807zbMATH Open1390.94813MaRDI QIDQ4566580FDOQ4566580
Authors: Anne Canteaut, Sèbastien Duval, Léo Perrin
Publication date: 27 June 2018
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Recommendations
- On non-monomial APcN permutations over finite fields of even characteristic
- Constructing differentially 4-uniform permutations over \(\mathrm{GF}(2^{2m})\) from quadratic APN permutations over \(\mathrm{GF}(2^{2m+1})\)
- Low differentially uniform permutations from the Dobbertin APN function over \(\mathbb{F}_{2^n} \)
- A note on APN permutations in even dimension
- Permutational behavior of reversed Dickson polynomials over finite fields. II
- On the Differential Uniformity and Nonlinearity of a Class of Permutation Quadrinomials Over $\mathbb{F}_{2^{2m}}$
- New Permutation Reversed Dickson Polynomials over Finite Fields
- Calculation and construction of permutations with low differential uniformity over finite fields
- Constructing new piecewise differentially 4-uniform permutations from known APN functions
- scientific article; zbMATH DE number 7691432
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Combinatorial codes (94B25)
Cited In (19)
- On second-order derivatives of Boolean functions and cubic APN permutations in even dimension
- Wave-shaped round functions and primitive groups
- Involutory differentially 4-uniform permutations from known constructions
- Cryptographically strong permutations from the butterfly structure
- On CCZ-equivalence, extended-affine equivalence, and function twisting
- A note on ``Cryptographically strong permutations from the butterfly structure
- Determining the Walsh spectra of Taniguchi's and related APN-functions
- Cryptographic functions with interesting properties from CCZ-equivalence
- On an algorithm generating 2-to-1 APN functions and its applications to ``The big APN problem
- On constructing APN permutations using subfunctions
- If a generalised butterfly is APN then it operates on 6 bits
- New design techniques for efficient arithmetization-oriented hash functions: \texttt{Anemoi} permutations and \texttt{Jive} compression mode
- A further study on bridge structures and constructing bijective S-boxes for low-latency masking
- Survey on recent trends towards generalized differential and boomerang uniformities
- On permutation quadrinomials with boomerang uniformity 4 and the best-known nonlinearity
- Several classes of linear codes with few weights from the closed butterfly structure
- More low differential uniformity permutations over \(\mathbb{F}_{2^{2 k}}\) with \(k\) odd
- A further study of quadratic APN permutations in dimension nine
- Completely characterizing a class of permutation quadrinomials
This page was built for publication: A Generalisation of Dillon's APN Permutation With the Best Known Differential and Nonlinear Properties for All Fields of Size $2^{4k+2}$
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4566580)