Abstract
A new deterministic algorithm is presented for testing whether a given polynomial of degreen over a finite field ofq elements is a permutation polynomial. The algorithm has computing time (nq)6/7+∈, and gives a positive answer to a question of Lidl and Mullen.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. Bombieri, On exponential sums in finite fields,Amer. J. Math. 88 (1966), 71–105.
J. von zur Gathen, polynomials over finite fields with large images, inProc. Symp. on Symbolic and Algebraic Comp., 1990, 140–144.
J. von zur Gathen, Tests for permutation polynomials,SIAM J. Comput. 20 (1991a), 591–602.
J. von zur Gathen, Values of polynomials over finite fields,Bull. Austral. Math. Soc. 43 (1991b), 141–146.
R. Lidl andG. L. Mullen, When does a polynomial over a finite field permute the elements of the field?Amer. Math. Month. 95 (1988), 243–246.
R. Lidl and H. Niederreiter,Finite Fields, Addison-Wesley, 1983.
J. Pila, Frobenius maps of abelian varieties and finding roots of unity in finite fields,Math. Comp. 55 (1990), 745–763.
R. L. Rivest, A. Shamir, andL. M. Adleman, A method for obtaining digital signatures and public-key cryptosystems,Comm. Assoc. Comput. Mach. 21 (1978), 120–126.
I. E. Shparlinski,Computational Problems in Finite Fields, Kluwer Acad. Publishers, Netherlands, to appear.