Some results concerning cryptographically significant mappings over \(\text{GF}(2^{n})\)
From MaRDI portal
Publication:1960215
DOI10.1007/s10623-010-9365-0zbMath1197.94201MaRDI QIDQ1960215
Publication date: 13 October 2010
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-010-9365-0
94A60: Cryptography
Related Items
Permutation polynomials EA-equivalent to the inverse function over \(\mathrm{GF}(2^n)\), On EA-equivalence of certain permutations to power mappings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New cyclic difference sets with Singer parameters
- Differential cryptanalysis of DES-like cryptosystems
- On ``bent functions
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Affinity of permutations of \(\mathbb F_{2}^{n}\)
- On Cryptographically Significant Mappings over GF(2 n )
- New classes of almost bent and almost perfect nonlinear polynomials
- A new APN function which is not equivalent to a power mapping
- Monomial bent functions
- On Almost Perfect Nonlinear Functions Over$mmb F_2^n$
- On a Class of Permutation Polynomials over $\mathbb{F}_{2^n}$
- Hyperbent Functions, Kloosterman Sums, and Dickson Polynomials
- Cubic Monomial Bent Functions: A Subclass of $\mathcal{M}$
- On plateaued functions
- Almost perfect nonlinear power functions on GF(2/sup n/): the Welch case
- An Infinite Class of Balanced Vectorial Boolean Functions with Optimum Algebraic Immunity and Good Nonlinearity
- A Note on a Class of Quadratic Permutations over ${\mathbb F}_{{2^n}}$
- The Simplest Method for Constructing APN Polynomials EA-Inequivalent to Power Functions
- On the Generalized Linear Equivalence of Functions Over Finite Fields
