Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
401170 | Journal of Symbolic Computation | 2014 | 11 Pages |
Abstract
Permutation polynomials of finite fields have many applications in cryptography, coding theory, and combinatorics. In the first part we mention some applications of a class of permutation polynomials with additional features which includes complete mappings and orthomorphisms. In the second part we discuss several constructions. We focus on linearized polynomials and cyclotomic polynomials of degree 2.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Arne Winterhof,