On a Class of Permutation Polynomials over $\mathbb{F}_{2^n}$

DOI10.1007/978-3-540-85912-3_32zbMath1180.11038MaRDI QIDQ3600456

Gohar M. Kyureghyan, Pascale Charpin

Publication date: 10 February 2009

Published in: Sequences and Their Applications - SETA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85912-3_32

zbMATH Keywords

trace; Boolean function; linearized polynomial; permutation polynomial; linear structure

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94A55: Shift register sequences and sequences over finite alphabets in information and communication theory

11T06: Polynomials over finite fields

Related Items

When does \(G(x)+\gamma \, \text{Tr}(H(x))\) permute \(\mathbb F_{p^n}\)?, Some results concerning cryptographically significant mappings over \(\text{GF}(2^{n})\), On EA-equivalence of certain permutations to power mappings, Constructing permutations of finite fields via linear translators

Cites Work

• Unnamed Item
• Unnamed Item
• Crooked binomials
• On the propagation criterion for Boolean functions and on bent functions
• Characterization of linear structures
• Crooked maps in \(\mathbb F_{2^n}\)
• Permutation polynomials of the \((x^p - x+\delta)^s+L(x)\)
• A class of permutation polynomials of \(\mathbb F_{2^m}\) related to Dickson polynomials
• A Note on a Class of Quadratic Permutations over ${\mathbb F}_{{2^n}}$