A note on APN permutations in even dimension
From MaRDI portal
Publication:2363313
DOI10.1016/j.ffa.2017.02.001zbMath1420.94043arXiv1511.08101OpenAlexW3103267132MaRDI QIDQ2363313
Irene Villa, Marco Calderini, Massimiliano Sala
Publication date: 13 July 2017
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.08101
Related Items
On CCZ-inequivalence of some families of almost perfect nonlinear functions to permutations, On relations between CCZ- and EA-equivalences, Decomposition of Dillon's APN permutation with efficient hardware implementation, Wave-shaped round functions and primitive groups, Primitivity of the group of a cipher involving the action of the key-schedule, On an algorithm generating 2-to-1 APN functions and its applications to ``The big APN problem, On the linear structures of balanced functions and quadratic APN functions, On known constructions of APN and AB functions and their relation to each other
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On weakly APN functions and 4-bit S-boxes
- On weak differential uniformity of vectorial Boolean functions as a cryptographic criterion
- Differential cryptanalysis of DES-like cryptosystems
- On some block ciphers and imprimitive groups
- On the classification of APN functions up to dimension five
- Constructing new APN functions from known ones
- Partially-bent functions
- Affinity of permutations of \(\mathbb F_{2}^{n}\)
- Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms — Design andAnalysis
- The Nonexistence of Permutations EA-Equivalent to Certain AB Functions
- New classes of almost bent and almost perfect nonlinear polynomials
- On Almost Perfect Nonlinear Functions Over$mmb F_2^n$
- Markov Ciphers and Differential Cryptanalysis
- SAFER K-64: A byte-oriented block-ciphering algorithm
- Serpent: A New Block Cipher Proposal
