Linear permutations and their compositional inverses over 𝔽qn

DOI10.1142/S0219498822502206MaRDI QIDQ5039764

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

involutionsprimitive idempotentspermutation polynomials

Mathematics Subject Classification ID

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

Uses Software

• PRINCE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compositional inverses and complete mappings over finite fields
• On constructing permutations of finite fields
• A note on linear permutation polynomials
• A note on linearized polynomials and the dimension of their kernels
• Idempotents in group algebras and minimal abelian codes
• An introduction to group rings
• Nilpotent linearized polynomials over finite fields and applications
• A \(q\)-polynomial approach to cyclic codes
• Permutation and complete permutation polynomials
• New constructions of involutions over finite fields
• A characterization of cyclic subspace codes via subspace polynomials
• On inversion in \(\mathbb Z_{{2^n}-1}\)
• Linearized polynomials over finite fields revisited
• Involutions Over the Galois Field
• Coding for Errors and Erasures in Random Network Coding
• PRINCE – A Low-Latency Block Cipher for Pervasive Computing Applications
• Constructions of Involutions Over Finite Fields
• On Inverses of Permutation Polynomials of Small Degree Over Finite Fields

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