Approximating a permutation over finite fields by Möbius transformations

DOI10.3969/J.ISSN.0253-2778.2013.07.008MaRDI QIDQ5399995zbMATH OpenFDO

Authors Lin Wang, Yunfei Cao, Wenzheng Zhang

Publication date 28 February 2014

zbMATH Keywords

permutation polynomialCarlitz rankMöbius transformation

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• Nonlinear permutations of a space over a finite field induced by linear transformations of a module over a Galois ring
• On Almost Perfect Nonlinear Permutations
• Permutations of finite fields with prescribed properties
• A highly nonlinear differentially 4 uniform power mapping that permutes fields of even degree
• Perfect nonlinear functions and cryptography

This page was built for publication: Approximating a permutation over finite fields by Möbius transformations

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