A general construction of regular complete permutation polynomials
From MaRDI portal
Abstract: Let be a positive integer and the finite field with elements. In this paper, we consider the -regular complete permutation property of maps with the form where is a PP over an extension field and is an invertible linear map over . We give a general construction of -regular PPs for any positive integer . When is additive, we give a general construction of -regular CPPs for any positive integer . When is not additive, we give many examples of regular CPPs over the extension fields for and for arbitrary odd positive integer . These examples are the generalization of the first class of -regular CPPs constructed by Xu, Zeng and Zhang (Des. Codes Cryptogr. 90, 545-575 (2022)).
Recommendations
Cites work
- A family of difference sets in non-cyclic groups
- A family of skew Hadamard difference sets
- A note on complete polynomials over finite fields and their applications in cryptography
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- Almost perfect nonlinear power functions on \(\mathrm{GF}(2^n)\): the Niho case.
- Almost perfect nonlinear power functions on GF(2/sup n/): the Welch case
- Analysis of involutional ciphers: Khazad and Anubis.
- Block substitutions using orthomorphic mappings
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Constructing permutations and complete permutations over finite fields via subfield-valued polynomials
- Coset-wise affine functions and cycle types of complete mappings
- Cycle indices of linear, affine, and projective groups
- Cycle structure of automorphisms of finite cyclic groups
- Cycle structure of permutation functions over finite fields and their applications
- Cyclic codes from some monomials and trinomials
- Determination of a type of permutation trinomials over finite fields. II
- Dickson permutation polynomials that decompose in cycles of the same length
- scientific article; zbMATH DE number 1703931 (Why is no real title available?)
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- scientific article; zbMATH DE number 5578168 (Why is no real title available?)
- scientific article; zbMATH DE number 3779459 (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 1504535 (Why is no real title available?)
- scientific article; zbMATH DE number 6900650 (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?)
- Investigations on Bent and Negabent Functions via the Nega-Hadamard Transform
- Involutions Over the Galois Field
- Loiss: A Byte-Oriented Stream Cipher
- On generalized strong complete mappings and mutually orthogonal Latin squares
- On the Behaviors of Affine Equivalent Sboxes Regarding Differential and Linear Attacks
- On the constructions of n-cycle permutations
- On the need for multipermutations: Cryptanalysis of MD4 and SAFER
- Permutation polynomials and translation planes of even order
- Permutation polynomials in RSA-cryptosystems
- Permutation trinomials over finite fields with even characteristic
- Regular complete permutation polynomials over \(\mathbb{F}_{2^n} \)
- Shapeless quasigroups derived by Feistel orthomorphisms
- The Construction of Orthogonal Latin Squares
Cited in
(4)
This page was built for publication: A general construction of regular complete permutation polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6109698)