Cryptology ePrint Archive: Report 2009/393

Permutation Polynomials modulo $p^n$}

Rajesh P Singh and 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.

Category / Keywords: foundations /

Date: received 11 Aug 2009

Contact author: r pratap at iitg ernet in

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20090815:023935 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]