Publication date
April 2009
DOIAbstract
Based on preliminary numerical computations, we give complete results for linear and quadratic polynomials. Rivest’s result holds in the linear case while there are plenty of counterexamples in the quadratic case
Based on preliminary numerical computations, we give complete results for linear and quadratic polynomials. Rivest’s result holds in the linear case while there are plenty of counterexamples in the quadratic case
Permutation polynomials have applications in coding theory, cryptography, combinatorial designs, and...
AbstractThis paper gives nearly optimal lower bounds on the minimum degree of polynomial calculus re...
AbstractThis note is a continuation of a paper by the same authors that appeared in 2002 in the same...
This paper mainly studies problems about so called "permutation polynomials modulo $m$", polynomials...
AbstractWe give an exact characterization of permutation polynomials modulo n=2w, w≥2: a polynomial ...
AbstractLet v be the number of distinct values of a polynomial ƒ(x) of degree n over a finite field ...
AbstractLet v be the number of distinct values of a polynomial ƒ(x) of degree n over a finite field ...
AbstractKai Zhou (2008) [8] gave an explicit representation of the class of linear permutation polyn...
AbstractWe extend some classical results on polynomial functions modpl. We prove all results in alge...
AbstractWe give an explicit representation of the class of linear permutation polynomials. By the re...
Abstract. We give an explicit representation of the class of linearized permutation polynomials. By ...
Abstract. 1 Finding new classes of permutation polynomials is a chal-lenging problem with applicatio...
This note is a continuation of a paper by the same authors that appeared in 2002 in the same journal...
This note is a continuation of a paper by the same authors that appeared in 2002 in the same journal...
We give historical remarks related to arXiv:2112.14547 ("A New Method of Construction of Permutation...
Permutation polynomials have applications in coding theory, cryptography, combinatorial designs, and...
AbstractThis paper gives nearly optimal lower bounds on the minimum degree of polynomial calculus re...
AbstractThis note is a continuation of a paper by the same authors that appeared in 2002 in the same...
This paper mainly studies problems about so called "permutation polynomials modulo $m$", polynomials...
AbstractWe give an exact characterization of permutation polynomials modulo n=2w, w≥2: a polynomial ...
AbstractLet v be the number of distinct values of a polynomial ƒ(x) of degree n over a finite field ...
AbstractLet v be the number of distinct values of a polynomial ƒ(x) of degree n over a finite field ...
AbstractKai Zhou (2008) [8] gave an explicit representation of the class of linear permutation polyn...
AbstractWe extend some classical results on polynomial functions modpl. We prove all results in alge...
AbstractWe give an explicit representation of the class of linear permutation polynomials. By the re...
Abstract. We give an explicit representation of the class of linearized permutation polynomials. By ...
Abstract. 1 Finding new classes of permutation polynomials is a chal-lenging problem with applicatio...
This note is a continuation of a paper by the same authors that appeared in 2002 in the same journal...
This note is a continuation of a paper by the same authors that appeared in 2002 in the same journal...
We give historical remarks related to arXiv:2112.14547 ("A New Method of Construction of Permutation...
Permutation polynomials have applications in coding theory, cryptography, combinatorial designs, and...
AbstractThis paper gives nearly optimal lower bounds on the minimum degree of polynomial calculus re...
AbstractThis note is a continuation of a paper by the same authors that appeared in 2002 in the same...
Add to ORKG