A deterministic test for permutation polynomials
From MaRDI portal
Publication:1207336
DOI10.1007/BF01202000zbMath0766.11048OpenAlexW1970367963MaRDI QIDQ1207336
Publication date: 1 April 1993
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01202000
Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)
Related Items (4)
Full classification of permutation rational functions and complete rational functions of degree three over finite fields ⋮ Counting curves and their projections ⋮ The computational complexity of recognizing permutation functions ⋮ Constructing Generalized Bent Functions from Trace Forms of Galois Rings
Cites Work
- Unnamed Item
- Tests for Permutation Polynomials
- Values of polynomials over finite fields
- When Does a Polynomial Over a Finite Field Permute the Elements of the Field?
- A method for obtaining digital signatures and public-key cryptosystems
- Frobenius Maps of Abelian Varieties and Finding Roots of Unity in Finite Fields
- On Exponential Sums in Finite Fields
This page was built for publication: A deterministic test for permutation polynomials
