Linear permutations and their compositional inverses over 𝔽qn
From MaRDI portal
Publication:5039764
DOI10.1142/S0219498822502206MaRDI QIDQ5039764FDOQ5039764
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
Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Arithmetic theory of polynomial rings over finite fields (11T55)
Cites Work
- PRINCE -- a low-latency block cipher for pervasive computing applications. Extended abstract
- Title not available (Why is that?)
- Title not available (Why is that?)
- A \(q\)-polynomial approach to cyclic codes
- Linearized polynomials over finite fields revisited
- Coding for Errors and Erasures in Random Network Coding
- Title not available (Why is that?)
- On constructing permutations of finite fields
- Idempotents in group algebras and minimal abelian codes
- An introduction to group rings
- Permutation and complete permutation polynomials
- On inversion in \(\mathbb Z_{{2^n}-1}\)
- A note on linearized polynomials and the dimension of their kernels
- Compositional inverses and complete mappings over finite fields
- A note on linear permutation polynomials
- Constructions of Involutions Over Finite Fields
- Involutions Over the Galois Field
- Nilpotent linearized polynomials over finite fields and applications
- A characterization of cyclic subspace codes via subspace polynomials
- New constructions of involutions over finite fields
- On Inverses of Permutation Polynomials of Small Degree Over Finite Fields
Cited In (3)
Uses Software
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)
