Tests for Permutation Polynomials

DOI10.1137/0220037zbMATH Open0733.11048OpenAlexW2014468786MaRDI QIDQ3360269FDOQ3360269

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

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

zbMATH Keywords

algorithmssurveycomplexityfinite fieldpermutation polynomialopen problemsprobabilistic testpolynomials of exponentially large degree

Mathematics Subject Classification ID

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

Cited In (10)

• Cryptological Applications of Permutation Polynomials
• Constructing Generalized Bent Functions from Trace Forms of Galois Rings
• Counting curves and their projections
• Test polynomials
• Periodic representations and rational approximations of square roots
• Permutation polynomials modulo \(2^w\)
• Tests with respect to permutations of variables in Boolean functions
• A deterministic test for permutation polynomials
• Tests for permutation functions
• The computational complexity of recognizing permutation functions

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)