Regular complete permutation polynomials over F₂^n
DOI10.1007/S10623-021-00992-3zbMATH Open1492.11164OpenAlexW4221013634WikidataQ114849822 ScholiaQ114849822MaRDI QIDQ2115736FDOQ2115736
Shasha Zhang, Xiaofang Xu, Xiangyong Zeng
Publication date: 21 March 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-021-00992-3
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
Cryptography (94A60) Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55)
Cites Work
- PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications
- Handbook of finite fields
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cyclotomy and permutation polynomials of large indices
- Cyclotomic Mapping Permutation Polynomials over Finite Fields
- Cyclotomic \(\mathcal R\)-orthomorphisms of finite fields
- On constructing permutations of finite fields
- Title not available (Why is that?)
- Block substitutions using orthomorphic mappings
- Title not available (Why is that?)
- Partitions of groups and complete mappings
- Title not available (Why is that?)
- Investigations on Bent and Negabent Functions via the Nega-Hadamard Transform
- Permutation polynomials and applications to coding theory
- New classes of complete permutation polynomials
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- Title not available (Why is that?)
- A note on complete polynomials over finite fields and their applications in cryptography
- Title not available (Why is that?)
- Quadratic permutations, complete mappings and mutually orthogonal latin squares
- Permutations on finite fields with invariant cycle structure on lines
- Dickson polynomials that are involutions
- Involutions Over the Galois Field
- On the cycle structure of permutation polynomials
- Cycle structure of permutation functions over finite fields and their applications
- Cycle structure of automorphisms of finite cyclic groups
- Further results on permutation polynomials of the form \((x^{p^m}-x+\delta)^s+x\) over \(\mathbb{F}_{p^{2m}}\)
- A note on inverses of cyclotomic mapping permutation polynomials over finite fields
- Fast Software Encryption
- On the constructions of \(n\)-cycle permutations
- Characterizations and constructions of triple-cycle permutations of the form \(x^rh(x^s)\)
- Further results on complete permutation monomials over finite fields
- New constructions of involutions over finite fields
- Dickson permutation polynomials that decompose in cycles of the same length
Cited In (6)
- Permutation polynomials with Carlitz rank 2
- On a Class of Permutation Polynomials over $\mathbb{F}_{2^n}$
- A general construction of regular complete permutation polynomials
- Title not available (Why is that?)
- Maximal complete permutations over \(\mathbb{F}_2^n \)
- On inverses of permutation polynomials of the form \(x(x^s-a)^{(q^m-1)/s}\) over \(\mathbb{F}_{q^n}\)
Uses Software
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)
