Regular Section
Permutation Polynomials over Zpn and Their Randomness
2017 Volume E100.A Issue 3 Pages 913-915
Details
2017 Volume E100.A Issue 3 Pages 913-915
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.
