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_4zbMATH Open1391.94789OpenAlexW2503574445MaRDI QIDQ2829212FDOQ2829212
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
Cites Work
- Reverse-Engineering the S-Box of Streebog, Kuznyechik and STRIBOBr1
- Relating three nonlinearity parameters of vectorial functions and building APN functions from bent functions
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Binomial differentially 4 uniform permutations with high nonlinearity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Differential cryptanalysis of DES-like cryptosystems
- Constructing differentially 4-uniform permutations over \(\mathrm{GF}(2^{2m})\) from quadratic APN permutations over \(\mathrm{GF}(2^{2m+1})\)
- New classes of almost bent and almost perfect nonlinear polynomials
- A highly nonlinear differentially 4 uniform power mapping that permutes fields of even degree
- Perfect nonlinear functions and cryptography
- Integral and Multidimensional Linear Distinguishers with Correlation Zero
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- A new approach to block cipher design
- Constructing S-boxes for Lightweight Cryptography with Feistel Structure
- On Reverse-Engineering S-Boxes with Hidden Design Criteria or Structure
Cited In (25)
- On second-order derivatives of Boolean functions and cubic APN permutations in even dimension
- On a conjecture on APN permutations
- 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
- 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
- Decomposition of Dillon's APN permutation with efficient hardware implementation
- If a generalised butterfly is APN then it operates on 6 bits
- A method to calculate differential uniformity for permutations
- New design techniques for efficient arithmetization-oriented hash functions: \texttt{Anemoi} permutations and \texttt{Jive} compression mode
- Implicit Quadratic Property of Differentially 4-Uniform Permutations
- Survey on recent trends towards generalized differential and boomerang uniformities
- On decompositions of permutation polynomials into quadratic and cubic power permutations
- Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem
- 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
- Построение подстановок пространства $V_{2m}$ с использованием $(2m,m)$-функций
- Об алгебраической степени и дифференциальной равномерности подстановок пространства $V_{2m}$, построенных с использованием $(2m,m)$-функций
- 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
- A new class of differential 4-uniform permutations from exponential permutation
- ON CONSTRUCTING APN PERMUTATIONS USING SUBFUNCTIONS
Uses Software
Recommendations
- Cryptanalysing the critical group: efficiently solving Biggs's discrete logarithm problem 👍 👎
- Title not available (Why is that?) 👍 👎
- Public Key Cryptography – PKC 2004 👍 👎
- The Diffie-Hellman problem and generalization of Verheul's theorem 👍 👎
- Cryptanalysis of a combinatorial public key cryptosystem 👍 👎
- Cryptanalysis: a survey of recent results 👍 👎
- Cryptanalysis of a Homomorphic Encryption Scheme Over Integers 👍 👎
This page was built for publication: Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829212)