Decomposition of Dillon's APN permutation with efficient hardware implementation
From MaRDI portal
Recommendations
- Cryptanalysis of a Theorem: Decomposing the Only Known Solution to the Big APN Problem
- A complete permutation over \(\mathrm{GF}(2^{2m})\) with easy hardware implementation and the best known cryptography properties
- On Almost Perfect Nonlinear Permutations
- On decompositions of permutation polynomials into quadratic and cubic power permutations
- On Cryptographically Significant Mappings over GF(2 n )
Cites work
- A New Family of APN Quadrinomials
- A note on APN permutations in even dimension
- Affinity of permutations of \(\mathbb F_{2}^{n}\)
- Classes of Quadratic APN Trinomials and Hexanomials and Related Structures
- 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
- scientific article; zbMATH DE number 5831605 (Why is no real title available?)
- scientific article; zbMATH DE number 5862915 (Why is no real title available?)
- scientific article; zbMATH DE number 708833 (Why is no real title available?)
- scientific article; zbMATH DE number 1088929 (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?)
- On the EA-classes of known APN functions in small dimensions
- Parallel multipliers based on special irreducible pentanomials
This page was built for publication: Decomposition of Dillon's APN permutation with efficient hardware implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169017)