A Note on a Class of Quadratic Permutations over ${\mathbb F}_{{2^n}}$
From MaRDI portal
Publication:5386086
DOI10.1007/978-3-540-77224-8_17zbMath1195.11159OpenAlexW2188285871MaRDI QIDQ5386086
Publication date: 17 April 2008
Published in: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77224-8_17
Related Items (11)
Permutation polynomials over finite fields involving \(x+x^q+\cdots +x^{q^{a-1}}\) ⋮ Some results on complete permutation polynomials and mutually orthogonal Latin squares ⋮ Some results concerning cryptographically significant mappings over \(\text{GF}(2^{n})\) ⋮ The compositional inverse of a class of bilinear permutation polynomials over finite fields of characteristic 2 ⋮ Compositional inverses of permutation polynomials of the form \(x^rh(x^s)\) over finite fields ⋮ Compositional inverses and complete mappings over finite fields ⋮ Planarity of products of two linearized polynomials ⋮ Bent Functions in $$\mathcal C$$ and $$\mathcal D$$ Outside the Completed Maiorana-McFarland Class ⋮ On a Class of Permutation Polynomials over $\mathbb{F}_{2^n}$ ⋮ Permutation polynomials over finite fields -- a survey of recent advances ⋮ On constructing complete permutation polynomials over finite fields of even characteristic
Cites Work
- Unnamed Item
- Almost perfect nonlinear power functions on \(\mathrm{GF}(2^n)\): the Niho case.
- Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms
- On Almost Perfect Nonlinear Functions Over$mmb F_2^n$
- Two Classes of Quadratic APN Binomials Inequivalent to Power Functions
- When Does a Polynomial over a Finite Field Permute the Elements of the Field?, II
This page was built for publication: A Note on a Class of Quadratic Permutations over ${\mathbb F}_{{2^n}}$
