A method to calculate differential uniformity for permutations
From MaRDI portal
Publication:1647569
DOI10.1007/s10623-017-0412-yzbMath1391.11157OpenAlexW2755497594MaRDI QIDQ1647569
Publication date: 26 June 2018
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-017-0412-y
Related Items (4)
New differentially 4-uniform permutations from modifications of the inverse function ⋮ Differential uniformity of the composition of two functions ⋮ On CCZ-equivalence between the Bracken-Tan-Tan function and power functions ⋮ Constructing differentially 4-uniform involutions over \(\mathbb{F}_{2^{2k}}\) by using Carlitz form
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Binomial differentially 4 uniform permutations with high nonlinearity
- Differentially 4-uniform bijections by permuting the inverse function
- A highly nonlinear differentially 4 uniform power mapping that permutes fields of even degree
- 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})\)
- Constructing new differentially 4-uniform permutations from the inverse function
- Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem
- On Known and New Differentially Uniform Functions
- New classes of almost bent and almost perfect nonlinear polynomials
- Communication Theory of Secrecy Systems*
- Perfect nonlinear S-boxes
- Constructing Differentially 4-Uniform Permutations Over <formula formulatype="inline"><tex Notation="TeX">${\BBF}_{2^{2k}}$</tex> </formula> via the Switching Method
- On the Classification of 4 Bit S-Boxes
This page was built for publication: A method to calculate differential uniformity for permutations
