Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
