When does a polynomial over a finite field permute the elements of the fields?
American Mathematical Monthly
Tests for permutation polynomials
SIAM Journal on Computing
The computational complexity of recognizing permutation functions
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Cryptographic properties of nonlinear pseudorandom number generators
Designs, Codes and Cryptography
Linear Equation on Polynomial Single Cycle T-Functions
Information Security and Cryptology
Note: APN permutations on Zn and Costas arrays
Discrete Applied Mathematics
Information hiding in software with mixed Boolean-arithmetic transforms
WISA'07 Proceedings of the 8th international conference on Information security applications
Cyclotomic mapping permutation polynomials over finite fields
SSC'07 Proceedings of the 2007 international conference on Sequences, subsequences, and consequences
Ambiguity and deficiency in costas arrays and APN permutations
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Note: Permutation polynomials and their differential properties over residue class rings
Discrete Applied Mathematics
| Hi-index | 0.00 |
We give an exact characterization of permutation polynomials modulo n=2^w, w=2: a polynomial P(x)=a"0+a"1x +...+a"dx^d with integral coefficients is a permutation polynomial modulo n if and only if a"1 is odd, (a"2+a"4+a"6+...) is even, and (a"3+a"5+a"7+...) is even. We also characterize polynomials defining latin squares modulo n=2^w, but prove that polynomial multipermutations (that is, a pair of polynomials defining a pair of orthogonal latin squares) modulo n=2^wdo not exist.