Tests for Permutation Polynomials

DOI10.1137/0220037MaRDI QIDQ3360269zbMATH OpenOpenAlexFDO

Authors Joachim von zur Gathen

Publication date 1991

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0220037

zbMATH Keywords

algorithmscomplexityfinite fieldopen problemspermutation polynomialpolynomials of exponentially large degreeprobabilistic testsurvey

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16) Symbolic computation and algebraic computation (68W30)

Recommendations

• A deterministic test for permutation polynomials
• The computational complexity of recognizing permutation functions
• Tests for permutation functions
• When Does a Polynomial over a Finite Field Permute the Elements of the Field?, II
• scientific article; zbMATH DE number 426128

Cited in

(12)

• A deterministic test for permutation polynomials
• Tests for permutation functions
• Test polynomials
• Constructing generalized bent functions from trace forms of Galois rings
• Cryptological Applications of Permutation Polynomials
• Tests with respect to permutations of variables in Boolean functions
• The computational complexity of recognizing permutation functions
• The computational complexity of recognizing permutation functions
• Permutation polynomials modulo 2w
• Counting curves and their projections
• Generating new classes of permutation polynomials
• Periodic representations and rational approximations of square roots

This page was built for publication: Tests for Permutation Polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3360269)