Key exchange based on Dickson polynomials over finite field with 2m
|
Title | Key exchange based on Dickson polynomials over finite field with 2m |
Authors | |
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. |
Publisher | ACADEMY PUBLISHER |
Date | 2011-12-01 |
Source | Journal of Computers Vol 6, No 12 (2011): Special Issue: Selected Best Papers of ICFMD2010 |
Rights | Copyright © ACADEMY PUBLISHER - All Rights Reserved.To request permission, please check out URL: http://www.academypublisher.com/copyrightpermission.html. |