Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem
From MaRDI portal
(Redirected from Publication:2829212)
Recommendations
- Cryptanalysing the critical group: efficiently solving Biggs's discrete logarithm problem
- scientific article; zbMATH DE number 1618047
- 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
Cites work
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 1722688 (Why is no real title available?)
- scientific article; zbMATH DE number 5831605 (Why is no real title available?)
- scientific article; zbMATH DE number 2009947 (Why is no real title available?)
- scientific article; zbMATH DE number 1394292 (Why is no real title available?)
- scientific article; zbMATH DE number 1394295 (Why is no real title available?)
- A highly nonlinear differentially 4 uniform power mapping that permutes fields of even degree
- A new approach to block cipher design
- Binomial differentially 4 uniform permutations with high nonlinearity
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Constructing S-boxes for lightweight cryptography with Feistel structure
- Constructing differentially 4-uniform permutations over \(\mathrm{GF}(2^{2m})\) from quadratic APN permutations over \(\mathrm{GF}(2^{2m+1})\)
- Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem
- Differential cryptanalysis of DES-like cryptosystems
- FIDES: lightweight authenticated cipher with side-channel resistance for constrained hardware
- Integral and multidimensional linear distinguishers with correlation zero
- New classes of almost bent and almost perfect nonlinear polynomials
- On Reverse-Engineering S-Boxes with Hidden Design Criteria or Structure
- Perfect nonlinear functions and cryptography
- Relating three nonlinearity parameters of vectorial functions and building APN functions from bent functions
- Reverse-engineering the S-Bbox of Streebog, Kuznyechik and Stribobr1
Cited in
(32)- 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
- The weight hierarchies of three classes of linear codes
- Arithmetization-oriented APN permutations
- 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
- Adapted spectral-differential method for construction of differentially 4-uniform piecewise-linear permutations, orthomorphisms, and involutions of the field \(\mathbb{F}_{2^n} \)
- On constructing APN permutations using subfunctions
- If a generalised butterfly is APN then it operates on 6 bits
- Decomposition of Dillon's APN permutation with efficient hardware implementation
- Constructing rotatable permutations of \(\mathbb{F}_{2^m}^3\) with \(3\)-homogeneous functions
- New classes of 8-bit permutations based on a butterfly structure
- 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
- Exponential sums in linear cryptanalysis
- 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)$-функций
- \textsf{Polocolo}: a ZK-friendly hash function based on S-boxes using power residues
- 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
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)
