On Cryptographically Significant Mappings over GF(2 n )
From MaRDI portal
Publication:3519562
DOI10.1007/978-3-540-69499-1_16zbMath1247.94029MaRDI QIDQ3519562
Publication date: 19 August 2008
Published in: Arithmetic of Finite Fields (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69499-1_16
94A60: Cryptography
Related Items
Permutation polynomials EA-equivalent to the inverse function over \(\mathrm{GF}(2^n)\), Some results concerning cryptographically significant mappings over \(\text{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
- Unnamed Item
- Unnamed Item
- Differential cryptanalysis of DES-like cryptosystems
- Complexity of problems in games, graphs and algebraic equations
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Almost perfect nonlinear power functions on \(\mathrm{GF}(2^n)\): the Niho case.
- Affinity of permutations of \(\mathbb F_{2}^{n}\)
- New classes of almost bent and almost perfect nonlinear polynomials
- Efficient Computation of Algebraic Immunity for Algebraic and Fast Algebraic Attacks
- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
- Almost perfect nonlinear power functions on GF(2/sup n/): the Welch case
- 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
- On the Generalized Linear Equivalence of Functions Over Finite Fields
- Fast Software Encryption
- On Exact Algebraic [Non-Immunity of S-Boxes Based on Power Functions]
