Regular complete permutation polynomials over F₂^n
From MaRDI portal
Publication:2115736
Recommendations
- Generalizations of complete mappings of finite fields and some applications
- Constructions of complete permutation polynomials
- Maximal complete permutations over \(\mathbb{F}_2^n \)
- A note on complete polynomials over finite fields and their applications in cryptography
- Constructions for a special kind of linear complete mappings
Cites work
- scientific article; zbMATH DE number 1594293 (Why is no real title available?)
- scientific article; zbMATH DE number 1682693 (Why is no real title available?)
- scientific article; zbMATH DE number 61942 (Why is no real title available?)
- scientific article; zbMATH DE number 1088902 (Why is no real title available?)
- scientific article; zbMATH DE number 2124965 (Why is no real title available?)
- scientific article; zbMATH DE number 3422259 (Why is no real title available?)
- scientific article; zbMATH DE number 2238187 (Why is no real title available?)
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- A note on complete polynomials over finite fields and their applications in cryptography
- A note on inverses of cyclotomic mapping permutation polynomials over finite fields
- Analysis of involutional ciphers: Khazad and Anubis.
- Block substitutions using orthomorphic mappings
- Characterizations and constructions of triple-cycle permutations of the form \(x^rh(x^s)\)
- Cycle structure of automorphisms of finite cyclic groups
- Cycle structure of permutation functions over finite fields and their applications
- Cyclotomic Mapping Permutation Polynomials over Finite Fields
- Cyclotomic \(\mathcal R\)-orthomorphisms of finite fields
- Cyclotomy and permutation polynomials of large indices
- Dickson permutation polynomials that decompose in cycles of the same length
- Dickson polynomials that are involutions
- Further results on complete permutation monomials over finite fields
- Further results on permutation polynomials of the form \((x^{p^m}-x+\delta)^s+x\) over \(\mathbb{F}_{p^{2m}}\)
- Handbook of finite fields
- Investigations on Bent and Negabent Functions via the Nega-Hadamard Transform
- Involutions Over the Galois Field
- New classes of complete permutation polynomials
- New constructions of involutions over finite fields
- On constructing permutations of finite fields
- On the constructions of \(n\)-cycle permutations
- On the cycle structure of permutation polynomials
- PRINCE -- a low-latency block cipher for pervasive computing applications. Extended abstract
- Partitions of groups and complete mappings
- Permutation polynomials and applications to coding theory
- Permutations on finite fields with invariant cycle structure on lines
- Quadratic permutations, complete mappings and mutually orthogonal latin squares
Cited in
(8)- Maximal complete permutations over \(\mathbb{F}_2^n \)
- A note on complete polynomials over finite fields and their applications in cryptography
- A general construction of regular complete permutation polynomials
- On a Class of Permutation Polynomials over $\mathbb{F}_{2^n}$
- Permutation polynomials with Carlitz rank 2
- Constructions for a special kind of linear complete mappings
- On inverses of permutation polynomials of the form \(x(x^s-a)^{(q^m-1)/s}\) over \(\mathbb{F}_{q^n}\)
- scientific article; zbMATH DE number 927060 (Why is no real title available?)
This page was built for publication: Regular complete permutation polynomials over \(\mathbb{F}_{2^n} \)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115736)
