Permutation Polynomials over Zpn and Their Randomness

Yuyin YU  Lishan KE  Zhiqiang LIN  Qiuyan WANG  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E100-A   No.3   pp.913-915
Publication Date: 2017/03/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E100.A.913
Type of Manuscript: LETTER
Category: Information Theory
permutation polynomial,  residue class ring,  single cycle function,  T-function,  

Full Text: PDF>>
Buy this Article

Permutation polynomials over Zpn are useful in the design of cryptographic algorithms. In this paper, we obtain an equivalent condition for polynomial functions over Zpn to be permutations, and this equivalent condition can help us to analysis the randomness of such functions. Our results provide a method to distinguish permutation polynomials from random functions. We also introduce how to improve the randomness of permutation polynomials over Zpn.