Regular complete permutation polynomials over \(\mathbb{F}_{2^n} \)

DOI10.1007/s10623-021-00992-3zbMath1492.11164OpenAlexW4221013634WikidataQ114849822 ScholiaQ114849822MaRDI QIDQ2115736

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

zbMATH Keywords

finite fieldcycle structureregular complete permutation polynomial

Mathematics Subject Classification ID

Cryptography (94A60) Polynomials over finite fields (11T06) Arithmetic theory of polynomial rings over finite fields (11T55)

Related Items (2)

A general construction of regular complete permutation polynomials ⋮ On inverses of permutation polynomials of the form \(x(x^s-a)^{(q^m-1)/s}\) over \(\mathbb{F}_{q^n}\)

Uses Software

• PRINCE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cyclotomic \(\mathcal R\)-orthomorphisms of finite fields
• On constructing permutations of finite fields
• Permutation polynomials and applications to coding theory
• On the cycle structure of permutation polynomials
• Partitions of groups and complete mappings
• New classes of complete permutation polynomials
• Further results on permutation polynomials of the form \((x^{p^m}-x+\delta)^s+x\) over \(\mathbb{F}_{p^{2m}}\)
• Cycle structure of permutation functions over finite fields and their applications
• Block substitutions using orthomorphic mappings
• Characterizations and constructions of triple-cycle permutations of the form \(x^rh(x^s)\)
• On the constructions of \(n\)-cycle permutations
• New constructions of involutions over finite fields
• Permutations on finite fields with invariant cycle structure on lines
• A note on inverses of cyclotomic mapping permutation polynomials over finite fields
• Further results on complete permutation monomials over finite fields
• A note on complete polynomials over finite fields and their applications in cryptography
• Cyclotomy and permutation polynomials of large indices
• Dickson polynomials that are involutions
• Handbook of Finite Fields
• Involutions Over the Galois Field
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications
• Investigations on Bent and Negabent Functions via the Nega-Hadamard Transform
• Quadratic permutations, complete mappings and mutually orthogonal latin squares
• Cyclotomic Mapping Permutation Polynomials over Finite Fields
• Cycle structure of automorphisms of finite cyclic groups
• Fast Software Encryption

This page was built for publication: Regular complete permutation polynomials over \(\mathbb{F}_{2^n} \)