Metraipolis › archive › dc_ba9435f73cf3
Constructions of complete permutations over $\mathbb{F}_q^n$ — arXiv:2609.05564
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.05564
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T13:40:02.476Z
- SHA-256 of the archived text
64a6cae3f24ee8468ac70f94eec1152ff6ce72269ecbf3a5c1e563f9190915ed- Stable URL of this page
https://metraipolis.com/documento/dc_ba9435f73cf3
How to cite
Constructions of complete permutations over $\mathbb{F}_q^n$ — arXiv:2609.05564 — arXiv (en), https://arxiv.org/abs/2609.05564 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ba9435f73cf3 (Metraipolis archive dc_ba9435f73cf3, sha256 64a6cae3f24ee8468ac70f94eec1152ff6ce72269ecbf3a5c1e563f9190915ed)
BibTeX
@misc{dcba9435f73cf3,
title = {Constructions of complete permutations over $mathbbF_q^n$ — arXiv:2609.05564},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.05564},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ba9435f73cf3; sha256 64a6cae3f24ee8468ac70f94eec1152ff6ce72269ecbf3a5c1e563f9190915ed},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.05564. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Complete permutation polynomials play an important role in cryptography, particularly in the design of cryptographic primitives such as the Lai--Massey scheme and S-boxes. We generalize a result of Sun, Li, Guo, and Qu (2021) by characterizing the complete permutation behavior of the mapping $\Psi(X)=M(X+\psi(AX))$ over $\mathbb{F}_q^n$, where $\mathbb{F}_q$ is a finite field of $q$ elements with $q$ being a prime power, $M\in GL(n, \mathbb{F}_q)$, $GL(n, \mathbb{F}_q)$ is the general linear group of order $n$ over $\mathbb{F}_q$, $A_{m \times n}$ is a full-rank matrix over $\mathbb{F}_q$, and $\psi=(\psi_1,\psi_2,\ldots,\psi_n)$ with each component function $\psi_i:\mathbb{F}_q^m\to\mathbb{F}_q$. Furthermore, we establish criteria for the permutation and complete permutation properties of the mapping $F(X)=T(X+B^tf(AX))$ over $\mathbb{F}_{q}^n$, $f: \mathbb{F}_{q}^{m} \rightarrow \mathbb{F}_{q}^{n-m}$, $T \in GL(n, \mathbb{F}_q)$, $A_{m \times n}$ and $B_{(n-m)\times n}$ are full-rank matrices over $\mathbb{F}_q$, $B^t$ represents the transpose of the matrix $B$, and $0<m<n$ are integers. These results also generalize an earlier result of Gravel and Panario (2023), who showed that any arbitrary function $f$ from $\mathbb{F}_q^m$ to $\mathbb{F}_q^{\,n-m}$ can be extended to a bijection over $\mathbb{F}_{q}^n$ through the mapping $F(X)=T(X+B^tf(AX))$, under the condition $AB^t=0$. Here we do not impose the restriction that $AB^t=0$.
Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-09-09 in cs.CR).
Categorie arXiv: Cryptography and Security (cs.CR) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.05564 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T13:09:48.387Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).