Tests for Permutation Polynomials

DOI10.1137/0220037zbMath0733.11048OpenAlexW2014468786MaRDI QIDQ3360269

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

surveycomplexityalgorithmsfinite fieldopen problemspermutation polynomialprobabilistic testpolynomials of exponentially large degree

Mathematics Subject Classification ID

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

Related Items (6)

Counting curves and their projections ⋮ A deterministic test for permutation polynomials ⋮ Permutation polynomials modulo \(2^w\) ⋮ The computational complexity of recognizing permutation functions ⋮ Constructing Generalized Bent Functions from Trace Forms of Galois Rings ⋮ Periodic representations and rational approximations of square roots

This page was built for publication: Tests for Permutation Polynomials