On Cryptographically Significant Mappings over GF(2 n )
From MaRDI portal
Recommendations
- Some results concerning cryptographically significant mappings over \(\text{GF}(2^{n})\)
- On Almost Perfect Nonlinear Permutations
- Trace representations of S-boxes and their application
- Low differentially uniform permutations from the Dobbertin APN function over \(\mathbb{F}_{2^n} \)
- A highly nonlinear differentially 4 uniform power mapping that permutes fields of even degree
Cites work
- Affinity of permutations of \(\mathbb F_{2}^{n}\)
- Almost perfect nonlinear power functions on \(\mathrm{GF}(2^n)\): the Niho case.
- Almost perfect nonlinear power functions on GF(2/sup n/): the Welch case
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Complexity of problems in games, graphs and algebraic equations
- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
- Differential cryptanalysis of DES-like cryptosystems
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
- Fast Software Encryption
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 1088929 (Why is no real title available?)
- scientific article; zbMATH DE number 1942409 (Why is no real title available?)
- scientific article; zbMATH DE number 1950612 (Why is no real title available?)
- scientific article; zbMATH DE number 2151220 (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?)
- New classes of almost bent and almost perfect nonlinear polynomials
- On Exact Algebraic [Non-]Immunity of S-Boxes Based on Power Functions
- On the Generalized Linear Equivalence of Functions Over Finite Fields
- The Simplest Method for Constructing APN Polynomials EA-Inequivalent to Power Functions
- Using Wiedemann’s Algorithm to Compute the Immunity Against Algebraic and Fast Algebraic Attacks
Cited in
(16)- Security of most significant bits of \(g^{x^{2}}\).
- Some results concerning cryptographically significant mappings over \(\text{GF}(2^{n})\)
- New classes of permutation trinomials over \(\mathbb{F}_{q^3}\)
- On EA-equivalence of certain permutations to power mappings
- On some probabilistic approximations for AES-like S-boxes
- On permutation polynomials of the form \(x^{1+2^k}+L(x)\)
- On 3-to-1 and Power APN S-Boxes
- scientific article; zbMATH DE number 1322886 (Why is no real title available?)
- Trace representations of S-boxes and their application
- Selected Areas in Cryptography
- Decomposition of Dillon's APN permutation with efficient hardware implementation
- Coefficient grouping for complex affine layers
- Some classes of permutation binomials and trinomials of index \(q-1\) over \(\mathbb{F}_{q^n}\)
- Algebraic properties of the maps \(\chi_n\)
- Permutation polynomials EA-equivalent to the inverse function over \(\mathrm{GF}(2^n)\)
- Rotation symmetry in algebraically generated cryptographic substitution tables
This page was built for publication: On Cryptographically Significant Mappings over GF(2 n )
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3519562)
