Cyclotomic mapping permutation polynomials over finite fields

Authors:
Qiang Wang
Affiliations:
School of Mathematics and Statistics, Carleton University, Ottawa, Ontario, Canada
Venue:
SSC'07 Proceedings of the 2007 international conference on Sequences, subsequences, and consequences
Year:
2007

Citing 10
Cited 3

Some further cryptographic applications of permutation polynomials

Cryptologia
When does a polynomial over a finite field permute the elements of the fields?

American Mathematical Monthly
Permutation polynomials, de Bruijn sequences, and linear complexity

Journal of Combinatorial Theory Series A
Finite fields

Finite fields
Circular Tuscan-k arrays from permutation binomials

Journal of Combinatorial Theory Series A
Constructions for Permutation Codes in Powerline Communications

Designs, Codes and Cryptography
On periodicity properties of Costas arrays and a conjecture on permutation polynomials

IEEE Transactions on Information Theory - Part 2
Interleavers for turbo codes using permutation polynomials over integer rings

IEEE Transactions on Information Theory
On Permutation Polynomials

Finite Fields and Their Applications
Permutation Polynomials Modulo 2w

Finite Fields and Their Applications

On inverse permutation polynomials

Finite Fields and Their Applications
On constructing permutations of finite fields

Finite Fields and Their Applications
Specific permutation polynomials over finite fields

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We explore a connection between permutation polynomials of the form xrf(x(q-1)/l) and cyclotomic mapping permutation polynomials over finite fields. As an application, we characterize a class of permutation binomials in terms of generalized Lucas sequences.