Constructing permutations of finite fields via linear translators
Gohar M. Kyureghyan

TL;DR
This paper introduces new methods for constructing permutation polynomials over finite fields using functions with linear translators, expanding the toolkit for finite field permutations.
Contribution
It presents novel families of permutation polynomials derived from functions with linear translators, offering new constructions in finite field theory.
Findings
Several new families of permutation polynomials are constructed.
The methods leverage functions with linear translators for permutation generation.
The results expand the known classes of permutation polynomials.
Abstract
We describe several families of permutation polynomials obtained using functions with linear translators.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Cryptographic Implementations and Security
