Permutational behavior of reversed Dickson polynomials over finite fields
Kaimin Cheng

TL;DR
This paper investigates the permutation properties of reversed Dickson polynomials over finite fields, extending known results to a broader class and providing explicit evaluations of their moments.
Contribution
It generalizes the permutational behavior analysis of reversed Dickson polynomials to all non-negative k, building on previous methods.
Findings
Explicit evaluation of the first moment of the polynomials.
Extension of permutational behavior results to all k ≥ 0.
Broader understanding of reversed Dickson polynomials over finite fields.
Abstract
In this paper, we use the method developed previously by Hong, Qin and Zhao to obtain several results on the permutational behavior of the reversed Dickson polynomial of the -th kind over the finite field . Particularly, we present the explicit evaluation of the first moment . Our results extend the known results from the case to the general case.
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 · Cryptography and Residue Arithmetic · Cryptographic Implementations and Security
