Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem
From MaRDI portal
Publication:2829212
DOI10.1007/978-3-662-53008-5_4zbMath1391.94789OpenAlexW2503574445MaRDI QIDQ2829212
Aleksei Udovenko, Léo Perrin, Alex Biryukov
Publication date: 27 October 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: http://eprint.iacr.org/2016/539
Boolean functionsAPNCCZ-equivalencebutterfly structureFeistel networkbitsliced implementationS-box decomposition
Related Items (23)
Cryptographically strong permutations from the butterfly structure ⋮ A further study of quadratic APN permutations in dimension nine ⋮ Implicit Quadratic Property of Differentially 4-Uniform Permutations ⋮ A method to calculate differential uniformity for permutations ⋮ Survey on recent trends towards generalized differential and boomerang uniformities ⋮ On a conjecture on APN permutations ⋮ If a generalised butterfly is APN then it operates on 6 bits ⋮ On permutation quadrinomials with boomerang uniformity 4 and the best-known nonlinearity ⋮ A new class of differential 4-uniform permutations from exponential permutation ⋮ Cryptographic functions with interesting properties from CCZ-equivalence ⋮ More low differential uniformity permutations over \(\mathbb{F}_{2^{2 k}}\) with \(k\) odd ⋮ Decomposition of Dillon's APN permutation with efficient hardware implementation ⋮ Completely characterizing a class of permutation quadrinomials ⋮ New design techniques for efficient arithmetization-oriented hash functions: \texttt{Anemoi} permutations and \texttt{Jive} compression mode ⋮ On CCZ-equivalence, extended-affine equivalence, and function twisting ⋮ ON CONSTRUCTING APN PERMUTATIONS USING SUBFUNCTIONS ⋮ Several classes of linear codes with few weights from the closed butterfly structure ⋮ On an algorithm generating 2-to-1 APN functions and its applications to ``The big APN problem ⋮ Involutory differentially 4-uniform permutations from known constructions ⋮ Построение подстановок пространства $V_{2m}$ с использованием $(2m,m)$-функций ⋮ Об алгебраической степени и дифференциальной равномерности подстановок пространства $V_{2m}$, построенных с использованием $(2m,m)$-функций ⋮ Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem ⋮ A note on ``Cryptographically strong permutations from the butterfly structure
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Binomial differentially 4 uniform permutations with high nonlinearity
- Differential cryptanalysis of DES-like cryptosystems
- 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})\)
- Relating three nonlinearity parameters of vectorial functions and building APN functions from bent functions
- Perfect nonlinear functions and cryptography
- Reverse-Engineering the S-Box of Streebog, Kuznyechik and STRIBOBr1
- Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem
- Fides: Lightweight Authenticated Cipher with Side-Channel Resistance for Constrained Hardware
- On Reverse-Engineering S-Boxes with Hidden Design Criteria or Structure
- New classes of almost bent and almost perfect nonlinear polynomials
- A new approach to block cipher design
- Integral and Multidimensional Linear Distinguishers with Correlation Zero
- Constructing S-boxes for Lightweight Cryptography with Feistel Structure
This page was built for publication: Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem
