Linear permutations and their compositional inverses over 𝔽qn

DOI10.1142/S0219498822502206MaRDI QIDQ5039764zbMATH OpenFDO

Authors Gustavo Terra Bastos

Publication date 4 October 2022

Published in Journal of Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2005.14349

zbMATH Keywords

involutionspermutation polynomialsprimitive idempotents

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Arithmetic theory of polynomial rings over finite fields (11T55)

Recommendations

• Permutation polynomials and their compositional inverses over finite fields by a local method
• New constructions of involutions over finite fields
• On the inverses of some classes of permutations of finite fields
• On inverses of permutation polynomials of the form \(x(x^s-a)^{(q^m-1)/s}\) over \(\mathbb{F}_{q^n}\)
• Nilpotent linearized polynomials over finite fields and applications

Cites work

• scientific article; zbMATH DE number 3779459 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 967590 (Why is no real title available?)
• A \(q\)-polynomial approach to cyclic codes
• A characterization of cyclic subspace codes via subspace polynomials
• A note on linear permutation polynomials
• A note on linearized polynomials and the dimension of their kernels
• An introduction to group rings
• Coding for Errors and Erasures in Random Network Coding
• Compositional inverses and complete mappings over finite fields
• Constructions of Involutions Over Finite Fields
• Idempotents in group algebras and minimal abelian codes
• Involutions Over the Galois Field
• Linearized polynomials over finite fields revisited
• New constructions of involutions over finite fields
• Nilpotent linearized polynomials over finite fields and applications
• On Inverses of Permutation Polynomials of Small Degree Over Finite Fields
• On constructing permutations of finite fields
• On inversion in \(\mathbb Z_{{2^n}-1}\)
• PRINCE -- a low-latency block cipher for pervasive computing applications. Extended abstract
• Permutation and complete permutation polynomials

Cited in

(5)

• Nilpotent linearized polynomials over finite fields, revisited
• On linear representation, complexity and inversion of maps over finite fields
• Affine equivalence and non-linearity of permutations over \(\mathbb Z_n\)
• Linear Permutations and their Compositional Inverses over $\mathbb{F}_{q^n}$
• Compositional inverses of AGW-PPs -- dedicated to Professor Cunsheng Ding for his 60th birthday

Describes a project that uses

Uses Software

• PRINCE

This page was built for publication: Linear permutations and their compositional inverses over 𝔽qn

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5039764)