Welcome to the resource topic for 2009/393
Title:
Permutation Polynomials modulo p^n}
Authors: Rajesh P Singh, Soumen Maity
Abstract:A polynomial f over a finite ring R is called a \textit{permutation polynomial} if the mapping R\rightarrow R defined by f is one-to-one. In this paper we consider the problem of characterizing permutation polynomials; that is, we seek conditions on the coefficients of a polynomial which are necessary and sufficient for it to represent a permutation. We also present a new class of permutation binomials over finite field of prime order.
ePrint: https://eprint.iacr.org/2009/393
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .