A general construction of regular complete permutation polynomials
From MaRDI portal
Publication:6109698
DOI10.1007/s10623-023-01224-6zbMath1530.11092arXiv2212.12869MaRDI QIDQ6109698
Xiwang Cao, Xia Wu, Wei Lu, Yufei Wang
Publication date: 28 July 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2212.12869
Linear codes (general theory) (94B05) Polynomials over finite fields (11T06) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constructing permutations and complete permutations over finite fields via subfield-valued polynomials
- Determination of a type of permutation trinomials over finite fields. II
- A family of skew Hadamard difference sets
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Cycle indices of linear, affine, and projective groups
- Cycle structure of permutation functions over finite fields and their applications
- Almost perfect nonlinear power functions on \(\mathrm{GF}(2^n)\): the Niho case.
- Block substitutions using orthomorphic mappings
- On the constructions of \(n\)-cycle permutations
- Regular complete permutation polynomials over \(\mathbb{F}_{2^n} \)
- Coset-wise affine functions and cycle types of complete mappings
- A note on complete polynomials over finite fields and their applications in cryptography
- A family of difference sets in non-cyclic groups
- On the Behaviors of Affine Equivalent Sboxes Regarding Differential and Linear Attacks
- Involutions Over the Galois Field
- Loiss: A Byte-Oriented Stream Cipher
- Permutation Trinomials Over Finite Fields with Even Characteristic
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- On the need for multipermutations: Cryptanalysis of MD4 and SAFER
- Almost perfect nonlinear power functions on GF(2/sup n/): the Welch case
- Shapeless quasigroups derived by Feistel orthomorphisms
- Permutation polynomials and translation planes of even order
- Permutation Polynomials in RSA-Cryptosystems
- On generalized strong complete mappings and mutually orthogonal Latin squares
- Investigations on Bent and Negabent Functions via the Nega-Hadamard Transform
- Cyclic Codes from Some Monomials and Trinomials
- Cycle structure of automorphisms of finite cyclic groups
- The Construction of Orthogonal Latin Squares
- Fast Software Encryption
