Some results concerning cryptographically significant mappings over \(\text{GF}(2^{n})\)

DOI10.1007/s10623-010-9365-0zbMath1197.94201OpenAlexW1994522845MaRDI QIDQ1960215

Pascale Charpin, Enes Pašalić

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

zbMATH Keywords

permutation polynomialsAPN functionsS-boxCCZ-equivalenceEA-equivalencepower mappings

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (10)

Bent and permutational properties of Budaghyan-Carlet hexanomials ⋮ On permutation polynomials of the formx^1+2k+ L(x) ⋮ On EA-equivalence of certain permutations to power mappings ⋮ Four decades of research on bent functions ⋮ Permutation polynomials EA-equivalent to the inverse function over \(\mathrm{GF}(2^n)\) ⋮ On subspaces of Kloosterman zeros and permutations of the form \(L_1(x^{-1})+L_2(x)\) ⋮ Constructing differentially 4-uniform permutations over \(\mathrm{GF}(2^{2m})\) from quadratic APN permutations over \(\mathrm{GF}(2^{2m+1})\) ⋮ On an algorithm generating 2-to-1 APN functions and its applications to ``The big APN problem ⋮ On theorems of Carlitz and Payne on permutation polynomials over finite fields with an application to \(x^{-1}+L(x)\) ⋮ New classes of permutation trinomials over \(\mathbb{F}_{q^3}\)

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

This page was built for publication: Some results concerning cryptographically significant mappings over \(\text{GF}(2^{n})\)