arXiv (All)
open access
Constructions of complete permutations over $\mathbb{F}_q^n$
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 $Ψ(X)=M
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Permutation polynomials over finite fields from low-degree rational functions#819221
- Permutation polynomials over finite fields from low-degree rational functions#809229
- The differential properties of certain permutation polynomials over finite fields#684157
- The differential properties of certain permutation polynomials over finite fields#682382
- Enumeration of certain permutation group polynomials#784875
Record · ID 972621
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive