We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
International Association for Cryptologic Research (IACR)
Abstract
A polynomial f over a finite ring R is called a
\textit{permutation polynomial} if the mapping Rβ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
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.