Key exchange based on Dickson polynomials over finite field with 2m

Pengcheng Wei, Xiaofeng Liao, Kwok-Wo Wong · Journal of Computers · 2011

Give a survey of the important properties of Dickson polynomial Dn(x,1), and prove that Dickson polynomial Dn(x,1) over finite field with 2m is a permutation polynomial if and only if n is odd. Use this fact to construct a new key agreement protocol which is secure, feasible and extensible.

Read the paper · More papers on PaperTik