scientific article; zbMATH DE number 1420010

MaRDI QIDQ4944609zbMATH OpenFDO

Authors Hong Zhang, Chong-Yun Chao

Publication date 17 December 2002

zbMATH Keywords

complexityfinite fieldefficient algorithmpermutation polynomial

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Finite fields (field-theoretic aspects) (12E20) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• Polynomials over finite fields which commute with a permutation polynomial
• New results on permutation polynomials of the form \((x^{{p}^{m}} - x + \delta)^s + x^{p^m} + x\) over \(\mathbb F_{p^{2m}}\)
• A_m-permutation polynomials
• Further results on permutation polynomials over finite fields
• Permutation polynomials over finite fields

This page was built for publication:

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