On cryptosystems based on polynomials and finite fields
Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
When does a polynomial over a finite field permute the elements of the fields?
American Mathematical Monthly
Finite fields
Cyclic codes with few weights and Niho exponents
Journal of Combinatorial Theory Series A
Finite Fields and Their Applications
More explicit classes of permutation polynomials of F33m
Finite Fields and Their Applications
On permutation polynomials of prescribed shape
Finite Fields and Their Applications
On constructing permutations of finite fields
Finite Fields and Their Applications
When does G(x )+γTr(H(x)) permute Fpn?
Finite Fields and Their Applications
Specific permutation polynomials over finite fields
Finite Fields and Their Applications
On some permutation binomials of the form x2n-1/k+1 + ax over f2n: existence and count
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
| Hi-index | 0.00 |
We present different results derived from a theorem stated by Wan and Lidl [Permutation polynomials of the form x^rf(x^(^q^-^1^)^/^d) and their group structure, Monatsh. Math. 112(2) (1991) 149-163] which treats specific permutations on finite fields. We first exhibit a new class of permutation binomials and look at some interesting subclasses. We then give an estimation of the number of permutation binomials of the form X^r(X^(^q^-^1^)^/^m+a) for a@?F"q^*. Finally we give applications in coding theory mainly related to a conjecture of Helleseth.