A deterministic test for permutation polynomials

I. E. Shparlinski*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

9 Citations (Scopus)


A new deterministic algorithm is presented for testing whether a given polynomial of degree n over a finite field of q 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.

Original languageEnglish
Pages (from-to)129-132
Number of pages4
JournalComputational Complexity
Issue number2
Publication statusPublished - Jun 1992


  • Subject classifications: 11T06, 68Q40


Dive into the research topics of 'A deterministic test for permutation polynomials'. Together they form a unique fingerprint.

Cite this