A Note on a Theorem of Carlitz

摘要：

Let Fq denote the finite field of order q, where q =pn is an odd prime power.A polynomial f(x) with coefficients in Fq is called a permutation polynomial of Fq if the numbers f(a), a ∈ Fq, are distinct.Permutation polynomials over finite fields have been an interesting subject of study for many years, and have applications in coding theory, cryptography, combinatorial design theory, and many other areas of mathematics and engineering.For properties and applications of permutation polynomials and linearized polynomials see ”2”.

作者: Xiwang Cao

作者单位: School of Mathematics, Nanjing University of Aeronautics and Astronautics,Nanjing 210016, P.R.China; LMIB of Ministry of Education, Beijing University of Aeronautics and Astronautics,Beijing 100191, P.R.China;State Key Laboratory of Information Security, Graduate School of Chinese Academy of Sciences, Beijing 100049, P.R.China

会议类型: 国内会议

会议名称: 中国密码学会2011年会

会议地点: 长沙

会议语种:英文

页码: 164-165

在线出版日期: 2011-10-15（万方平台首次上网日期，不代表论文的发表时间）