A deterministic test for permutation polynomials

I. E. Shparlinski

doi:10.1007/BF01202000

A deterministic test for permutation polynomials

I. E. Shparlinski^*

^*Corresponding author for this work

School of Computing

Research output: Contribution to journal › Article › peer-review

10 Citations (Scopus)

Abstract

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 language	English
Pages (from-to)	129-132
Number of pages	4
Journal	Computational Complexity
Volume	2
Issue number	2
DOIs	https://doi.org/10.1007/BF01202000
Publication status	Published - Jun 1992

Keywords

Subject classifications: 11T06, 68Q40

Access to Document

10.1007/BF01202000

Cite this

@article{7a95270de4314b54838dc2c304a3b643,

title = "A deterministic test for permutation polynomials",

abstract = "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.",

keywords = "Subject classifications: 11T06, 68Q40",

author = "Shparlinski, \{I. E.\}",

year = "1992",

month = jun,

doi = "10.1007/BF01202000",

language = "English",

volume = "2",

pages = "129--132",

journal = "Computational Complexity",

issn = "1016-3328",

publisher = "Springer, Springer Nature",

number = "2",

}

TY - JOUR

T1 - A deterministic test for permutation polynomials

AU - Shparlinski, I. E.

PY - 1992/6

Y1 - 1992/6

N2 - 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.

AB - 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.

KW - Subject classifications: 11T06, 68Q40

UR - https://www.scopus.com/pages/publications/0041194466

U2 - 10.1007/BF01202000

DO - 10.1007/BF01202000

M3 - Article

AN - SCOPUS:0041194466

SN - 1016-3328

VL - 2

SP - 129

EP - 132

JO - Computational Complexity

JF - Computational Complexity

IS - 2

ER -

A deterministic test for permutation polynomials

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this