论文信息 - Permutation Polynomials Modulo 2w

Permutation Polynomials Modulo 2w

We give an exact characterization of permutation polynomials modulo n=2w, w?2: a polynomial P(x)=a0+a1x +···+adxd with integral coefficients is a permutation polynomial modulo n if and only if a1 is odd, (a2+a4+a6+···) is even, and (a3+a5+a7+···) is even. We also characterize polynomials defining latin squares modulo n=2w, but prove that polynomial multipermutations (that is, a pair of polynomials defining a pair of orthogonal latin squares) modulo n=2wdo not exist.

R. Rivest

[1] E. Wright,et al. An Introduction to the Theory of Numbers , 1939 .

[2] Claude E. Shannon,et al. Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[3] David Singmaster,et al. On polynomial functions (mod m) , 1974 .

[4] Rudolf Lidl,et al. Permutation Polynomials in RSA-Cryptosystems , 1983, CRYPTO.

[5] Rudolf Lide,et al. Finite fields , 1983 .

[6] Adi Shamir,et al. A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[7] Gary L. Mullen,et al. Polynomial functions (modm) , 1984 .

[8] R. Lidl,et al. When does a polynomial over a finite field permute the elements of the fields , 1988 .

[9] Joachim von zur Gathen. Tests for Permutation Polynomials , 1991, SIAM J. Comput..

[10] Serge Vaudenay,et al. On the Need for Multipermutations: Cryptanalysis of MD4 and SAFER , 1994, FSE.

[11] R. Matthews. Permutation properties of the polynomials 1++\cdots+^{} over a finite field , 1994 .

[12] Serge Vaudenay,et al. Black Box Cryptanalysis of Hash Networks Based on Multipermutations , 1994, EUROCRYPT.

[13] Serge Vaudenay,et al. Fast Software Encryption , 1998, Lecture Notes in Computer Science.