The locally crooked permutations and the complete permutations over F₂^n
From MaRDI portal
Publication:6915696
Cites work
- C-Differentials, Multiplicative Uniformity, and (Almost) Perfect c-Nonlinearity
- A note on complete polynomials over finite fields and their applications in cryptography
- Boolean functions for cryptography and coding theory
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Constructing differentially 4-uniform permutations over \(\mathrm{GF}(2^{2m})\) from quadratic APN permutations over \(\mathrm{GF}(2^{2m+1})\)
- Crooked functions, bent functions, and distance regular graphs
- Differential uniformity of the composition of two functions
- scientific article; zbMATH DE number 3779459 (Why is no real title available?)
- scientific article; zbMATH DE number 503238 (Why is no real title available?)
- scientific article; zbMATH DE number 1455090 (Why is no real title available?)
- New classes of almost bent and almost perfect nonlinear polynomials
- New Constructions of Complete Permutations
- New Instances of Quadratic APN Functions
- Perfect nonlinear S-boxes
- The Construction of Orthogonal Latin Squares
- Two Classes of Quadratic APN Binomials Inequivalent to Power Functions
- Vectorial Bent-Negabent Functions—Their Constructions and Bounds
This page was built for publication: The locally crooked permutations and the complete permutations over \(\mathbb{F}_{2^n}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6915696)