Orthogonal properties of Latin squares represented by permutation polynomials are discussed. Pairs of bivariate polynomials over small rings are considered.
Our work is motivated by a recent paper of Rivest 6, concerning permutation polynomials over the rings Zn with n = 2w. Permutation polynomials over finite fields and the rings Zn have lots of ...applications, including cryptography. For the special case n = 2w, a characterization has been obtained in 6 where it is shown that such polynomials can form a Latin square (0 ≤ x,y ≤ n - 1) if and only if the four univariate polynomials P(x, 0),P(x, 1),P(0,y) and P(1,y) are permutation polynomials. Further, it is shown that pairs of such polynomials will never form Latin squares. In this paper, we consider bivariate polynomials P(x,y) over the rings Zn when n ≠ 2w. Based on preliminary numerical computations, we give complete results for linear and quadratic polynomials. Rivest's result holds in the linear case while there are plenty of counterexamples in the quadratic case.
Our work is motivated by a recent paper of Rivest 6, concerning permutation polynomials over the rings Z( n) with n = 2( w). Permutation polynomials over finite fields and the rings Z( n) have lots ...of applications, including cryptography. For the special case n = 2( w), a characterization has been obtained in 6 where it is shown that such polynomials can form a Latin square (0 , x,y , n - 1) if and only if the four univariate polynomials P(x,0), P(x,1), P(0,y) and P(1, y) are permutation polynomials. Further, it is shown that pairs of such polynomials will never form Latin squares. In this paper, we consider bivariate polynomials P(x,y) over the rings Z( n) when n ne 2( w). Based on preliminary numerical computations, we give complete results for linear and quadratic polynomials. Rivest's result holds in the linear case while there are plenty of counterexamples in the quadratic case.
Our work is motivated by a recent paper of Rivest 6, concerning permutation polynomials over the rings Z^sub n^ with n = 2^sup w^. Permutation polynomials over finite fields and the rings Z^sub n^ ...have lots of applications, including cryptography. For the special case n = 2^sup w^, a characterization has been obtained in 6 where it is shown that such polynomials can form a Latin square (0 ≤ x,y ≤ n - 1) if and only if the four univariate polynomials P(x,0), P(x,1), P(0,y) and P(1, y) are permutation polynomials. Further, it is shown that pairs of such polynomials will never form Latin squares. In this paper, we consider bivariate polynomials P(x,y) over the rings Z^sub n^ when n ≠ 2^sup w^. Based on preliminary numerical computations, we give complete results for linear and quadratic polynomials. Rivest's result holds in the linear case while there are plenty of counterexamples in the quadratic case. PUBLICATION ABSTRACT
