On Cryptographically Significant Mappings over GF(2 n )

DOI10.1007/978-3-540-69499-1_16zbMath1247.94029OpenAlexW2150035791MaRDI QIDQ3519562

Enes Pašalić

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

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

On permutation polynomials of the formx^1+2k+ L(x) ⋮ On EA-equivalence of certain permutations to power mappings ⋮ Some results concerning cryptographically significant mappings over \(\text{GF}(2^{n})\) ⋮ Permutation polynomials EA-equivalent to the inverse function over \(\mathrm{GF}(2^n)\) ⋮ New classes of permutation trinomials over \(\mathbb{F}_{q^3}\)

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]

This page was built for publication: On Cryptographically Significant Mappings over GF(2 n )