Some Permutation Polynomials over Finite Fields and a Security Key Exchange Protocol
Xi Wang CAO Department of Mathematical Sciences,Nanjing University of Aeronautics and Astronautics, Nanjing 210016,P.R.China State Key of Information Security,Beijing 100049,P.R.China
Any function which maps from a finite field to itself can be represented as a polynomial,and a permutation polynomial is in fact a one-to-one map from a finite field to itself.Hence the research on permutation polynomials has been an important subject for at least 140 years,especially from 70s of the last century for the necessary of the study of cryptography.In this paper,two kinds of permutation polynomials are provided,and the reversibility of the these polynomials is proved.Therefore,one can construct a security key exchange protocol from these functions.
Xi Wang CAO Department of Mathematical Sciences,Nanjing University of Aeronautics and Astronautics, Nanjing 210016,P.R.China State Key of Information Security,Beijing 100049,P.R.China.
Some Permutation Polynomials over Finite Fields and a Security Key Exchange Protocol. Acta Mathematica Sinica, Chinese Series, 2009(05): 11-16 https://doi.org/10.12386/A2009sxxb0104